A NONNEGATIVELY CONSTRAINED TRUST REGION ALGORITHM FOR THE RESTORATION OF IMAGES WITH AN UNKNOWN BLUR

We consider a large-scale optimization problem with nonnegativity constraints that arises in an ap- plication of phase diversity to astronomical imaging. We develop a cost function that incorporates information about the statistics of atmospheric turbulence, and we use Tikhonov regularization to induce stability. We introduce an efcient and easily implementable algorithm that intersperses gradient projection iterations with iterations from a well-known, unconstrained Newton/trust region method. Due to the large size of our problem and to the fact that our cost function is not convex, we approximately solve the trust region subproblem via the Steihaug-Toint truncated CG iteration. Iterations from the trust region algorithm are restricted to the inactive variables. We also present a highly effective preconditioner that dramatically speeds up the convergence of our algorithm. A numerical comparison using real data between our method and another standard large-scale, bound constrained optimization algorithm is presented.

[1]  Chih-Jen Lin,et al.  Newton's Method for Large Bound-Constrained Optimization Problems , 1999, SIAM J. Optim..

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

[3]  Robert A. Gonsalves,et al.  Phase Retrieval And Diversity In Adaptive Optics , 1982 .

[4]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

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

[6]  Johnathan M. Bardsley,et al.  Computational methods for a large-scale inverse problem arising in atmospheric optics , 2002 .

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

[8]  D. O’Leary.  A generalized conjugate gradient algorithm for solving a class of quadratic programming problems , 1977 .

[9]  D. Bertsekas.  Projected Newton methods for optimization problems with simple constraints , 1981, CDC 1981.

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

[11]  B. Welsh,et al.  Imaging Through Turbulence , 1996 .

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

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

[14]  Dianne P. O'Leary,et al.  Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations , 1979, Computing.

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

[16]  Brent L. Ellerbroek,et al.  Space object identification using phase-diverse speckle , 1997, Optics & Photonics.

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

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

[19]  James R. Fienup,et al.  Joint estimation of object and aberrations by using phase diversity , 1992 .

[20]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[21]  Tony F. Chan,et al.  Fast algorithms for phase-diversity-based blind deconvolution , 1998, Astronomical Telescopes and Instrumentation.