Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
- 1 April 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 28 (2) , 476-495
- https://doi.org/10.1137/0728026
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple BoundsSIAM Journal on Numerical Analysis, 1989
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A trust-region approach to linearly constrained optimizationPublished by Springer Nature ,1984
- The Conjugate Gradient Method and Trust Regions in Large Scale OptimizationSIAM Journal on Numerical Analysis, 1983
- Generalized EquationsPublished by Springer Nature ,1983
- Recent Developments in Algorithms and Software for Trust Region MethodsPublished by Springer Nature ,1983
- Newton’s Method with a Model Trust Region ModificationSIAM Journal on Numerical Analysis, 1982
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Strongly Regular Generalized EquationsMathematics of Operations Research, 1980