A new trust region algorithm for bound constrained minimization
- 1 November 1994
- journal article
- research article
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 30 (3) , 235-266
- https://doi.org/10.1007/bf01183013
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Practical methods of optimization (2nd edn), by R. Fletcher. Pp. 436. £34.95. 2000. ISBN 0 471 49463 1 (Wiley).The Mathematical Gazette, 2001
- On the Resolution of Linearly Constrained Convex Minimization ProblemsSIAM Journal on Optimization, 1994
- On the Maximization of a Concave Quadratic Function with Box ConstraintsSIAM Journal on Optimization, 1994
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple BoundsSIAM Journal on Numerical Analysis, 1991
- On the Solution of Large Quadratic Programming Problems with Bound ConstraintsSIAM Journal on Optimization, 1991
- Algorithms for bound constrained quadratic programming problemsNumerische Mathematik, 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
- Numerical Methods for Unconstrained Optimization and Nonlinear Equations.Journal of the American Statistical Association, 1985
- Newton’s Method with a Model Trust Region ModificationSIAM Journal on Numerical Analysis, 1982