{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:32:27Z","timestamp":1787333547218,"version":"build-2736575974"},"reference-count":37,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1996,5]]},"abstract":"<jats:p>In this paper we introduce and analyze a class of optimization methods, called projected sequential quadratic programming (SQP) methods, for the solution of optimization problems with nonlinear equality constraints and simple bound constraints on parts of the variables. Such problems frequently arise in the numerical solution of optimal control problems. Projected SQP methods combine the ideas of projected Newton methods and SQP methods. They use the simple projection onto the set defined by the bound constraints and maintain feasibility with respect to these constraints. The iterates are computed using an extension of SQP methods and require only the solution of the linearized equality constraint. Global convergence of these methods is enforced using a constrained merit function and an Armijo-like line search. We discuss global and local convergence properties of these methods, the identification of active indices, and we present numerical examples for an optimal control problem governed by a nonlinear heat equation.<\/jats:p>","DOI":"10.1137\/0806022","type":"journal-article","created":{"date-parts":[[2005,2,23]],"date-time":"2005-02-23T05:51:47Z","timestamp":1109137907000},"page":"373-417","source":"Crossref","is-referenced-by-count":29,"title":["Projected Sequential Quadratic Programming Methods"],"prefix":"10.1137","volume":"6","author":[{"given":"Matthias","family":"Heinkenschloss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1080\/01630569008816371"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1137\/0320018"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02192216"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8330-5_5"},{"key":"R5","unstructured":"J. Bonnans, C. Pola, A trust region interior point algorithm for linearly constrained optimization, Tech. rep., 1948, INRIA, Domaine de Voluceau, 78153 Rocquencourt, France, 1993"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939935"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0727009"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588794"},{"key":"R9","unstructured":"T. F. Coleman, J. Liu, An interior Newton method for quadratic programming, CTC93TR153, Center for Theory and Simulation in Science and Engineering, Cornell University, Ithaca, NY, 1993"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0728030"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0804044"},{"key":"R12","first-page":"83","volume-title":"Numerical optimization, 1984 (Boulder, Colo., 1984)","author":"Dembo Ron S.","year":"1985"},{"key":"R13","volume-title":"Numerical methods for unconstrained optimization and nonlinear equations","author":"Dennis, Jr. John E.","year":"1983"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/0728015"},{"key":"R15","unstructured":"A. S. El-Bakry, R. A. Tapia, T. Tsuchiya, Y. Zhang, On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming, TR92\u201340, Dept. of Computational & Applied Mathematics, Rice University, Houston, TX, 1992, (revised May 1993)"},{"key":"R16","volume-title":"Nonlinear programming: Sequential unconstrained minimization techniques","author":"Fiacco Anthony V.","year":"1968"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-597050-1.50007-5"},{"key":"R18","volume-title":"Practical methods of optimization","author":"Fletcher R.","year":"1987"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1137\/0804018"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1080\/02331938908843462"},{"key":"R21","doi-asserted-by":"crossref","unstructured":"P. E. Gill, W. Murray, D. B. Poncele\u00f3n, M. A. Saunders, Solving reduced KKT systems in barrier methods for linear and quadratic programming, Tech. report, SOL 91\u20137, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, CA, 1991","DOI":"10.21236\/ADA239191"},{"key":"R22","unstructured":"P. E. Gill, W. Murray, M. A. Saunders, M. H. Wright, P. M. Pardalos, Some theoretical properties of an augmented Lagrangian merit function, Advances in Optimization and Parallel Computing, Elsevier Science Publishers B.V., 1992, 101\u20131280814.90094"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012993249900"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1137\/0806008"},{"key":"R25","unstructured":"F.S. Kupfer, Ph.D. Thesis, Reduced Successive Quadratic Programming in Hilbert Space with Applications to Optimal Control, Universit\u00e4t Trier, Fb\u2013IV, Mathematik, D\u201354286 Trier, Germany, 1992"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0043221"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1007\/BF00247656"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582568"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1137\/0805030"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1145\/138351.138359"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1137\/0722050"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588787"},{"key":"R33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01395810"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002300"},{"key":"R35","doi-asserted-by":"publisher","DOI":"10.1137\/0802023"},{"key":"R36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01587086"},{"key":"R37","doi-asserted-by":"publisher","DOI":"10.1137\/0803019"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0806022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:08:30Z","timestamp":1787332110000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0806022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["10.1137\/0806022"],"URL":"https:\/\/doi.org\/10.1137\/0806022","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}