Enlarging the region of convergence of Newton's method for constrained optimization
- 1 February 1982
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 36 (2) , 221-252
- https://doi.org/10.1007/bf00933831
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A first order, exact penalty function algorithm for equality constrained optimization problemsMathematical Programming, 1979
- A multiplier method with automatic limitation of penalty growthMathematical Programming, 1979
- A New Class of Augmented Lagrangians in Nonlinear ProgrammingSIAM Journal on Control and Optimization, 1979
- Algorithms for nonlinear constraints that use lagrangian functionsMathematical Programming, 1978
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimizationJournal of Optimization Theory and Applications, 1977
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problemsMathematical Programming, 1976
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraintsMathematical Programming, 1975
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974
- A characterization of superlinear convergence and its application to quasi-Newton methodsMathematics of Computation, 1974