Minimizing a Quadratic Over a Sphere

A new method, the sequential subspace method (SSM), is developed for the problem of minimizing a quadratic over a sphere. In our scheme, the quadratic is minimized over a subspace which is adjusted in successive iterations to ensure convergence to an optimum. When a sequential quadratic programming iterate is included in the subspace, convergence is locally quadratic. Numerical comparisons with other recent methods are given.

[1]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .

[2]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[3]  W. Gander.  Least squares with a quadratic constraint , 1980 .

[4]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

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

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

[7]  Gene H. Golub,et al.  Matrix computations , 1983 .

[8]  W. Menke.  Geophysical data analysis : discrete inverse theory , 1984 .

[9]  M. R. Celis.  A TRUST REGION STRATEGY FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION (NONLINEAR PROGRAMMING, SEQUENTIAL QUADRATIC) , 1985 .

[10]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[11]  P. Hansen.  Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion , 1987 .

[12]  W. Hager.  Applied Numerical Linear Algebra , 1987 .

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

[14]  M. El-Alem.  A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization , 1991 .

[15]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

[16]  Gerard L. G. Sleijpen,et al.  A Jacobi-Davidson Iteration Method for Linear Eigenvalue Problems , 1996, SIAM J. Matrix Anal. Appl..

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

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

[19]  D. Sorensen,et al.  A Truncated RQ Iteration for Large Scale Eigenvalue Calculations , 1998 .

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

[21]  D. Sorensen,et al.  A large-scale trust-region approach to the regularization of discrete ill-posed problems , 1999 .

[22]  William W. Hager,et al.  Graph Partitioning and Continuous Quadratic Programming , 1999, SIAM J. Discret. Math..

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

[24]  William W. Hager,et al.  Iterative Methods for Nearly Singular Linear Systems , 2000, SIAM J. Sci. Comput..