Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- 1 April 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 25 (2) , 433-460
- https://doi.org/10.1137/0725029
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and ImplementationSIAM Journal on Numerical Analysis, 1985
- On the global convergence of trust region algorithms for unconstrained minimizationMathematical Programming, 1984
- A trust-region approach to linearly constrained optimizationPublished by Springer Nature ,1984
- Numerical experiments with partially separable optimization problemsPublished by Springer Nature ,1984
- Recent Developments in Algorithms and Software for Trust Region MethodsPublished by Springer Nature ,1983
- Partitioned variable metric updates for large structured optimization problemsNumerische Mathematik, 1982
- Computing Optimal Locally Constrained StepsSIAM Journal on Scientific and Statistical Computing, 1981
- An algorithm for minimizing a differentiable function subject to box constraints and errorsJournal of Optimization Theory and Applications, 1979