Gradient-based algorithms with applications to signal-recovery problems

Convex Optimization in Signal Processing and Communications

Volumn 9780521762229, Issue , 2009, Pages 42-88

  Beck, Amir ^a   Teboulle, Marc ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS; IMAGE PROCESSING;

CURSE OF DIMENSIONALITY; GRADIENT BASED ALGORITHM; GRADIENT-BASED METHOD; IMAGE PROCESSING PROBLEMS; OPTIMIZATION ALGORITHMS; SCIENTIFIC APPLICATIONS; SENSOR-LOCATION PROBLEMS; SPARSE APPROXIMATIONS;

OPTIMIZATION;

EID: 84926076587     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511804458.003     Document Type: Chapter

References (58)

1. L. Armijo, “Minimization of functions having continuous partial derivatives, ” Pacific Journal of Mathematics, vol. 16, pp. 1–3, 1966.
2. A. Auslender and M. Teboulle, Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer Monographs in Mathematics. New York: Springer, 2003.
3. A. Auslender and M. Teboulle, “Interior gradient and proximal methods for convex and conic optimization, ” SIAM Journal of Optimization, vol. 16. no. 3, pp. 697–725, 2006.
4. A. Auslender, “Minimisation de fonctions localement Lipschitziennes: applications a la programmation mi-convexe, mi-differentiable, ” in Nonlinear Programming 3, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds. New York: Academic Press, 1978, pp. 429–60.
5. A. Beck, P. Stoica, and J. Li, “Exact and approximate solutions of source localization problems, ” IEEE Transactions on Signal Processing, vol. 56. no. 5, pp. 1770–8, 2008.
6. A. Beck, M. Teboulle, and Z. Chikishev, “Iterative minimization schemes for solving the single source localization problem, ” SIAM Journal on Optimization, vol. 19, no. 3, pp. 1397–1416, 2008.
7. A. Beck and M. Teboulle, “Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems, ” Accepted for publication in IEEE Transactions on Image Processing.
8. A. Beck and M. Teboulle, “Afast iterative shrinkage-thresholding algorithm for linear inverse problems, ” SIAM Journal on Imaging Sciences, vol. 2, no. 1, pp. 183–202, 2009.
9. D. P. Bertsekas, Nonlinear Programming, 2nd ed. Belmont, MA: Athena Scientific, 1999.
10. J. Bioucas-Dias and M. Figueiredo, “Anew Tw IST: two-step iterative shrinkage/thresholding algorithms for image restoration, ” IEEE Transactions on Image Processing, vol. 16, pp. 2992–3004, 2007.
11. E. J. Candès, J. K. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate measurements, ” Communications on Pure & Applied Mathematics, vol. 59, no. 8, pp. 1207–23, 2006.
12. A-L. Cauchy, “Méthode generales pour la résolution des systèmes d’equations simultanées, ” Comptes Rendues de l’Acdémie des Sciences Paris, vol. 25, pp. 536–8, 1847.
13. A. Chambolle, R. A. DeVore, N. Y. Lee, and B. J. Lucier, “Nonlinear wavelet image processing: Variational problems, compression, and noise removal through wavelet shrinkage, ” IEEE Transactions on Image Processing, vol. 7, pp. 319–35, 1998.
14. A. Chambolle and P. L. Lions, “Image recovery via total variation minimization and related problmes, ” Numerische Mathematik, vol. 76, pp. 167–88, 1997.
15. A. Chambolle, “An algorithm for total variation minimization and applications, ” Journal of Mathematical Imaging & Vision, vol. 20, nos. 1–2, pp. 89–97, 2004. Special issue on mathematics and image analysis.
16. A. Chambolle, “Total variation minimization and a class of binary MRF models, ” Lecture Notes in Computer Sciences, vol. 3757, 2005, pp. 136–52.
17. T. F. Chan, G. H. Golub, and P. Mulet, “A nonlinear primal-dual method for total variationbased image restoration, ” SIAM Journal on Scientific Computing, vol. 20, no. 6, pp. 1964–77, 1999.
18. S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit”, SIAM Journal on Scientific Computing, vol. 20, no. 1, pp. 33–61, 1998.
19. K. W. Cheung, W. K. Ma, and H. C. So, “Accurate approximation algorithm for TOAbased maximum likelihood mobile location using semidefinite programming, ” Proceedings of ICASSP, vol. 2, 2004, pp. 145–8.
20. J. Claerbout and F. Muir, “Robust modelling of erratic data, ” Geophysics, vol. 38, pp. 826–44, 1973.
21. P. Combettes and V. Wajs, “Signal recovery by proximal forward-backward splitting, ” Multiscale Modeling and Simulation, vol. 4, pp. 1168–200, 2005.
22. J. W. Daniel, The Approximate Minimization of Functionals. Englewood Cliffs, NJ: Prentice- Hall, 1971.
23. I. Daubechies, M. Defrise, and C. De Mol, “An iterative thresholding algorithm for linear inverse problems with a sparsity constraint, ” Communications on Pure & Applied Mathematics, vol. 57, no. 11, pp. 1413–57, 2004.
24. D. L. Donoho, “Compressed sensing, ” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–306, 2006.
25. M. Elad, B. Matalon, J. Shtok, and M. Zibulevsky, “Awide-angle view at iterated shrinkage algorithms, ” presented at SPIE (Wavelet XII) 2007, San-Diego, CA, August 26–29, 2007.
26. H. W. Engl, M. Hanke, and A. Neubauer, “Regularization of inverse problems, ” in Mathematics and its Applications, vol. 375. Dordrecht: Kluwer Academic Publishers Group, 1996.
27. F. Facchinei and J. S. Pang, Finite-dimensional Variational Inequalities and Complementarity Problems, Vol. II. Springer Series in Operations Research. New York: Springer-Verlag, 2003.
28. M. A. T. Figueiredo, J. Bioucas-Dias, and R. Nowak, “Majorization-minimization algorithms for wavelet-based image restoration, ” IEEE Transactions on Image Processing, vol. 16, no. 12, pp. 2980–91, 2007.
29. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, “Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, ” IEEE Journal on Selected Topics in Signal Processing, to be published.
30. M. A. T. Figueiredo and R. D. Nowak, “An EM algorithm for wavelet-based image restoration, ” IEEE Transactions on Image Processing, vol. 12, no. 8, pp. 906–16, 2003.
31. D. Goldfarb and W. Yin, “Second-order cone programming methods for total variation-based image restoration, ” SIAM Journal on Scientific Computing, pp. 622–45, 2005.
32. A. A. Goldstein, “Cauchy’s method for minimization, ” Numerisch Mathematik, vol. 4, pp. 146–50, 1962.
33. G. H. Golub, P. C. Hansen, and D. P. O’Leary, “Tikhonov regularization and total least squares, ” SIAM Journal on Matrix Analysis &Applications, vol. 21, no. 2, pp. 185–94, 1999.
34. M. Hanke and P. C. Hansen, “Regularization methods for large-scale problems, ” Surveys on Mathematics for Industry, vol. 3, no. 4, pp. 253–315, 1993.
35. P. C. Hansen, “The use of the L-curve in the regularization of discrete ill-posed problems, ” SIAM Journal on Scientific & Statistical Computing, vol. 14, pp. 1487–503, 1993.
36. M. Hintermuller and G. Stadler, “An infeasible primal-dual algorithm for tv-based inf convolution-type image restoration, ” SIAM Journal on Scientific Computing, vol. 28, pp. 1–23, 2006.
37. D. R. Hunter and K. Lange, “A tutorial on MM algorithms, ” The American Statistician, vol. 58, no. 1, pp. 30–7, 2004.
38. S. Bank H. Taylor and J. McCoy, “Deconvolution with the l1-norm, ” Geophysics, vol. 44, pp. 39–52, 1979.
39. S. J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, “A Method for Large-Scale l1- Regularized Least Squares”, IEEE Journal on Selected Topics in Signal Processing, vol. 1, no. 4, pp. 606–17, 2007.
40. H. W. Kuhn, “Anote on Fermat’s problem, ” Mathematical Programming, vol. 4, pp. 98–107, 1973.
41. E. S. Levitin and B. T. Polyak, “Constrained minimization methods, ” USSR Computational Mathematics & Mathematical Physics, vol. 6, pp. 787–823, 1966.
42. J. J. Moreau, “Proximitéet dualité dans un espace hilbertien, ” Bulletin de La Société Mathématique de France, vol. 93, pp. 273–99, 1965.
43. A. S. Nemirovsky and D. B. Yudin, Problem Complexity and Method Efficiency in Optimization. AWiley-Interscience Publication. New York: John Wiley & Sons Inc., 1983. Translated from the Russian and with a preface by E. R. Dawson, Wiley-Interscience Series in Discrete Mathematics.
44. Y. E. Nesterov, “A method for solving the convex programming problem with convergence rate O(1/k2), ” Doklady Akademii Nauk ISSSR, vol. 269, no. 3, pp. 543–7, 1983.
45. Y. E. Nesterov, “Gradient methods for minimizing composite objective function, ” 2007. CORE Report. Available: www.ecore.beDPs/dp1191313936.pdf
46. Y. Nesterov, Introductory Lectures on Convex Optimization. Boston, MA: Kluwer, 2004.
47. J. M. Ortega and W. C. Rheinboldt, “Iterative solution of nonlinear equations in several variables, ” in Classics in Applied Mathematics, vol. 30. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM), 2000. Reprint of the 1970 original.
48. G. B. Passty, “Ergodic convergence to a zero of the sum of monotone operators in Hilbert space, ” Journal of Mathematical Analysis & Applications, vol. 72, no. 2, pp. 383–90, 1979.
49. B. T. Polyak, Introduction to Optimization. Translations Series in Mathematics and Engineering. New York: Optimization Software Inc. Publications Division, 1987. Translated from the Russian, with a foreword by Dimitri P. Bertsekas.
50. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton University Press, 1970.
51. L. I. Rudin, S. J. Osher, and E. Fatemi, “Nonlinear total variation based noise removal algorithms, ” Physica D, vol. 60, pp. 259–68, 1992.
52. J. G. Morris, R. F. Love, and G. O. Wesolowsky, Facilities Location: Models and Methods. New York: North-Holland Publishing Co., 1988.
53. A. H. Sayed, A. Tarighat, and N. Khajehnouri, “Network-based wireless location, ” IEEE Signal Processing Magazine, vol. 22, no. 4, pp. 24–40, 2005.
54. N. Z. Shor, Minimization Methods for Nondifferentiable Functions. New York: Springer- Verlag, 1985.
55. J. O. Smith and J. S. Abel, “Closed-form least-squares source location estimation from rangedifference measurements, ” IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 12, pp. 1661–9, 1987.
56. A. N. Tikhonov and V. Y. Arsenin, Solution of Ill-Posed Problems. Washington, DC: V. H. Winston, 1977.
57. C. R. Vogel and M. E. Oman, “Iterative methods for total variation denoising, ” SIAM Journal of Scientific Computing, vol. 17, pp. 227–38, 1996.
58. E. Weiszfeld, “Sur le point pour lequel la somme des distances de n points donnés est minimum, ” Tohoku Mathematical Journal, vol. 43, pp. 355–86, 1937.