A limited-memory, quasi-Newton preconditioner for nonnegatively constrained image reconstruction.

Image reconstruction gives rise to some challenging large-scale constrained optimization problems. We consider a convex minimization problem with nonnegativity constraints that arises in astronomical imaging. To solve this problem, we use an efficient hybrid gradient projection-reduced Newton (active-set) method. By "reduced Newton," we mean that we take Newton steps only in the inactive variables. Owing to the large size of our problem, we compute approximate reduced Newton steps by using the conjugate gradient (CG) iteration. We introduce a limited-memory, quasi-Newton preconditioner that speeds up CG convergence. A numerical comparison is presented that demonstrates the effectiveness of this preconditioner.

[1]  J. Walkup,et al.  Statistical optics , 1986, IEEE Journal of Quantum Electronics.

[2]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[3]  R. White,et al.  Image recovery from data acquired with a charge-coupled-device camera. , 1993, Journal of the Optical Society of America. A, Optics and image science.

[4]  Jorge Nocedal,et al.  A Limited Memory Algorithm for Bound Constrained Optimization , 1995, SIAM J. Sci. Comput..

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[7]  J. Nagy,et al.  Enforcing nonnegativity in image reconstruction algorithms , 2000, SPIE Optics + Photonics.

[8]  Gerardo Toraldo,et al.  On the Solution of Large Quadratic Programming Problems with Bound Constraints , 1991, SIAM J. Optim..

[9]  Jorge Nocedal,et al.  Automatic Preconditioning by Limited Memory Quasi-Newton Updating , 1999, SIAM J. Optim..

[10]  Carl Tim Kelley,et al.  Iterative methods for optimization , 1999, Frontiers in applied mathematics.

[11]  Gerardo Toraldo,et al.  The effect of diagonal scaling on projected gradient methods for bound constrained quadratic programming problems , 1995 .

[12]  C. Vogel.  Computational Methods for Inverse Problems , 1987 .

[13]  L. Lucy.  An iterative technique for the rectification of observed distributions , 1974 .

[14]  J. Goodman.  Introduction to Fourier optics , 1969 .

[15]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[16]  Jorge Nocedal,et al.  Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization , 1997, TOMS.

[17]  Johnathan M. Bardsley,et al.  A Nonnegatively Constrained Convex Programming Method for Image Reconstruction , 2003, SIAM J. Sci. Comput..

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

[19]  William H. Richardson,et al.  Bayesian-Based Iterative Method of Image Restoration , 1972 .