{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:32:03Z","timestamp":1742920323196,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030778750"},{"type":"electronic","value":"9783030778767"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77876-7_32","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"477-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Machine Learning Algorithms of Relaxation Subgradient Method with Space Extension"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8704-1670","authenticated-orcid":false,"given":"Vladimir N.","family":"Krutikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir V.","family":"Meshechkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena S.","family":"Kagan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0667-4001","authenticated-orcid":false,"given":"Lev A.","family":"Kazakovtsev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C Lemarechal","year":"1995","unstructured":"Lemarechal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995). https:\/\/doi.org\/10.1007\/BF01585555","journal-title":"Math. Program."},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s10957-011-9908-1","volume":"152","author":"P Richtarik","year":"2012","unstructured":"Richtarik, P.: Approximate level method for non smooth convex minimization. J. Optim. Theory Appl. 152, 334\u2013350 (2012)","journal-title":"J. Optim. Theory Appl."},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1134\/S0965542518010050","volume":"58","author":"AV Gasnikov","year":"2018","unstructured":"Gasnikov, A.V., Nesterov, Y.E.: Universal method for stochastic composite optimization problems. Comput. Math. Math. Phys. 58, 48\u201364 (2018)","journal-title":"Comput. Math. Math. Phys."},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Shor, N.Z.: Nondifferentiable Optimization and Polynomial Problems. Springer Science, New York (1998). https:\/\/doi.org\/10.1007\/978-1-4757-6015-6","DOI":"10.1007\/978-1-4757-6015-6"},{"issue":"4","key":"32_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: The conjugate gradient method in extremal problems. USSR Comput. Math. Math. Phys. 9(4), 94\u2013112 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"32_CR6","unstructured":"Polyak, B.T.: Introduction to Optimization. Optimization Software, New York (1987)"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BFb0120700","volume":"3","author":"C Lemarechal","year":"1975","unstructured":"Lemarechal, C.: An extension of Davidon methods to non-differentiable problems. Math. Program. Study 3, 95\u2013109 (1975)","journal-title":"Math. Program. Study"},{"key":"32_CR8","unstructured":"Dem\u2019yanov, V.F., Vasil\u2019ev, L.V.: Non-differentiable Optimization. Springer-Verlag, New York (1985)"},{"key":"32_CR9","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovsky","year":"1983","unstructured":"Nemirovsky, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley, Chichester (1983)"},{"key":"32_CR10","doi-asserted-by":"publisher","unstructured":"Shor, N.Z.: Minimization methods for non-differentiable functions. In: Springer Series in Computational Mathematics, vol. 3. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82118-9","DOI":"10.1007\/978-3-642-82118-9"},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/0041-5553(69)90061-5","volume":"9","author":"BT Polyak","year":"1969","unstructured":"Polyak, B.T.: Optimization of non-smooth composed functions. USSR Comput. Math. Math. Phys. 9(3), 507\u2013521 (1969)","journal-title":"USSR Comput. Math. Math. Phys."},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1134\/S0005117919010090","volume":"80","author":"VN Krutikov","year":"2019","unstructured":"Krutikov, V.N., Samoilenko, N.S., Meshechkin, V.V.: On the properties of the method of minimization for convex functions with relaxation on the distance to extremum. Autom. Remote Control 80(1), 102\u2013111 (2019)","journal-title":"Autom. Remote Control"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S.: Online Learning and Online Convex Optimization, Now Foundations and Trends (2012)","DOI":"10.1561\/9781601985477"},{"issue":"1","key":"32_CR14","first-page":"106","volume":"39","author":"VN Krutikov","year":"2003","unstructured":"Krutikov, V.N., Petrova, T.V.: Relaxation method of minimization with space extension in the subgradient direction. Ekon. Mat. Met. 39(1), 106\u2013119 (2003)","journal-title":"Ekon. Mat. Met."},{"issue":"4","key":"32_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3390\/pr7040221","volume":"7","author":"H Cao","year":"2019","unstructured":"Cao, H., Song, Y., Khan, K.A.: Convergence of subtangent-based relaxations of nonlinear programs. Processes 7(4), 221 (2019)","journal-title":"Processes"},{"issue":"4","key":"32_CR16","first-page":"37","volume":"45","author":"VN Krutikov","year":"2009","unstructured":"Krutikov, V.N., Gorskaya, T.A.: A family of relaxation subgradient methods with two-rank correction of metric matrices. Ekon. Mat. Met. 45(4), 37\u201380 (2009)","journal-title":"Ekon. Mat. Met."},{"issue":"4","key":"32_CR17","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1134\/S0005117914040055","volume":"75","author":"EA Nurminskii","year":"2014","unstructured":"Nurminskii, E.A., Thien, D.: Method of conjugate subgradients with constrained memory. Autom. Remote Control 75(4), 646\u2013656 (2014)","journal-title":"Autom. Remote Control"},{"key":"32_CR18","doi-asserted-by":"publisher","unstructured":"Neimark, J.I.: Perceptron and pattern recognition. In: Mathematical Models in Natural Science and Engineering. Foundations of Engineering Mechanics. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-47878-2_27","DOI":"10.1007\/978-3-540-47878-2_27"},{"key":"32_CR19","doi-asserted-by":"publisher","unstructured":"Krutikov, V.N., Shkaberina, G.Sh., Zhalnin, M.N., Kazakovtsev, L.A.: New method of training two-layer sigmoidal neural networks with regularization. In: 2019 International Conference on Information Technologies (InfoTech), Varna, pp. 1\u20134 (2019). https:\/\/doi.org\/10.1109\/InfoTech.2019.8860890","DOI":"10.1109\/InfoTech.2019.8860890"},{"key":"32_CR20","doi-asserted-by":"publisher","unstructured":"Amini, S., Ghaernmaghami, S.: Sparse autoencoders using non-smooth regularization. In: 26th European Signal Processing Conference (EUSIPCO), Rome, pp. 2000\u20132004 (2018). https:\/\/doi.org\/10.23919\/EUSIPCO.2018.8553217","DOI":"10.23919\/EUSIPCO.2018.8553217"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Tibshirani, R.J.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"}],"container-title":["Lecture Notes in Computer Science","Mathematical Optimization Theory and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77876-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:07:27Z","timestamp":1623625647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77876-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030778750","9783030778767"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77876-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MOTOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Optimization Theory and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Irkutsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"motor2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.icc.ru\/e\/motor2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}