{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T16:15:59Z","timestamp":1777738559499,"version":"3.51.4"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975950","type":"print"},{"value":"9783031975967","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:00:00Z","timestamp":1748390400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T00:00:00Z","timestamp":1748390400000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-97596-7_11","type":"book-chapter","created":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T09:15:06Z","timestamp":1751793306000},"page":"167-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Augmented Lagrangian for\u00a0LP Feasibility"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3126-0078","authenticated-orcid":false,"given":"Pablo","family":"Guerrero-Garc\u00eda","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-1436","authenticated-orcid":false,"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8679-2886","authenticated-orcid":false,"given":"Ana Maria A. C.","family":"Rocha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Bixby, R.E.: Implementing the simplex method: the initial basis. ORSA J. Comput. 4(3), 267\u2013284 (1992)","DOI":"10.1287\/ijoc.4.3.267"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1080\/10556788.2019.1604702","volume":"35","author":"I Galabova","year":"2020","unstructured":"Galabova, I., Hall, J.: The \u2018idiot\u2019 crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems. Optim. Methods Softw. 35(3), 488\u2013501 (2020)","journal-title":"Optim. Methods Softw."},{"key":"11_CR4","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Committee on Algorithms (COAL) Newslett. 13, 10\u201312 (1985)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Gould, N., Scott, J.: A note on performance profiles for benchmarking software. ACM Trans. Math. Softw. 43(2), 15(1\u20135) (2017)","DOI":"10.1145\/2950048"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Guerrero-Garc\u00eda, P., Hendrix, E.M.T.: On active-set LP algorithms allowing basis deficiency. In: Gervasi, O., Murgante, B., Misra, S., Rocha, A., Garau, C. (eds.) Computational Science and Its Applications\u2013Proceedings of the ICCSA 2022 Workshops, Part II, LNCS, vol. 13378, pp. 174\u2013187. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10562-3_13","DOI":"10.1007\/978-3-031-10562-3_13"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Guerrero-Garc\u00eda, P., Hendrix, E.M.T.: Experiments with active-set LP algorithms allowing basis deficiency. Computers 12(3), 1\u201323 (2023). https:\/\/doi.org\/10.3390\/computers12010003","DOI":"10.3390\/computers12010003"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF00940486","volume":"75","author":"O G\u00fcler","year":"1992","unstructured":"G\u00fcler, O.: Augmented Lagrangian algorithms for linear programming. J. Optim. Theory Appl. 75, 445\u2013470 (1992)","journal-title":"J. Optim. Theory Appl."},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-40065-5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2e edn. Springer, New York, NY, USA (2006). https:\/\/doi.org\/10.1007\/978-0-387-40065-5","edition":"2e"},{"issue":"5","key":"11_CR10","first-page":"740","volume":"8","author":"BT Polyak","year":"1972","unstructured":"Polyak, B.T., Tretjakov, N.V.: An iterative method of linear programming and its economic interpretation. Ekon. Mat. Metody 8(5), 740\u2013751 (1972). in Russian","journal-title":"Ekon. Mat. Metody"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2025 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97596-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:22:20Z","timestamp":1777461740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97596-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,28]]},"ISBN":["9783031975950","9783031975967"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97596-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,28]]},"assertion":[{"value":"28 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}