{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T14:28:35Z","timestamp":1776868115870,"version":"3.51.2"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T00:00:00Z","timestamp":1182470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2007,11,11]]},"DOI":"10.1007\/s10589-007-9048-6","type":"journal-article","created":{"date-parts":[[2007,6,21]],"date-time":"2007-06-21T17:16:41Z","timestamp":1182446201000},"page":"371-399","source":"Crossref","is-referenced-by-count":47,"title":["An exact primal\u2013dual penalty method approach to\u00a0warmstarting interior-point methods for linear programming"],"prefix":"10.1007","volume":"38","author":[{"given":"Hande Y.","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David F.","family":"Shanno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,22]]},"reference":[{"key":"9048_CR1","unstructured":"Anitescu, M.: Nonlinear programs with unbounded Lagrange multiplier sets. Technical report ANL\/MCS-P793-0200, Argonne National Labs"},{"issue":"2","key":"9048_CR2","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/s10589-005-3908-8","volume":"34","author":"H.Y. Benson","year":"2006","unstructured":"Benson, H.Y., Sen, A., Shanno, D.F., Vanderbei, R.J.: Interior point algorithms, penalty methods and equilibrium problems. Comput. Optim. Appl. 34(2), 155\u2013182 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9048_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10107-003-0418-2","volume":"99","author":"H.Y. Benson","year":"2004","unstructured":"Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: Jamming and comparative numerical testing. Math. Program. A 99(1), 35\u201348 (2004)","journal-title":"Math. Program. A"},{"key":"9048_CR4","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Research Analysis Corporation, McLean, Virginia (1968). Republished in 1990 by SIAM, Philadelphia"},{"key":"9048_CR5","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, Chichester (1987)"},{"key":"9048_CR6","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R. Fourer","year":"1993","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Scientific Press, Danvers (1993)"},{"key":"9048_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(91)90265-X","volume":"152","author":"R.M. Freund","year":"1991","unstructured":"Freund, R.M.: Theoretical efficiency of a shifted barrier function algorithm for linear programming. Linear Algebra Appl. 152, 19\u201341 (1991)","journal-title":"Linear Algebra Appl."},{"key":"9048_CR8","first-page":"125","volume":"83","author":"J. Gondzio","year":"1998","unstructured":"Gondzio, J.: Warm start of the primal\u2013dual method applied in the cutting plane scheme. Math. Program. 83, 125\u2013143 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9048_CR9","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1137\/S1052623401393141","volume":"13","author":"J. Gondzio","year":"2003","unstructured":"Gondzio, J., Grothey, A.: Reoptimization with the primal\u2013dual interior point method. SIAM J. Optim. 13(3), 842\u2013864 (2003)","journal-title":"SIAM J. Optim."},{"key":"9048_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1008748810765","volume":"14","author":"J. Gondzio","year":"1999","unstructured":"Gondzio, J., Vial, J.-Ph.: Warm start and \u03b5-subgradients in cutting plane scheme for block-angular linear programs. Comput. Optim. Appl. 14, 17\u201336 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"9048_CR11","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: An interior-point l1-penalty method for nonlinear optimization. Technical report RAL-TR-2003-022, Rutherford Appleton Laboratory Chilton, Oxfordshire, UK (November 2003)"},{"key":"9048_CR12","volume-title":"Introduction to Mathematical Programming","author":"F.S. Hillier","year":"1977","unstructured":"Hillier, F.S., Lieberman, G.J.: Introduction to Mathematical Programming, 2nd edn. McGraw-Hill, New York (1977)","edition":"2"},{"key":"9048_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal\u2013dual infeasible-interior-point algorithm for linear programming. Math. Program. 61, 263\u2013400 (1993)","journal-title":"Math. Program."},{"key":"9048_CR14","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Technical report NA-182, Department of Mathematics, University of Dundee (August 1998)"},{"key":"9048_CR15","unstructured":"Leyffer, S., Lopez-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. Technical report OTC 2004-10, Northwestern University, Evanston, IL (December 2004)"},{"key":"9048_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. ORSA J. Comput. 6, 1\u201314 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9048_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: A 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans. Model. Comput. Simul. 8(1), 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"9048_CR18","volume-title":"Linear and Nonlinear Programming","author":"S.G. Nash","year":"1996","unstructured":"Nash, S.G., Sofer, A.: Linear and Nonlinear Programming. McGraw-Hill, New York (1996)"},{"key":"9048_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"Polyak, R.: Modified barrier functions (theory and methods). Math. Program. 54, 177\u2013222 (1992)","journal-title":"Math. Program."},{"issue":"11","key":"9048_CR20","doi-asserted-by":"crossref","first-page":"4365","DOI":"10.1090\/S0002-9947-1995-1308023-8","volume":"347","author":"L.A. Shepp","year":"1995","unstructured":"Shepp, L.A., Vanderbei, R.J.: The complex zeros of random polynomials. Trans. Am. Math. Soc. 347(11), 4365\u20134384 (1995)","journal-title":"Trans. Am. Math. Soc."},{"key":"9048_CR21","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"12","author":"R.J. Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: LOQO: an interior point code for quadratic programming. Optim. Methods Softw. 12, 451\u2013484 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9048_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"R.J. Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231\u2013252 (1999)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"9048_CR23","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1137\/S1052623400369235","volume":"12","author":"E.A. Yildirim","year":"2002","unstructured":"Yildirim, E.A., Wright, S.J.: Warm-start strategies in interior-point methods for linear programming. SIAM J. Optim. 12(3), 782\u2013810 (2002)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9048-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9048-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9048-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:31Z","timestamp":1559302591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9048-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,22]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,11,11]]}},"alternative-id":["9048"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9048-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,22]]}}}