A Global Convergence Theory for the Celis–Dennis–Tapia Trust-Region Algorithm for Constrained Optimization
- 1 February 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 28 (1) , 266-290
- https://doi.org/10.1137/0728015
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A heuristic algorithm for nonlinear programmingJournal of Optimization Theory and Applications, 1988
- Local Convergence of Secant Methods for Nonlinear Constrained OptimizationSIAM Journal on Numerical Analysis, 1988
- A Trust Region Algorithm for Nonlinearly Constrained OptimizationSIAM Journal on Numerical Analysis, 1987
- A Convergence Theory for a Class of Quasi-Newton Methods for Constrained OptimizationSIAM Journal on Numerical Analysis, 1987
- A recursive quadratic programming algorithm that uses differentiable exact penalty functionsMathematical Programming, 1986
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence PropertiesSIAM Journal on Numerical Analysis, 1985
- A trust-region approach to linearly constrained optimizationPublished by Springer Nature ,1984
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search functionMathematische Operationsforschung und Statistik. Series Optimization, 1983
- Diagonalized multiplier methods and quasi-Newton methods for constrained optimizationJournal of Optimization Theory and Applications, 1977