{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T09:05:51Z","timestamp":1777367151530,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1023\/a:1008625410523","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"221-230","source":"Crossref","is-referenced-by-count":3,"title":["Convergence and Error Bound for Perturbation of Linear Programs"],"prefix":"10.1007","volume":"13","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"190512_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1287\/moor.22.1.43","volume":"22","author":"A. Auslender","year":"1997","unstructured":"A. Auslender, R. Cominetti and M. Haddou, \u201cAsymptotic analysis for penalty and barrier methods in convex and linear programming,\u201d Mathematics of Operations Research, vol. 22, pp. 43-62, 1997.","journal-title":"Mathematics of Operations Research"},{"key":"190512_CR2","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press: New York, NY, 1982."},{"key":"190512_CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02190058","volume":"83","author":"R. Cominetti","year":"1994","unstructured":"R. Cominetti and J.P. Dussault, \u201cStable exponential-penalty algorithm with superlinear convergence,\u201d Journal of Optimization Theory and Applications, vol. 83, pp. 285-309, 1994.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190512_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01582220","volume":"67","author":"R. Cominetti","year":"1994","unstructured":"R. Cominetti and J. San Mart\u00edn, \u201cAsymptotic analysis of the exponential penalty trajectory in linear programming,\u201d Mathematical Programming, vol. 67, pp. 169-187, 1994.","journal-title":"Mathematical Programming"},{"key":"190512_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01417214","volume":"36","author":"S.C. Fang","year":"1992","unstructured":"S.C. Fang, \u201cAn unconstrained convex programming view of linear programming,\u201d Zeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research, vol. 36, pp. 149-161, 1992.","journal-title":"Zeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research"},{"key":"190512_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6131-6","volume-title":"Entropy Optimization and Mathematical Programming","author":"S.C. Fang","year":"1997","unstructured":"S.C. Fang, J.R. Rajasekera and H.-S.J. Tsao, Entropy Optimization and Mathematical Programming, Kluwer: Norwell, MA, 1997."},{"key":"190512_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01414155","volume":"37","author":"S.C. Fang","year":"1993","unstructured":"S.C. Fang and H.-S.J. Tsao, \u201cLinear programming with entropic perturbation,\u201d Zeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research, vol. 37, pp. 171-186, 1993.","journal-title":"Zeitschrift f\u00fcr Operations Research \u2014 Methods and Models of Operations Research"},{"key":"190512_CR8","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF02192539","volume":"89","author":"S.C. Fang","year":"1996","unstructured":"S.C. Fang and H.-S.J. Tsao, \u201cOn the Entropic Perturbation and Exponential Penalty Methods for Linear Programming,\u201d Journal of Optimization Theory and Applications, vol. 89, pp. 461-466, 1996.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190512_CR9","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01442401","volume":"23","author":"M.C. Ferris","year":"1991","unstructured":"M.C. Ferris and O.L. Mangasarian, \u201cFinite perturbation of convex programs,\u201d Applied Mathematics and Optimization, vol. 23, pp. 263-273, 1991.","journal-title":"Applied Mathematics and Optimization"},{"key":"190512_CR10","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley: New York, NY, 1968 (reprinted by SIAM, Philadelphia, PA, 1990)."},{"key":"190512_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.6028\/jres.049.027","volume":"49","author":"A.J. Hoffman","year":"1952","unstructured":"A.J. Hoffman, \u201cOn approximate solutions of systems of linear inequalities,\u201d Journal of Research of the National Bureau of Standards, vol. 49, pp. 263-265, 1952.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"190512_CR12","volume-title":"Mathematical Methods and Theory in Games, Programming, and Economics","author":"S. Karlin","year":"1959","unstructured":"S. Karlin, Mathematical Methods and Theory in Games, Programming, and Economics, vol. I, Addison-Wesley: Reading, MA, 1959."},{"key":"190512_CR13","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/S1052623493258556","volume":"6","author":"K. Madsen","year":"1996","unstructured":"K. Madsen, H.B. Nielsen and M.\u00c7. Pinar, \u201cA new finite continuation algorithm for linear programming,\u201d SIAM Journal on Optimization, vol. 6, pp. 600-616, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"190512_CR14","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0718039","volume":"18","author":"O.L. Mangasarian","year":"1981","unstructured":"O.L. Mangasarian, \u201cIterative solution of linear programs,\u201d SIAM Journal on Numerical Analysis, vol. 18, pp. 606-614, 1981.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"190512_CR15","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0121017","volume":"22","author":"O.L. Mangasarian","year":"1984","unstructured":"O.L. Mangasarian, \u201cNormal solution of linear programs,\u201d Mathematical Programming Study, vol. 22, pp. 206-216, 1984.","journal-title":"Mathematical Programming Study"},{"key":"190512_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BFb0076712","volume-title":"Optimization and Related Fields","author":"O.L. Mangasarian","year":"1986","unstructured":"O.L. Mangasarian, \u201cSome applications of penalty functions in mathematical programming,\u201d in Optimization and Related Fields, Springer-Verlag: Heidelberg, pp. 307-329, 1986."},{"key":"190512_CR17","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1137\/0317052","volume":"17","author":"O.L. Mangasarian","year":"1979","unstructured":"O.L. Mangasarian and R. R. Meyer, \u201cNonlinear perturbation of linear programs,\u201d SIAM Journal on Control and Optimization, vol. 17, pp. 745-752, 1979.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"190512_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2140\/pjm.1980.88.101","volume":"88","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, \u201cAn analogue of Moreau's proximation theorem,\u201d Pacific Journal of Mathematics, vol. 88, pp. 101-161, 1980.","journal-title":"Pacific Journal of Mathematics"},{"key":"190512_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming, Interior-Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in Progress in Mathematical Programming, Interior-Point and Related Methods, Springer-Verlag: Berlin, pp. 131-158, 1989."},{"key":"190512_CR20","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1023\/A:1022651331550","volume":"93","author":"M.\u00c7. Pinar","year":"1997","unstructured":"M.\u00c7. Pinar, \u201cPiecewise-linear pathways to the optimal solution set in linear programming,\u201d Journal of Optimization Theory and Applications, vol. 93, pp. 619-634, 1997.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190512_CR21","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1007\/BF00940495","volume":"75","author":"J.R. Rajasekera","year":"1992","unstructured":"J.R. Rajasekera and S.C. Fang, \u201cDeriving an unconstrained convex program for linear programming,\u201d Journal of Optimization Theory and Applications, vol. 75, pp. 603-612, 1992.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190512_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar, Convex Analysis, Princeton University Press: Princeton, NJ, 1970."},{"key":"190512_CR23","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/BF02192238","volume":"85","author":"P. Tseng","year":"1995","unstructured":"P. Tseng, \u201cLinearly constrained convex programming as unconstrained differentiable concave programming,\u201d Journal of Optimization Theory and Applications, vol. 85, pp. 489-494, 1995.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"190512_CR24","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9939-1969-0246200-8","volume":"23","author":"D.W. Walkup","year":"1969","unstructured":"D.W. Walkup and R.J.-B. Wets, \u201cA Lipschitzian characterization of convex polyhedra,\u201d Proceedings of the American Mathematical Society, vol. 23, pp. 167-173, 1969.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"190512_CR25","first-page":"341","volume-title":"Acta Numerica","author":"M.H. Wright","year":"1992","unstructured":"M.H. Wright, \u201cInterior methods for constrained optimization,\u201d in Acta Numerica, Cambridge University Press: New York, pp. 341-407, 1992."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008625410523.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008625410523\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008625410523.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:32:01Z","timestamp":1752377521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008625410523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["190512"],"URL":"https:\/\/doi.org\/10.1023\/a:1008625410523","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}