A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 24 (5) , 1133-1151
- https://doi.org/10.1137/0724075
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming ProblemSIAM Journal on Numerical Analysis, 1984
- Nonlinear programming via an exact penalty function: Global analysisMathematical Programming, 1982
- Nonlinear programming via an exact penalty function: Asymptotic analysisMathematical Programming, 1982
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- On the Local Convergence of Quasi-Newton Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1982
- Local convergence of the diagonalized method of multipliersJournal of Optimization Theory and Applications, 1978
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic ProgrammingIMA Journal of Applied Mathematics, 1978
- On the Local and Superlinear Convergence of Quasi-Newton MethodsIMA Journal of Applied Mathematics, 1973
- Toward a Unified Convergence Theory for Newton-Like MethodsPublished by Elsevier ,1971
- A new method for the optimization of a nonlinear function subject to nonlinear constraintsThe Computer Journal, 1970