Inexact alternating direction methods for image recovery

SIAM Journal on Scientific Computing

Volumn 33, Issue 4, 2011, Pages 1643-1668

  Ng, Michael K ^a   Wang, Fan ^a   Yuan, Xiaoming ^a  

^a HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

Author keywords

Alternating direction method; Compression; Convergence; Image reconstruction; Image restoration; Inexact

Indexed keywords

CONVEX OPTIMIZATION; IMAGE COMPRESSION; ITERATIVE METHODS; RESTORATION;

ALTERNATING DIRECTION METHODS; COMPRESSION; CONVERGENCE; IMAGE RECOVERY; IMAGES PROCESSING; IMAGES RECONSTRUCTION; INEXACT; RESTORATION AND RECONSTRUCTION; RESTORATION PROBLEMS; SUB-PROBLEMS;

IMAGE RECONSTRUCTION;

EID: 80052722936     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/100807697     Document Type: Article

References (47)

1. D. P. BERTSEKAS, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, New York, 1982.
2. D. P. BERTSEKAS AND E. M. GAFNI, Projection method for variational inequalities with applications to the traffic assignment problem, Math. Program. Study, 17(1982), pp. 139-159.
3. D. P. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation, Numerical Methods, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989.
4. R. H. CHAN, J. F. YANG, AND X. M. YUAN, Alternating direction method for image inpainting in wavelet domain, SIAM J. Imaging Sci., to appear.
5. T. CHAN, N. NG, A. YAU, AND A. YIP, Superresolution image reconstruction using fast inpainting algorithms, Appl. Comput. Harmon. Anal., 23(2007), pp. 3-24. (Pubitemid 46856881)
6. T. CHAN AND H. ZHOU, Optimal construction of wavelet coefficients using total variation regularization in image compression, CAM Report 00-27, Mathematics Department, UCLA, July 2000.
7. A. CHAMBOLLE AND T. POCK, A first-order primal-dual algorithm for convex problems with applications to imaging, UMR CNRS 7641, R. I. 685, Ecole Polytechnique, Palaiseau, France, May 2010.
8. G. CHEN AND M. TEBOULLE, A proximal-based decomposition method for convex minimization problems, Math. Program., 64(1994), pp. 81-101.
9. P. COMBETTES, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization, 53(2004), pp. 475-504. (Pubitemid 40190083)
10. J. ECKSTEIN AND D. P. BERTSEKAS, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Program., 55(1992), pp. 293-318.
11. J. ECKSTEIN, Some saddle-function splitting methods for convex programming, Optim. Methods Softw., 4(1994), pp. 75-83.
12. J. ECKSTEIN AND M. FUKUSHIMA, Some reformulations and applications of the alternating direction method of multipliers, Large Scale Optimization: State of the Art, Kluwer, Dordrecht, 1993, pp. 119-138.
13. E. ESSER, Applications of Lagrangian-based alternating direction methods and connections to split Bregman, CAM report, UCLA, April 2009.
14. E. ESSER, X. ZHANG, AND T. CHAN, A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science, SIAM J. Imaging Sci., 3(2010), pp. 1015-1046.
15. F. FACCHINEI AND J.-S. PANG, Finite-dimensional variational inequalities and complementarity problems, Springer Series in Operations Research, Springer-Verlag, Berlin, 2003.
16. M. FUKUSHIMA, Application of the alternating directions method of multipliers to separable convex programming problems, Comput. Optim. Appl., 1(1992), pp. 93-111.
17. D. GABAY AND B. MERCIER, A dual algorithm for the solution of nonlinear variational problems via finite-element approximations, Comput. Math. Appl., 2(1976), pp. 17-40.
18. R. GLOWINSKI, Numerical Methods for Nonlinear Variational Problems, Springer-Verlag, New York, 1984.
19. R. GLOWINSKI AND P. LE TALLEC, Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, Society for Industrial Mathematics, Philadelphia, 1989.
20. T. GOLDSTEIN AND S. OSHER, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci., 2(2009), pp. 323-343.
21. B. S. HE AND H. YANG, Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities, Oper. Res. Lett., 23(1998), pp. 151-161. (Pubitemid 128676387)
22. B. S. HE, H. YANG, AND S. L. WANG, Alternating directions method with self-adaptive penalty parameters for monotone variational inequalities, J. Optim. Theory Appl., 106(2000), pp. 337-356.
23. B. S. HE, L. Z. LIAO, D. HAN, AND H. YANG, A new inexact alternating directions method for monotone variational inequalities, Math. Program., 92(2002), pp. 103-118. (Pubitemid 44769742)
24. B. S. HE, M. H. XU, AND X. M. YUAN, Solving large-scale least squares semidefinite programming by alternating direction methods, SIAM J. Matrix Anal. Appl., 32(2011), pp. 136-152.
25. B. S. HE, H YANG, Q. MENG, AND D. R. HAN, Modified Goldstein-Levitin- Polyak projection method for asymmetric strongly monotone variational inequalities, J. Optim. Theory Appl., 112(2002), pp. 129-143. (Pubitemid 39583396)
26. M. R. HESTENES, Multiplier and gradient methods, J. Optim. Theory Appl., 4(1969), pp. 303-320.
27. S. KONTOGIORGIS AND R. R. MEYER, A variable-penalty alternating directions method for convex optimization, Math. Program., 83(1998), pp. 29-53. (Pubitemid 128431379)
28. Z. LIN, M. CHEN, L. WU, AND Y. MA, The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices, Arxiv preprint arXiv:1009.5055, 2010.
29. B. MARTINET, R égularisation d¡īnéquations variationnelles par approximations successives. Rev. Française Informat, Recherche Opérationnelle, 4(1970), pp. 154-158.
30. M. NG, Iterative Methods for Toeplitz Systems, Oxford University Press, London, 2004.
31. M. NG, P. A. WEISS, AND X. M. YUAN, Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods, SIAM J. Sci. Comput., 32(2010), pp. 2710-2736.
32. M. NG, F. WANG, AND X. M. YUAN, Fast minimization methods for solving constrained totalvariation superresolution image reconstruction, Multidimensional Systems and Signal Processing, 22(2011), pp. 259-286.
33. J. NOCEDAL AND S. J. WRIGHT, Numerical Optimization, Springer-Verlag, New York, 1999.
34. M. J. D. POWELL, A method for nonlinear constraints in minimization problems, in Optimization, R. Fletcher, ed., Academic Press, New York, 1969, pp. 283-298.
35. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
36. R. T. ROCKAFELLAR, Augmented Lagrangians and applications of the proximal point algorithm in convex programming, Math. Oper. Res., 1(1976), pp. 97-116.
37. S. SETZER, Operator splittings, Bregman methods and frame shrinkage in image processing, Internat. J. Comput. Vision, 92(2011), pp. 1-16.
38. S. SETZER, G. STEIDL, AND T. TEUBER, Deblurring Poissonian images by split Bregman techniques, J. Visual Commun. Image Represent., 21(2010), pp. 193-199.
39. K. TAJI, M. FUKUSHIMA, AND T. IBARAKI, A globally convergent Newton method for solving strongly monotone variational inequalities, Math. Program., 58(1993), pp. 369-383. (Pubitemid 23682584)
40. M. TAO AND X. M. YUAN, Recovering low-rank and sparse components of matrices from incomplete and noisy observations, SIAM J. Optim., 21(2011), pp. 57-81.
41. P. TSENG, Alternating projection-proximal methods for convex programming and variational inequalities, SIAM J. Optim., 7(1997), pp. 951-965.
42. Y. WANG, J. YANG, W. YIN, AND Y. ZHANG, A new alternating minimization algorithm for total variation image reconstruction, SIAM J. Imaging Sci., 1(2008), pp. 248-272.
43. C. WU, J. ZHANG, AND X. TAI, Augmented Largrangian method for total variation restoration with non-quadratic fidelity, CAAM Report, CAM-09-82, UCLA, 2009.
44. J. F. YANG AND Y. ZHANG, Alternating direction method for L1 problems in compressive sensing, SIAM J. Sci. Comput., 33(2011), pp. 250-278.
45. C. H. YE AND X. M. YUAN, A descent method for structured monotone variational inequalities, Optim. Methods Softw., 22(2007), pp. 329-338.
46. X. M. YUAN, Alternating direction methods for sparse covariance selection, J. Sci. Comput., to appear.
47. X. M. YUAN AND J. YANG, Sparse and low rank sparse matrix decomposition via alternating directions method, Pac. J. Optim., to appear.