A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 21 (1) , 1-23
- https://doi.org/10.1137/s1064827595289108
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the VariablesSIAM Journal on Optimization, 1996
- An Interior Trust Region Approach for Nonlinear Minimization Subject to BoundsSIAM Journal on Optimization, 1996
- CUTEACM Transactions on Mathematical Software, 1995
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to boundsMathematical Programming, 1994
- Approximate solution of the trust region problem by minimization over two-dimensional subspacesMathematical Programming, 1988
- Testing a class of methods for solving minimization problems with simple bounds on the variablesMathematics of Computation, 1988
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence PropertiesSIAM Journal on Numerical Analysis, 1985
- Computing a Trust Region StepSIAM Journal on Scientific and Statistical Computing, 1983
- The Conjugate Gradient Method and Trust Regions in Large Scale OptimizationSIAM Journal on Numerical Analysis, 1983