{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:01Z","timestamp":1752378001369,"version":"3.41.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":[[2003,10]]},"DOI":"10.1023\/a:1025589804531","type":"journal-article","created":{"date-parts":[[2003,9,23]],"date-time":"2003-09-23T18:26:26Z","timestamp":1064341586000},"page":"5-34","source":"Crossref","is-referenced-by-count":3,"title":["A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems"],"prefix":"10.1007","volume":"26","author":[{"given":"Paul","family":"Armand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5141766_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S1052623498344720","volume":"11","author":"P. Armand","year":"2000","unstructured":"P. Armand, J.C. Gilbert, and S. Jan-J\u00e9gou, \u201cA feasible BFGS interior point algorithm for solving convex minimization problems,\u201d SIAM Journal on Optimization, vol. 11, pp. 199-222, 2000.","journal-title":"SIAM Journal on Optimization"},{"key":"5141766_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s101070100283","volume":"92","author":"P. Armand","year":"2002","unstructured":"P. Armand, J.C. Gilbert, and S. Jan-J\u00e9gou, \u201cA BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach,\u201d Math. Program., vol. 92, pp. 393-424, 2002. ISMP 2000, Part 2, Atlanta, GA.","journal-title":"Math. Program."},{"key":"5141766_CR3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"R.H. Byrd","year":"2000","unstructured":"R.H. Byrd, J.C. Gilbert, and J. Nocedal, \u201cAtrust region method based on interior point techniques for nonlinear programming,\u201d Mathematical Programming, vol. 89, pp. 149-185, 2000.","journal-title":"Mathematical Programming"},{"key":"5141766_CR4","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1137\/0726042","volume":"26","author":"R.H. Byrd","year":"1989","unstructured":"R.H. Byrd and J. Nocedal, \u201cA tool for the analysis of quasi-Newton methods with application to unconstrained minimization,\u201d SIAM Journal on Numerical Analysis, vol. 26, pp. 727-739, 1989.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"5141766_CR5","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. John Wiley and Sons, Inc.: New York-London-Sydney, 1968."},{"key":"5141766_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02591987","volume":"36","author":"J. Herskovits","year":"1986","unstructured":"J. Herskovits, \u201cA two-stage feasible directions algorithm for nonlinear constrained optimization,\u201d Mathematical Programming, vol. 36, pp. 19-38, 1986.","journal-title":"Mathematical Programming"},{"key":"5141766_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms, I","author":"J.-B. Hiriart-Urruty","year":"1993","unstructured":"J.-B. Hiriart-Urruty and C. Lemar\u00e9chal, Convex Analysis and Minimization Algorithms, I, Springer-Verlag: Berlin, 1993. Fundamentals."},{"key":"5141766_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1080\/10556789608805638","volume":"6","author":"C.T. Lawrence","year":"1996","unstructured":"C.T. Lawrence and A.L. Tits, \u201cNonlinear equality constraints in feasible sequential quadratic programming,\u201d Optimization Methods and Software, vol. 6, pp. 265-282, 1996.","journal-title":"Optimization Methods and Software"},{"key":"5141766_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01580371","volume":"11","author":"D.Q. Mayne","year":"1976","unstructured":"D.Q. Mayne and E. Polak, \u201cFeasible directions algorithms for optimization problems with equality and inequality constraints,\u201d Mathematical Programming, vol. 11, pp. 67-80, 1976.","journal-title":"Mathematical Programming"},{"key":"5141766_CR10","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, with application to the nonlinear complementarity problem,\u201d Pacific J. Math., vol. 88, pp. 101-161, 1980.","journal-title":"Pacific J. Math."},{"key":"5141766_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1018339901042","volume":"10","author":"R.D.C. Monteiro","year":"1998","unstructured":"R.D.C. Monteiro and F. Zhou, \u201cOn the existence and convergence of the central path for convex programming and some duality results,\u201d Comput. Optim. Appl., vol. 10, pp. 51-77, 1998.","journal-title":"Comput. Optim. Appl."},{"key":"5141766_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"J. Nocedal and S.J. Wright, Numerical Optimization, Springer-Verlag: New York, 1999."},{"key":"5141766_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1093\/imamat\/7.1.21","volume":"7","author":"M.J.D. Powell","year":"1971","unstructured":"M.J.D. Powell, \u201cOn the convergence of the variable metric algorithm,\u201d J. Inst. Math. Appl., vol. 7, pp. 21-36, 1971.","journal-title":"J. Inst. Math. Appl."},{"key":"5141766_CR14","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, N.J., 1970."},{"key":"5141766_CR15","series-title":"Technical Report","volume-title":"A primal-dual interior-point method for nonlinear programming with strong global and local convergence properties","author":"A.L. Tits","year":"2002","unstructured":"A.L. Tits, A. W\u00e4achter, S. Bakhtiari, T.J. Urban, and C.T. Lawrence, \u201cA primal-dual interior-point method for nonlinear programming with strong global and local convergence properties,\u201d Technical Report TR 2002-29, Institute for Systems Research, University of Maryland, College Park, MD 20742, USA, July 2002."},{"key":"5141766_CR16","doi-asserted-by":"crossref","unstructured":"S.J. Wright, Primal-Dual Interior-Point Methods, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.","DOI":"10.1137\/1.9781611971453"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025589804531.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025589804531\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025589804531.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:05:33Z","timestamp":1752375933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025589804531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141766"],"URL":"https:\/\/doi.org\/10.1023\/a:1025589804531","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}