{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:32:24Z","timestamp":1768973544015,"version":"3.49.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1007\/bf01588794","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:19:53Z","timestamp":1114676393000},"page":"285-323","source":"Crossref","is-referenced-by-count":63,"title":["An analysis of reduced Hessian methods for constrained optimization"],"prefix":"10.1007","volume":"49","author":[{"given":"Richard H.","family":"Byrd","sequence":"first","affiliation":[]},{"given":"Jorge","family":"Nocedal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"584","volume-title":"Proceedings of the Eighteenth Allerton Conference on Communication, Control and Computing","author":"D.P. Bertsekas","year":"1980","unstructured":"D.P. Bertsekas, \u201cVariable metric methods for constrained optimization using differentiable exact penalty functions,\u201dProceedings of the Eighteenth Allerton Conference on Communication, Control and Computing (University of Illinois Press, Champaign, IL, 1980) pp. 584\u2013593."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/0721071","volume":"21","author":"P.T. Boggs","year":"1984","unstructured":"P.T. Boggs and J.W. Tolle, \u201cA family of descent functions for constrained optimization,\u201dSIAM Journal on Numerical Analysis 21 (1984) 1146\u20131161.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR3","volume-title":"\u201cExtensions to the theory and efficient utilization of a merit function for nonlinear programming,\u201d Technical Report 85-5","author":"P.T. Boggs","year":"1985","unstructured":"P.T. Boggs and J.W. Tolle, \u201cExtensions to the theory and efficient utilization of a merit function for nonlinear programming,\u201d Technical Report 85-5, Curriculum in Operations Research and Systems Analysis, University of North Carolina (Chapel Hill, 1985)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01586093","volume":"32","author":"R.H. Byrd","year":"1985","unstructured":"R.H. Byrd, \u201cAn example of irregular convergence in some constrained optimization methods that use the projected Hessian,\u201dMathematical Programming 32 (1985) 232\u2013237.","journal-title":"Mathematical Programming"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1137\/0727009","volume":"27","author":"R.H. Byrd","year":"1990","unstructured":"R.H. Byrd, \u201cOn the convergence of constrained optimization methods with accurate Hessian information on a subspace,\u201dSIAM Journal on Numerical Analysis 27 (1990) 141\u2013153.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR6","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,\u201dSIAM Journal on Numerical Analysis 26 (1989) 727\u2013739.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1137\/0724077","volume":"24","author":"R.H. Byrd","year":"1987","unstructured":"R.H. Byrd, J. Nocedal and Y. Yuan, \u201cGlobal convergence of a class of quasi-Newton methods on convex problems,\u201dSIAM Journal on Numerical Analysis 24 (1987) 1171\u20131190.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01589439","volume":"35","author":"R.H. Byrd","year":"1986","unstructured":"R.H. Byrd and R.B. Schnabel, \u201cContinuity of the null space basis and constrained optimization,\u201dMathematical Programming 35 (1986) 32\u201341.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"R.M. Chamberlain","year":"1982","unstructured":"R.M. Chamberlain, C. Lemarechal, H.C. Pedersen and M.J.D. Powell, \u201cThe watchdog technique for forcing convergence in algorithms for constrained optimization,\u201dMathematical Programming Studies 16 (1982) 1\u201317.","journal-title":"Mathematical Programming Studies"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01585101","volume":"24","author":"T.F. Coleman","year":"1982","unstructured":"T.F. Coleman and A.R. Conn, \u201cNonlinear programming via an exact penalty function: global analysis,\u201dMathematical Programming 24 (1982) 137\u2013161.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/0721051","volume":"21","author":"T.F. Coleman","year":"1984","unstructured":"T.F. Coleman and A.R. Conn, \u201cOn the local convergence of a quasi-Newton method for the nonlinear programming problem,\u201dSIAM Journal on Numerical Analysis 21 (1984) 755\u2013769.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/BF02592223","volume":"29","author":"T.F. Coleman","year":"1984","unstructured":"T.F. Coleman and D. Sorensen, \u201cA note on the computation of an orthonormal basis for the null space of a matrix,\u201dMathematical Programming 29 (1984) 234\u2013242.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/1019005","volume":"19","author":"J.E. Dennis Jr.","year":"1977","unstructured":"J.E. Dennis, Jr. and J.J. Mor\u00e9, \u201cQuasi-Newton methods, motivation and theory,\u201dSIAM Review 19 (1977) 46\u201389.","journal-title":"SIAM Review"},{"key":"CR14","unstructured":"P. Fenyes, \u201cPartitioned quasi-Newton methods for nonlinear equality constrained optimization,\u201d Ph.D. Dissertation, Department of Computer Science, Cornell University (1987)."},{"key":"CR15","volume-title":"Integer and Nonlinear Programming","author":"R. Fletcher","year":"1970","unstructured":"R. Fletcher, \u201cA class of methods for nonlinear programming with termination and convergence properties,\u201d in: J. Abadie, ed.,Integer and Nonlinear Programming (North-Holland, Amsterdam, 1970)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF01580117","volume":"5","author":"R. Fletcher","year":"1973","unstructured":"R. Fletcher, \u201cAn exact penalty for nonlinear programming with inequalities,\u201dMathematical Programming 5 (1973) 129\u2013150.","journal-title":"Mathematical Programming"},{"key":"CR17","volume-title":"Numerical Analysis, Lecture Notes in Mathematics, No. 912","author":"R. Fletcher","year":"1982","unstructured":"R. Fletcher, \u201cSecond order corrections for nondifferentiable optimization,\u201d in: G.A. Watson, ed.,Numerical Analysis, Lecture Notes in Mathematics, No. 912 (Springer, Berlin, 1982)."},{"key":"CR18","volume-title":"\u201cA first derivative method for nonlinear programming based on successive\u2113 1 LP,\u201d Numerical Analysis Report NA\/114","author":"R. Fletcher","year":"1988","unstructured":"R. Fletcher, \u201cA first derivative method for nonlinear programming based on successive\u2113 1 LP,\u201d Numerical Analysis Report NA\/114, Department of Mathematics and Computer Science, University of Dundee (Dundee, 1988)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1137\/0725042","volume":"25","author":"R. Fontecilla","year":"1988","unstructured":"R. Fontecilla, \u201cLocal convergence of secant methods for nonlinear constrained optimization,\u201dSIAM Journal on Numerical Analysis 25 (1988) 692\u2013712.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/BFb0120946","volume":"16","author":"D. Gabay","year":"1982","unstructured":"D. Gabay, \u201cReduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization,\u201dMathematical Programming Study 16 (1982) 18\u201344.","journal-title":"Mathematical Programming Study"},{"key":"CR21","volume-title":"\u201cMaintaining the positive definiteness of the matrices in reduced Hessian methods for equality constrained optimization,\u201d International Institute for Applied System Analysis Technical Report WP-87-123","author":"J.C. Gilbert","year":"1987","unstructured":"J.C. Gilbert, \u201cMaintaining the positive definiteness of the matrices in reduced Hessian methods for equality constrained optimization,\u201d International Institute for Applied System Analysis Technical Report WP-87-123 (Laxenburg, Austria, 1987)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1007\/BF01582244","volume":"33","author":"P.E. Gill","year":"1985","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, G.W. Stewart and M.H. Wright, \u201cProperties of a representation of a basis for the null space,\u201dMathematical Programming 33 (1985) 172\u2013186.","journal-title":"Mathematical Programming"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00933239","volume":"28","author":"S.T. Glad","year":"1979","unstructured":"S.T. Glad, \u201cProperties of updating methods for the multipliers in augmented Lagrangians,\u201dJournal of Optimization Theory and Applications 28 (1979) 135\u2013156.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01580395","volume":"11","author":"S.P. Han","year":"1976","unstructured":"S.P. Han, \u201cSuperlinearly convergent variable metric algorithms for general nonlinear programming problems,\u201dMathematical Programming 11 (1976) 263\u2013282.","journal-title":"Mathematical Programming"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00932858","volume":"22","author":"S.P. Han","year":"1977","unstructured":"S.P. Han, \u201cA globally convergent method for nonlinear programming,\u201dJournal on Optimization Theory and Application 22 (1977) 297\u2013309.","journal-title":"Journal on Optimization Theory and Application"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BFb0120947","volume":"16","author":"D.Q. Mayne","year":"1982","unstructured":"D.Q. Mayne and E. Polak, \u201cA superlinearly convergent algorithm for constrained optimization problems,\u201dMathematical Programming Studies 16 (1982) 45\u201361.","journal-title":"Mathematical Programming Studies"},{"key":"CR27","volume-title":"\u201cProjected Lagrangian methods based on the trajectories of penalty and barrier functions,\u201d Systems Optimization Laboratory Report 78-23","author":"W. Murray","year":"1978","unstructured":"W. Murray and M.H. Wright, \u201cProjected Lagrangian methods based on the trajectories of penalty and barrier functions,\u201d Systems Optimization Laboratory Report 78-23, Stanford University (Stanford, CA, 1978)."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1137\/0722050","volume":"22","author":"J. Nocedal","year":"1985","unstructured":"J. Nocedal and M.L. Overton, \u201cProjected Hessian updating algorithms for nonlinearly constrained optimization,\u201dSIAM Journal on Numerical Analysis 22 (1985) 821\u2013850.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR29","volume-title":"Nonlinear Programming, SIAMAMS Proceedings, Vol. IX","author":"M.J.D. Powell","year":"1976","unstructured":"M.J.D. Powell, \u201cSome global convergence properties of a variable metric algorithm for minimization without exact line searches,\u201d in: R.W. Cottle and C.E. Lemke, eds.,Nonlinear Programming, SIAMAMS Proceedings, Vol. IX (Society for Industrial and Applied Mathematics, Philadelphia, 1976.)"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/B978-0-12-468660-1.50007-4","volume-title":"Nonlinear Programming 3","author":"M.J.D. Powell","year":"1978","unstructured":"M.J.D. Powell, \u201cThe convergence of variable metric methods for nonlinearly constrained optimization calculations,\u201d in: O. Mangasarian, R. Meyer and S. Robinson, eds.,Nonlinear Programming 3 (Academic Press, New York and London, 1978) pp. 27\u201363."},{"key":"CR31","volume-title":"Proceedings of the 1986 IMA\/SIAM Meeting on \u201cThe State of the Art in Numerical Analysis\u201d","author":"M.J.D. Powell","year":"1987","unstructured":"M.J.D. Powell, \u201cMethods for nonlinear constraints in optimization calculations\u201d in:Proceedings of the 1986 IMA\/SIAM Meeting on \u201cThe State of the Art in Numerical Analysis\u201d (Clarendon Press, Oxford, 1987)."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01580880","volume":"35","author":"M.J.D. Powell","year":"1986","unstructured":"M.J.D. Powell and Y. Yuan, \u201cA recursive quadratic programming algorithm that uses differentiable exact penalty functions,\u201dMathematical Programming 35 (1986) 265\u2013278.","journal-title":"Mathematical Programming"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00933161","volume":"22","author":"R.A. Tapia","year":"1977","unstructured":"R.A. Tapia, \u201cDiagonalized multiplier methods and quasi-Newton methods for constrained optimization,\u201dJournal on Optimization Theory and Application 22 (1977) 135\u2013194.","journal-title":"Journal on Optimization Theory and Application"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/BF01586092","volume":"32","author":"Y. Yuan","year":"1985","unstructured":"Y. Yuan, \u201cAn only 2-step Q-superlinear convergence example for some algorithms that use reduced Hessian approximations,\u201dMathematical Programming 32 (1985) 224\u2013231.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588794.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588794\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588794","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:27Z","timestamp":1556883387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588794"],"URL":"https:\/\/doi.org\/10.1007\/bf01588794","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}