{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T07:14:32Z","timestamp":1747898072008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030628666"},{"type":"electronic","value":"9783030628673"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62867-3_10","type":"book-chapter","created":{"date-parts":[[2020,11,5]],"date-time":"2020-11-05T08:05:11Z","timestamp":1604563511000},"page":"122-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Method of Parametric Correction in Data Transformation and Approximation Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2435-0796","authenticated-orcid":false,"given":"Victor","family":"Gorelik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5185-0687","authenticated-orcid":false,"given":"Tatiana","family":"Zolotova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"10_CR1","unstructured":"Eremin I.I.: Theory of Linear Optimization. Inverse and Ill-Posed Problems Series. VSP, Utrecht, Boston, Koln, Tokyo (2002)"},{"issue":"41","key":"10_CR2","first-page":"1615","volume":"11","author":"VA Gorelik","year":"2001","unstructured":"Gorelik, V.A.: Matrix correction of a linear programming problem with inconsistent constraints. Comput. Math. Math. Phys. 11(41), 1615\u20131622 (2001)","journal-title":"Comput. Math. Math. Phys."},{"key":"10_CR3","volume-title":"Optimal Matrix Correction of Inconsistent Systems of Linear Algebraic Equations by Minimal Euclidean Norm","author":"VA Gorelik","year":"2004","unstructured":"Gorelik, V.A., Erohin, V.I.: Optimal Matrix Correction of Inconsistent Systems of Linear Algebraic Equations by Minimal Euclidean Norm. CC RAS, Moscow (2004)"},{"key":"10_CR4","volume-title":"Methods of Correction of Improper Problems and Their Application to Optimization and Classification","author":"VA Gorelik","year":"2012","unstructured":"Gorelik, V.A., Murav\u2019eva, O.V.: Methods of Correction of Improper Problems and Their Application to Optimization and Classification. CC RAS, Moscow (2012)"},{"issue":"73","key":"10_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1134\/S0005117912020026","volume":"2","author":"VI Erokhin","year":"2012","unstructured":"Erokhin, V.I., Krasnikov, A.S., Khvostov, M.N.: Matrix corrections minimal with respect to the Euclidean norm for linear programming problems. Autom. Remote Control 2(73), 219\u2013231 (2012)","journal-title":"Autom. Remote Control"},{"issue":"10","key":"10_CR6","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1016\/j.sigpro.2006.11.004","volume":"87","author":"A Back","year":"2007","unstructured":"Back, A.: The matrix-restricted total least squares problem. Signal Process 87(10), 2303\u20132312 (2007)","journal-title":"Signal Process"},{"key":"10_CR7","first-page":"1","volume":"2","author":"I Markovsky","year":"2010","unstructured":"Markovsky, I.: Bibliography on total least squares and related methods. Stat. Inter. 2, 1\u20136 (2010)","journal-title":"Stat. Inter."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1016\/j.sigpro.2007.04.004","volume":"87","author":"I Markovsky","year":"2007","unstructured":"Markovsky, I., Van Huffel, S.: Overview on total least squares methods. Signal Process. 87, 2283\u20132302 (2007)","journal-title":"Signal Process."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Shiryaev, A.N.: Essentials of Stochastic Finance: Facts, Models, Theory. World Scientific Publishing Co., Pte. Ltd., Singapore (1999)","DOI":"10.1142\/3907"},{"key":"10_CR10","first-page":"35","volume":"3","author":"VA Gorelik","year":"2016","unstructured":"Gorelik, V.A., Zolotova, T.V.: Issues the formation of an optimal stock portfolio of Russian companies with a probabilistic risk function. Financ. J. 3, 35\u201344 (2016). Research financial institute","journal-title":"Financ. J."},{"key":"10_CR11","unstructured":"Gorelik, V.A., Trembacheva (Barkalova) O.S.: Solution of the linear regression problem using matrix correction methods in the $$l_1$$ metric. Comput. Math. Math. Phys. 2(56), 200\u2013205 (2016)"},{"issue":"6","key":"10_CR12","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0906029","volume":"2","author":"M Osborne","year":"1985","unstructured":"Osborne, M., Watson, J.: An analysis of the total approximation problem in separable norms, and an algorithm for the total $$l_1$$ problem. SIAM J. Sci. Stat. Comput. 2(6), 410\u2013424 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"17","key":"10_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1137\/S0895479893258802","volume":"1","author":"JB Rosen","year":"1996","unstructured":"Rosen, J.B., Park, H., Glick, J.: Total least norm formulation and solution for structured problems. SIAM J. Matrix Anal. Appl. 1(17), 110\u2013128 (1996)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1134\/S106456241705026X","volume":"96","author":"ZM Shibzukhov","year":"2017","unstructured":"Shibzukhov, Z.M.: On the principle of empirical risk minimization based on averaging aggregation functions. Doklady Math. 96(2), 494\u2013497 (2017). https:\/\/doi.org\/10.1134\/S106456241705026X","journal-title":"Doklady Math."},{"key":"10_CR15","unstructured":"Regions of Russia. Socio-economic indicators (2018). https:\/\/www.gks.ru\/storage\/mediabank\/Reg-pok18.pdf. Accessed 30 Oct 2019"}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62867-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T23:21:07Z","timestamp":1619306467000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62867-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030628666","9783030628673"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62867-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=optima-2020","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":"60","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":"21","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":"2","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":"35% - 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.25","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.23","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}