Subspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems

SIAM Journal of Scientific Computing

Volumn 21, Issue 1, 1999, Pages 1-23

  Branch, Mary Ann ^a   Coleman, Thomas F ^b   Li, Yuying ^b  

^a MATHWORKS INC   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; BOUNDARY VALUE PROBLEMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; MATRIX ALGEBRA; PROBLEM SOLVING;

BOUND CONSTRAINED MINIMIZATION PROBLEMS; CONJUGATE GRADIENT METHOD; INTERIOR METHOD; NEGATIVE CURVATURE DIRECTION; SUBSPACE TRUST REGION METHOD;

ITERATIVE METHODS;

EID: 0033296256     PISSN: 10648275     EISSN: None     Source Type: None    
DOI: 10.1137/S1064827595289108     Document Type: Article

References (20)

1. T. F. COLEMAN AND Y. LI, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), pp. 418-445.
2. T. F. COLEMAN AND Y. LI, On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds, Math. Programming, 67 (1994), pp. 189-224.
3. T. F. COLEMAN AND Y. LI, A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables, SIAM J. Optim., 6 (1996), pp. 1040-1058.
4. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
5. D. C. SORENSEN, Minimization of a Large scale Quadratic Function Subject to an Ellipsoidal Constraint, Technical report TR94-27, Department of Computational and Applied Mathematics, Rice University, Houston, TX, 1994.
6. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
7. M. A. BRANCH, Inexact Reflective Newton Methods for Large-Scale Optimization Subject to Bound Constraints, Ph.D. thesis, Department of Computer Science, Cornell University, Ithaca, NY, 1996.
8. M. A. BRANCH, T. F. COLEMAN, AND Y. LI, A Computational Study of Two Approximations to the Trust-Region Subproblem, Technical report, Cornell University, Ithaca, NY, 1998, in progress.
9. I. I. DIKIN, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR, 174 (1967), pp. 747-748.
10. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT. LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer-Verlag, Berlin, New York, 1992.
11. B. A. HENDRICKSON, The Molecule Problem: Determining Conformation from Pairwise Distances, Ph.D. thesis, Cornell University, Ithaca, NY, 1991.
12. T. F. COLEMAN, Large-scale numerical optimization: Introduction and overview, in Encyclopedia of Computer Science and Technology, A. Kent and J. G. Williams, eds., Marcel Dekker, New York, 1993, pp. 167-195.
13. G. A. SHULTZ, R. B. SCHNABEL, AND R. H. BYRD, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Numer. Anal., 22 (1985), pp. 47-67.
14. R. H. BYRD, R. B. SCHNABEL, AND G. A. SHULTZ, Approximate solution of the trust region problem by minimization over two-dimensional subspaces, Math. Programming, 40 (1988), pp. 247-263.
15. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1989.
16. J. K. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large symmetric eigenvalue computations. Vol. 1: Theory, Birkhaüser, Boston-Basel-Stuttgart, 1985.
17. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, New York, 1981.
18. MATLAB 4.2c for Unix, The MathWorks, Natick, MA.
19. A. R. CONN, N. I. M. GOULD, AND P. L. TOINT, Testing a class of methods for solving minimization problems with simple bounds on the variables, Math. Comput., 50 (1988), pp. 399-430.
20. I. BONGARTZ, A. R. CONN, N. GOULD, AND P. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.