A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- 1 April 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 28 (2), 545-572
- https://doi.org/10.1137/0728030
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the Convergence of a Sequential Penalty Function Method for Constrained MinimizationSIAM Journal on Numerical Analysis, 1989
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1988
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- Dual techniques for constrained optimizationJournal of Optimization Theory and Applications, 1987
- Recursive quadratic programming methods based on the augmented lagrangianPublished by Springer Science and Business Media LLC ,1987
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problemsMathematical Programming, 1985
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problemMathematical Programming, 1985
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Partitioned variable metric updates for large structured optimization problemsNumerische Mathematik, 1982
- Multiplier and gradient methodsJournal of Optimization Theory and Applications, 1969