Convergence properties of trust region methods for linear and convex constraints
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1) , 305-336
- https://doi.org/10.1007/bf01580867
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the Identification of Active ConstraintsSIAM Journal on Numerical Analysis, 1988
- 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
- On the convergence of projected gradient processes to singular critical pointsJournal of Optimization Theory and Applications, 1987
- Projected gradient methods for linearly constrained problemsMathematical Programming, 1987
- Two-Metric Projection Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1984
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Generalized equations and their solutions, part II: Applications to nonlinear programmingPublished by Springer Nature ,1982
- An algorithm for solving linearly constrained optimization problemsMathematical Programming, 1972
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970