Inexact spectral projected gradient methods on convex sets

A new method is introduced for large-scale convex constrained optimization. The general model algorithm involves, at each iteration, the approximate minimization of a convex quadratic on the feasible set of the original problem and global convergence is obtained by means of nonmonotone line searches. A specific algorithm, the Inexact Spectral Projected Gradient method (ISPG), is implemented using inexact projections computed by Dykstra's alternating projection method and generates interior iterates. The ISPG method is a generalization of the Spectral Projected Gradient method (SPG), but can be used when projections are difficult to compute. Numerical results for constrained least-squares rectangular matrix problems are presented.

[1]  A. Goldstein.  Convex programming in Hilbert space , 1964 .

[2]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[3]  M. Fiedler,et al.  Diagonally dominant matrices , 1967 .

[4]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[5]  G. P. Barker,et al.  Cones of diagonally dominant matrices , 1975 .

[6]  Linus Schrage,et al.  A More Portable Fortran Random Number Generator , 1979, TOMS.

[7]  R. Fletcher.  A Nonlinear Programming Problem in Statistics (Educational Testing) , 1981 .

[8]  R. Dykstra.  An Algorithm for Restricted Least Squares Regression , 1983 .

[9]  R. Fletcher.  Semi-Definite Matrix Constraints in Optimization , 1985 .

[10]  L. Grippo,et al.  A nonmonotone line search technique for Newton's method , 1986 .

[11]  R. Dykstra,et al.  A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces , 1986 .

[12]  Shih-Ping Han,et al.  A successive projection method , 1988, Math. Program..

[13]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[14]  I. Olkin,et al.  A numerical procedure for finding the positive definite matrix closest to a patterned matrix , 1991 .

[15]  M. Raydan.  On the Barzilai and Borwein choice of steplength for the gradient method , 1993 .

[16]  Marcos Raydan,et al.  Dykstra's Algorithm for a Constrained Least-squares Matrix Problem , 1996, Numer. Linear Algebra Appl..

[17]  Marcos Raydan,et al.  Dykstra's Algorithm for a Constrained Least-squares Matrix Problem , 1996, Numer. Linear Algebra Appl..

[18]  Marcos Raydan,et al.  The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem , 1997, SIAM J. Optim..

[19]  Marcos Raydan,et al.  Computing the Nearest Diagonally Dominant Matrix , 1998 .

[20]  Marcos Raydan,et al.  Computing the nearest diagonally dominant matrix , 1998, Numer. Linear Algebra Appl..

[21]  M. Raydan,et al.  Dykstra's algorithm for constrained least-squares rectangular matrix problems , 1998 .

[22]  José Mario Martínez,et al.  Nonmonotone Spectral Projected Gradient Methods on Convex Sets , 1999, SIAM J. Optim..

[23]  José Mario Martínez,et al.  Algorithm 813: SPG—Software for Convex-Constrained Optimization , 2001, TOMS.

[24]  Marcos Raydan,et al.  Primal and polar approach for computing the symmetric diagonally dominant projection , 2002, Numer. Linear Algebra Appl..

[25]  José Mario Martínez,et al.  Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients , 2002, Comput. Optim. Appl..

[26]  Yuhong Dai.  On the Nonmonotone Line Search , 2002 .

[27]  L. Liao,et al.  R-linear convergence of the Barzilai and Borwein gradient method , 2002 .

[28]  Roger Fletcher,et al.  On the Barzilai-Borwein Method , 2005 .

[29]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .