A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
Abstract
A subspace adaptation of the Coleman--Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version.
Computational performance on various large test problems is reported; advantages of our approach are demonstrated. Our experience indicates that our proposed method represents an efficient way to solve large bound-constrained minimization problems.
[1] , An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), 418–445 97d:90084
[2] , On the convergence of reflective Newton methods for large‐scale nonlinear minimization subject to bounds, Math. Programming, 67 (1994), pp. 189–224. mhp MHPGA4 0025-5610 Math. Program.
[3] , A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables, SIAM J. Optim., 6 (1996), 1040–1058 97h:90060
[4] , Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), 553–572 86b:65063
[5]
[6] , The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), 626–637 84g:49047
[7]
[8]
[9] , Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR, 174 (1967), 747–748 36:4902
[10]
[11]
[12]
[13] , A family of trust‐region‐based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Numer. Anal., 22 (1985), 47–67 86d:65081
[14] , Approximate solution of the trust region problem by minimization over two‐dimensional subspaces, Math. Programming, 40 (1988), 247–263 89c:90081
[15]
[16]
[17]
[18]
[19] , Testing a class of methods for solving minimization problems with simple bounds on the variables, Math. Comp., 50 (1988), 399–430 89e:65061
[20] , CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123–160. att ACMSCU 0098-3500 ACM Trans. Math. Softw.
