Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- 1 May 1995
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 85 (2) , 265-289
- https://doi.org/10.1007/bf02192227
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Local study of newton type algorithms for constrained problemsPublished by Springer Nature ,2006
- Local analysis of Newton-type methods for variational inequalities and nonlinear programmingApplied Mathematics & Optimization, 1994
- Recursive quadratic programming methods based on the augmented lagrangianPublished by Springer Nature ,1987
- Generalized EquationsPublished by Springer Nature ,1983
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimizationPublished by Springer Nature ,1982
- Properties of updating methods for the multipliers in augmented LagrangiansJournal of Optimization Theory and Applications, 1979
- THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONSPublished by Elsevier ,1978
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimizationJournal of Optimization Theory and Applications, 1977
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithmsMathematical Programming, 1974