Matrix-free algorithm for the large-scale constrained trust-region subproblem

A new ‘matrix-free’ algorithm for the solution of linear inequality constrained, large-scale trust-region subproblems is presented. The matrix-free nature of the algorithm eliminates the need for any matrix factorizations and only requires matrix–vector products. Numerical results that demonstrate the viability of the approach are included. †Contribution of the National Institute of Standards and Technology and not subject to copyright in the United States.

[1]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

[2]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[3]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[4]  Trond Steihaug,et al.  An interior-point trust-region-based method for large-scale non-negative regularization , 2002 .

[5]  Danny C. Sorensen,et al.  A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem , 2000, SIAM J. Optim..

[6]  W. W. Symes,et al.  Velocity inversion: A case study in infinite-dimensional optimization , 1990, Math. Program..

[7]  Danny C. Sorensen,et al.  Algorithm 873: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization , 2008, TOMS.

[8]  Robert V. Kohn,et al.  Surface energy and microstructure in coherent phase transitions , 1994 .

[9]  W. Symes.  A Differential Semblance Criterion for Inversion of Multioffset Seismic Reflection Data , 1993 .

[10]  Nicholas I. M. Gould,et al.  Solving the Trust-Region Subproblem using the Lanczos Method , 1999, SIAM J. Optim..

[11]  Yinyu Ye,et al.  Interior point algorithms: theory and analysis , 1997 .

[12]  R. Kohn,et al.  Branching of twins near an austenite—twinned-martensite interface , 1992 .

[13]  Danny C. Sorensen,et al.  Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint , 1997, SIAM J. Optim..

[14]  M. J. D. Powell,et al.  Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .

[15]  L. N. Vicente,et al.  Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems , 1998 .

[16]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[17]  Franz Rendl,et al.  A semidefinite framework for trust region subproblems with applications to large scale minimization , 1997, Math. Program..

[18]  David M. author-Gay.  Computing Optimal Locally Constrained Steps , 1981 .

[19]  L. Melara,et al.  Simulation of an Austenite-Twinned-Martensite Interface , 2003, Journal of research of the National Institute of Standards and Technology.

[20]  D. Sorensen.  Newton's method with a model trust region modification , 1982 .

[21]  G. Golub,et al.  Quadratically constrained least squares and quadratic problems , 1991 .

[22]  Chao Yang,et al.  ARPACK users' guide - solution of large-scale eigenvalue problems with implicitly restarted Arnoldi methods , 1998, Software, environments, tools.

[23]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[24]  Danny C. Sorensen,et al.  Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..

[25]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .