{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T16:02:07Z","timestamp":1726848127633},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T00:00:00Z","timestamp":1335225600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s12532-012-0041-4","type":"journal-article","created":{"date-parts":[[2012,4,23]],"date-time":"2012-04-23T11:35:29Z","timestamp":1335180929000},"page":"181-209","source":"Crossref","is-referenced-by-count":18,"title":["A penalty-interior-point algorithm for nonlinear constrained optimization"],"prefix":"10.1007","volume":"4","author":[{"given":"Frank E.","family":"Curtis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,24]]},"reference":[{"key":"41_CR1","unstructured":"Benson, H.Y., Sen, A., Shanno, D.F.: Convergence analysis of an interior-point method for nonconvex nonlinear programming. Optimiz. Methods Softw. submitted (2010)"},{"issue":"4","key":"41_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0305-0548(94)90024-8","volume":"21","author":"B. Borchers","year":"1994","unstructured":"Borchers B., Mitchell J.E.: An improved branch and bound algorithm for mixed integer nonlinear programming. Comput. Operat. Res. 21(4), 359\u2013367 (1994)","journal-title":"Comput. Operat. Res."},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Breitfeld, M.G., Shanno, D.F.: A globally convergent penalty-barrier algorithm for nonlinear programming and its computational performance. RUTCOR Research Report, RRR 12-94, Rutgers University, New Brunswick, NJ, USA. Technical report (1994)","DOI":"10.1007\/978-3-642-79459-9_5"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF02206826","volume":"62","author":"M.G. Breitfeld","year":"1996","unstructured":"Breitfeld M.G., Shanno D.F.: Computational experience with penalty-barrier methods for nonlinear programming. Ann. Operat. Res. 62, 439\u2013463 (1996)","journal-title":"Ann. Operat. Res."},{"issue":"5","key":"41_CR5","doi-asserted-by":"crossref","first-page":"2281","DOI":"10.1137\/080738222","volume":"20","author":"R.H. Byrd","year":"2008","unstructured":"Byrd R.H., Curtis F.E., Nocedal J.: Infeasibility detection and SQP methods for nonlinear optimization. SIAM J. Optimiz. 20(5), 2281\u20132299 (2008)","journal-title":"SIAM J. Optimiz."},{"issue":"1","key":"41_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/PL00011391","volume":"89","author":"R.H. Byrd","year":"2000","unstructured":"Byrd R.H., Gilbert J.-Ch., Nocedal J.: Trust region method based on interior point techniques for nonlinear programming. Math. Programm. 89(1), 149\u2013185 (2000)","journal-title":"Math. Programm."},{"issue":"1","key":"41_CR7","first-page":"27","volume":"100","author":"R.H. Byrd","year":"2004","unstructured":"Byrd R.H., Gould N.I.M., Nocedal J., Waltz R.A.: An algorithm for nonlinear optimization using linear programming and equality constrained subproblems. Math. Program. 100(1), 27\u201348 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"41_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S1052623403426532","volume":"16","author":"R.H. Byrd","year":"2005","unstructured":"Byrd R.H., Gould N.I.M., Nocedal J., Waltz R.A.: On the convergence of successive linear-quadratic programming algorithms. SIAM J. Optimiz. 16(2), 471 (2005)","journal-title":"SIAM J. Optimiz."},{"issue":"2","key":"41_CR9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/10556780701394169","volume":"23","author":"R.H. Byrd","year":"2008","unstructured":"Byrd R.H., Nocedal J., Waltz R.A.: Steering exact penalty methods for nonlinear programming. Optimiz. Methods Softw. 23(2), 197\u2013213 (2008)","journal-title":"Optimiz. Methods Softw."},{"issue":"1","key":"41_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-005-0701-5","volume":"108","author":"L. Chen","year":"2006","unstructured":"Chen L., Goldfarb D.: Interior-point L2 penalty methods for nonlinear programming with strong global convergence properties. Math. Program. 108(1), 1\u201336 (2006)","journal-title":"Math. Program."},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Chen, L., Goldfarb, D.: On the fast local convergence of interior-point l2 penalty methods for nonlinear programming, technical report. Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA. Technical Report x (2006)","DOI":"10.1007\/s10107-005-0701-5"},{"key":"41_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J.J.: Benchmarking optimization software with performance profiles. Math. Program. Ser A 91, 201\u2013213 (2002)","journal-title":"Math. Program. Ser A"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear programming: sequential unconstrained minimization techniques. Classics in Applied Mathematics. SIAM, Philadelphia, PA, USA (1990)","DOI":"10.1137\/1.9781611971316"},{"issue":"4","key":"41_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/S0036144502414942","volume":"44","author":"A. Forsgren","year":"2002","unstructured":"Forsgren A., Gill P.E., Wright M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44(4), 525\u2013597 (2002)","journal-title":"SIAM Rev."},{"key":"41_CR15","volume-title":"AMPL: a modeling language for mathematical programming","author":"R. Fourer","year":"2002","unstructured":"Fourer R., Gay D.M., Kernighan B.W.: AMPL: a modeling language for mathematical programming. Brooks\/Cole, Pacific Grove (2002)"},{"key":"41_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1023\/A:1008705028512","volume":"14","author":"D. Goldfarb","year":"1999","unstructured":"Goldfarb D., Polyak R.A., Scheinberg K., Yuzefovich I.: A modified barrier-augmented lagrangian method for constrained minimization. Comput. Optimiz. Appl. 14, 55\u201374 (1999)","journal-title":"Comput. Optimiz. Appl."},{"issue":"1","key":"41_CR17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/200979.201043","volume":"21","author":"N.I.M. Gould","year":"1995","unstructured":"Gould N.I.M., Bongartz I., Conn A.R., Toint Ph.L.: CUTE: constrained and unconstrained testing environment. ACM Transact. Math. Softw. 21(1), 123\u2013160 (1995)","journal-title":"ACM Transact. Math. Softw."},{"key":"41_CR18","unstructured":"Gould, N.I.M., Orban, D., Toint, Ph.L.: An interior-point l1-penalty method for nonlinear optimization, technical report. Rutherford Appleton Laboratory, Chilton, Oxfordshire, England. Technical report (2003)"},{"issue":"4","key":"41_CR19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould N.I.M., Orban D., Toint Ph.L.: CUTEr and SifDec: a constrained and unconstrained testing environment, revisited. ACM Transact. Math. Softw. 29(4), 373\u2013394 (2003)","journal-title":"ACM Transact. Math. Softw."},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M., Robinson, D.P.: A second derivative SQP method: global convergence. SIAM J. Optimiz. submitted (2010)","DOI":"10.1137\/080744542"},{"issue":"3","key":"41_CR21","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"I.E. Grossmann","year":"2002","unstructured":"Grossmann I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optimiz. Eng. 3(3), 227\u2013252 (2002)","journal-title":"Optimiz. Eng."},{"issue":"1","key":"41_CR22","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF00934594","volume":"30","author":"W. Hock","year":"1980","unstructured":"Hock W., Schittkowski K.: Test examples for nonlinear programming codes. J. Optimiz. Theory Appl. 30(1), 127\u2013129 (1980)","journal-title":"J. Optimiz. Theory Appl."},{"issue":"2","key":"41_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10957-004-5154-0","volume":"123","author":"X. Hu","year":"2004","unstructured":"Hu X., Ralph D.: Convergence of a penalty method for mathematical programming with complementarity constraints. J. Optimiz. Theory Appl. 123(2), 365\u2013390 (2004)","journal-title":"J. Optimiz. Theory Appl."},{"key":"41_CR24","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1017\/S033427000000240X","volume":"21","author":"K. Jittorntrum","year":"1980","unstructured":"Jittorntrum K., Osborne M.: A modified barrier function method with improved rate of convergence for degenerate problems. J. Aus. Math. Soc. Ser. B 21, 305\u2013329 (1980)","journal-title":"J. Aus. Math. Soc. Ser. B"},{"issue":"1","key":"41_CR25","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S. Leyffer","year":"2006","unstructured":"Leyffer S., Lopez-Calva G., Nocedal J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optimiz. 17(1), 52 (2006)","journal-title":"SIAM J. Optimiz."},{"key":"41_CR26","unstructured":"Maratos, N.: Exact Penalty Function Algorithms for Finite-Dimensional and Control Optimization Problems. PhD thesis, Department of Computing and Control, University of London (1978)"},{"issue":"4","key":"41_CR27","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0893-9659(01)00162-8","volume":"15","author":"J.L. Morales","year":"2002","unstructured":"Morales J.L.: A numerical study of limited memory BFGS methods. Appl. Math. Lett. 15(4), 481\u2013488 (2002)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"41_CR28","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1137\/060649513","volume":"19","author":"J. Nocedal","year":"2009","unstructured":"Nocedal J., W\u00e4chter A., Waltz R.A.: Adaptive barrier update strategies for nonlinear interior methods. SIAM J. Optimiz. 19(4), 1674\u20131693 (2009)","journal-title":"SIAM J. Optimiz."},{"key":"41_CR29","volume-title":"Numerical Optimization, Springer Series in Operations Research","author":"J. Nocedal","year":"2006","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization, Springer Series in Operations Research, 2nd edn. Springer, New York (2006)","edition":"2"},{"key":"41_CR30","unstructured":"Polyak, R.A.: Smooth optimization methods for solving nonlinear extremal and equilibrium problems with constraints. In: Eleventh international symposium on mathematical programming, Bonn, Germany (1982)"},{"issue":"1\u20133","key":"41_CR31","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R.A. Polyak","year":"1992","unstructured":"Polyak R.A.: Modified barrier functions (theory and methods). Math. Program. 54(1\u20133), 177\u2013222 (1992)","journal-title":"Math. Program."},{"issue":"1","key":"41_CR32","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556780701363065","volume":"23","author":"R.A. Polyak","year":"2008","unstructured":"Polyak R.A.: Primal-dual exterior point method for convex optimization. Optimiz. Methods Softw. 23(1), 141\u2013160 (2008)","journal-title":"Optimiz. Methods Softw."},{"issue":"10\u201311","key":"41_CR33","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I. Quesada","year":"1992","unstructured":"Quesada I., Grossmann I.E.: An LP\/NLP based branch and bound algorithm for convex minlp optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"41_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.25.1.1.15213","volume":"25","author":"H. Scheel","year":"2000","unstructured":"Scheel H., Scholtes S.: Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math. Operat. Res. 25(1), 1\u201322 (2000)","journal-title":"Math. Operat. Res."},{"key":"41_CR35","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. Optimiz. Appl. 13, 231\u2013252 (1999)","journal-title":"Comput. Optimiz. Appl."},{"key":"41_CR36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623403426556","volume":"16","author":"A. W\u00e4chter","year":"2005","unstructured":"W\u00e4chter A., Biegler L.T.: Line search filter methods for nonlinear programming: motivation and global convergence. SIAM J. Optimiz. 16, 1\u201331 (2005)","journal-title":"SIAM J. Optimiz."},{"issue":"1","key":"41_CR37","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A. W\u00e4chter","year":"2006","unstructured":"W\u00e4chter A., Biegler L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0041-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-012-0041-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-012-0041-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,13]],"date-time":"2022-01-13T19:37:00Z","timestamp":1642102620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-012-0041-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,24]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s12532-012-0041-4","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,24]]}}}