{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:35:13Z","timestamp":1742992513768,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031232350"},{"type":"electronic","value":"9783031232367"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-23236-7_37","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T01:22:43Z","timestamp":1672536163000},"page":"533-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Complexity of\u00a0a\u00a0Linear Programming Predictor-Corrector Algorithm Using the\u00a0Two Norm Neighborhood"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5817-3818","authenticated-orcid":false,"given":"Ana","family":"Teixeira","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1834-5333","authenticated-orcid":false,"given":"R.","family":"Almeida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10957-008-9500-5","volume":"141","author":"G Al-Jeiroudi","year":"2009","unstructured":"Al-Jeiroudi, G., Gondzio, J.: Convergence analysis of the inexact infeasible interior-point method for linear optimization. J. Optim. Theory Appl. 141, 231\u2013247 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s11750-014-0346-8","volume":"23","author":"R Almeida","year":"2015","unstructured":"Almeida, R., Teixeira, A.: On the convergence of a predictor-corrector variant algorithm. TOP 23(2), 401\u2013418 (2015)","journal-title":"TOP"},{"issue":"1","key":"37_CR3","first-page":"3","volume":"13","author":"F Bastos","year":"1993","unstructured":"Bastos, F., Paix\u00e3o, J.: Interior-point approaches to the transportation and assignment problems on microcomputers. Investiga\u00e7\u00e3o Operacional 13(1), 3\u201315 (1993)","journal-title":"Investiga\u00e7\u00e3o Operacional"},{"key":"37_CR4","unstructured":"Dantzig, G.B.: Linear programming, in problems for the numerical analysis of the future. In: Proceedings of the Symposium on Modern Calculating Machinery and Numerical Methods. Appl. Math. 15, 18\u201321 (1951)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01580610","volume":"60","author":"O G\u00fcler","year":"1993","unstructured":"G\u00fcler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Math. Program. 60, 215\u2013228 (1993)","journal-title":"Math. Program."},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"NK Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polinomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1137\/S1052623497329993","volume":"11","author":"J Korzak","year":"2000","unstructured":"Korzak, J.: Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM J. Optim. 11(1), 133\u2013148 (2000)","journal-title":"SIAM J. Optim."},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S Mizuno","year":"1994","unstructured":"Mizuno, S.: Polynomiality of infeasible interior-point algorithms for linear programming. Math. Program. 67, 109\u2013119 (1994)","journal-title":"Math. Program."},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"F Potra","year":"1994","unstructured":"Potra, F.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Math. Program. 67, 383\u2013406 (1994)","journal-title":"Math. Program."},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1137\/050628787","volume":"18","author":"M Salahi","year":"2007","unstructured":"Salahi, M., Peng, J., Terlaky, T.: On mehrotra-type predictor-corrector algorithms. SIAM J. Optim. 18(4), 1377\u20131397 (2007)","journal-title":"SIAM J. Optim."},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-319-09129-7_19","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"AP Teixeira","year":"2014","unstructured":"Teixeira, A.P., Almeida, R.: A study of the complexity of an infeasible predictor-corrector variant of Mehrotra algorithm. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8580, pp. 253\u2013266. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09129-7_19"},{"key":"37_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"37_CR14","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF02592215","volume":"73","author":"S Wright","year":"1996","unstructured":"Wright, S., Zhang, Y.: A superquadratic infeasible interior point method for linear complementarity problems. Math. Program. 73, 269\u2013289 (1996)","journal-title":"Math. Program."},{"issue":"1","key":"37_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4(1), 208\u2013227 (1994)","journal-title":"SIAM J. Optim."},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."},{"key":"37_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02206814","volume":"62","author":"Z Zhang","year":"1996","unstructured":"Zhang, Z., Zhang, Y.: A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence. Ann. Oper. Res. 62, 131\u2013150 (1996)","journal-title":"Ann. Oper. Res."},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1137\/0802015","volume":"2","author":"Y Zhang","year":"1992","unstructured":"Zhang, Y., Tapia, R.A., Dennis, J.E.: On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms. SIAM J. Optim. 2, 304\u2013324 (1992)","journal-title":"SIAM J. Optim."}],"container-title":["Communications in Computer and Information Science","Optimization, Learning Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23236-7_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:32:12Z","timestamp":1672540332000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23236-7_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031232350","9783031232367"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23236-7_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OL2A","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization, Learning Algorithms and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bragan\u00e7a","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ol2a2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ol2a.ipb.pt\/EN_index.html","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":"145","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":"53","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":"3","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":"37% - 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","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}