{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T07:04:46Z","timestamp":1787382286229,"version":"build-2736575974"},"reference-count":37,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2002,1]]},"abstract":"<jats:p>A linear program has a unique least 2-norm solution, provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve certain equivalent perturbed quadratic programs or unconstrained minimization problems. We provide in this paper a new theory which is different from these traditional methods and is an effective numerical method for seeking the least 2-norm solution of a linear program. The essence of this method is a (interior-point-like) path-following algorithm that traces a newly introduced regularized central path that is fairly different from the central path used in interior-point methods. One distinguishing feature of our method is that it imposes no assumption on the problem. The iterates generated by this algorithm converge to the least 2-norm solution whenever the linear program is solvable; otherwise, the iterates converge to a point which gives a minimal KKT residual when the linear program is unsolvable.<\/jats:p>","DOI":"10.1137\/s1052623401386368","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"893-912","source":"Crossref","is-referenced-by-count":7,"title":["Locating the Least 2-Norm Solution of Linear Programs via a Path-Following Method"],"prefix":"10.1137","volume":"12","author":[{"given":"Yun-Bin","family":"Zhao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Duan","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,28]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02591799"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.3.735"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012997322935"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1006\/jmaa.1993.1101"},{"key":"R5","unstructured":"C. Kanzow, H. Qi, and L. Qi,\n                      On the Minimum Norm Solution of Linear Programming\n                      , Technical report, Department of Mathematics, Center for Optimization and Approximation, Hamburg, Germany, 2000."},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187901"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(93)00314-P"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1137\/0910013"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.4.754"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0325023"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939047"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1080\/02331938708843296"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(79)90014-4"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0718039"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(83)90283-4"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121017"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"O.Mangasarian, Least norm solution of nonmonotone linear complementarity problems, Oxford Univ. Press, New York, 1990, 217\u201322192d:90098","DOI":"10.1093\/oso\/9780195057294.003.0014"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448356"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0317052"},{"key":"R20","volume-title":"Linear optimization and extensions","author":"Padberg Manfred","year":"1995"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584084"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.3.435"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2311-6"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580588"},{"key":"R25","unstructured":"V.Skarin, Methods for the correction of ill\u2010posed problems of linear and convex programming by using a sequential programming approach, Seminarberichte, Vol. 81, Humboldt Univ. Berlin, 1986, 130\u201314488a:90133"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/0893-9659(88)90158-9"},{"key":"R27","doi-asserted-by":"crossref","unstructured":"RomanSznajder, M.Gowda, On the limiting behavior of the trajectory of regularized solutions of aP0\u2010complementarity problem, Appl. Optim., Vol. 22, Kluwer Acad. Publ., Dordrecht, 1999, 371\u20133792000b:90098","DOI":"10.1007\/978-1-4757-6388-1_19"},{"key":"R28","unstructured":"A.Tucker, A least\u2010distance approach to quadratic programming, Amer. Math. Soc., Providence, R.I., 1968, 163\u201317639:2463"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"A.Tucker, Least distance programming, Princeton Univ. Press, Princeton, N. J., 1970, 583\u201358855:12086","DOI":"10.1515\/9781400869930-035"},{"key":"R30","volume-title":"Solutions of ill\u2010posed problems","author":"Tikhonov Andrey","year":"1977"},{"key":"R31","volume-title":"Model building in mathematical programming","author":"Williams H.","year":"1990"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121249"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580381"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032701"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.26.1.119.10594"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012900372477"},{"key":"R37","unstructured":"Y. B. Zhao and D. Li,\n                      A New Path\u2010Following Algorithm for Nonlinearp*Complementarity Problems\n                      , Technical report, Department of SEEM, Chinese University of Hong Kong, Hong Kong, 2000."}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623401386368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:28:17Z","timestamp":1787333297000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623401386368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1137\/S1052623401386368"],"URL":"https:\/\/doi.org\/10.1137\/s1052623401386368","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}