Multiscale methods for polyhedral regularizations

SIAM Journal on Optimization

Volumn 23, Issue 3, 2013, Pages 1424-1456

  Moeller, Michael ^a   Burger, Martin ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Adaptivity; Convex optimization; Inverse scale space; Polyhedral functions; Scale space

Indexed keywords

ADAPTIVITY; AUGMENTED LAGRANGIAN METHODS; CONVEX CONJUGATES; GENERATED FUNCTION; MULTISCALE METHOD; SCALE SPACES; VARIATIONAL METHODS; VARIATIONAL PROBLEMS;

CONVEX OPTIMIZATION; LAGRANGE MULTIPLIERS;

ALGORITHMS;

EID: 84886292306     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110858136     Document Type: Article

References (33)

1. H. H. Bauschke, J. M. Borwein, and P. L. Combettes, Bregman monotone optimization algorithms, SIAM J. Control Optim., 42 (2003), pp. 596-636.
2. H. Bauschke and P. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, Springer, Berlin, 2011.
3. M. Benning, Singular Regularization of Inverse Problems. Ph.D. thesis, WestfälischeWilhelms- Universität Münster, Münster, Germany, 2011.
4. M. Benning and M. Burger, Ground states and singular vectors of convex variational regularization methods, Methods Appl. Anal., to appear.
5. L. Bregman, The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Comput. Math. Math. Phys., 7 (1967), pp. 200-217.
6. A. Briani, A. Chambolle, M. Novaga, and G. Orlandi, On the Gradient Flow of a One- Homogeneous Functional. preprint, arXiv:1109.6765v2, 2011
7. M. Burger, G. Gilboa, S. Osher, and J. Xu, Nonlinear inverse scale space methods, Comm. Math. Sci., 4 (2006), pp. 179-212.
8. M. Burger, M. Moeller, M. Benning, and S. Osher, An adaptive inverse scale space method for compressed sensing, Math. Comp., 82 (2013), pp. 269-299.
9. J. Cai, S. Osher, and Z. Shen, Convergence of the linearized Bregman iteration forℓ1-norm minimization, Math. Comp., 78 (2009), pp. 2127-2136.
10. J. Cai, S. Osher, and Z. Shen, Linearized Bregman iterations for compressed sensing, Math. Comp., 78 (2009), pp. 1515-1536.
11. I. Drori and D. Donoho, Solution of l1 minimization problems by LARS/homotopy methods, in Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing., Vol. 3, IEEE Press, Piscataway, NJ, 2006, p. III.
12. I. Ekeland and R. Témam, Convex Analysis and Variational Problems, Classics Appl. Math. 28, SIAM, Philadelphia, 1999.
13. E. J. Esser, Primal Dual Algorithms for Convex Models and Applications to Image Restoration, Registration and Nonlocal Inpainting. Ph.D. thesis, UCLA, Los Angeles, CA, 2010. Available online at ftp://ftp.math.ucla.edu/pub/ camreport/cam10-31.pdf.
14. E. Esser, Applications of Lagrangian-based Alternating Direction Methods and Connections to Split Bregman, CAM Report 09-31, UCLA, Los Angeles, CA, 2009.
15. M. Figueiredo, R. Nowak, and S. Wright, Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems, IEEE J. Selected Topics in Signal Process., 1 (2007), pp. 586-597.
16. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems, SIAM J. Imaging Sci., 2 (2009), pp. 323-343.
17. E. Hale, W. Yin, and Y. Zhang, A Fixed-Point Continuation Method for l1-regularized Minimization with Applications to Compressed Sensing, CAAM Tech. report TR07-07, Rice University, Houston, TX, 2007.
18. K. Koh, S.-J. Kim, and S. Boyd, An interior-point method for large-scale l1-regularized logistic regression, J. Mach. Learn. Res., 8 (2007), pp. 1519-1555.
19. G. Lan, Z. Lu, and R. Monteiro, Primal-dual first-order methods with o(1/ε) iterationcomplexity for cone programming, Math. Program., 126 (2011), pp. 1-29.
20. D. Malioutov, M. Cetin, and A. Willsky, Homotopy continuation for sparse signal representation, in Proceedings of the IEEE International Conference on Acoustics, Speech, Signal Processing, Vol. 5, IEEE Press, Piscataway, NJ, 2005, pp. v/733- /736.
21. M. Moeller, The adaptive inverse scale space method for hyperspectral unmixing. in Proceedings of the IEEE International Symposium on Geoscience and Remote Sensing, IEEE Press, Piscataway, NJ, 2012, pp. 7492-7495.
22. Yu E. Nesterov and M. J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
23. J. Nocedal and S. Wright, Numerical Optimization, Springer, Berlin, 1999.
24. M. Osborne, B. Presnell, and B. Turlach, A new approach to variable selection in least squares problems, IMA J. Numer. Anal., (2000), pp. 389-403.
25. S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin, An iterative regularization method for total variation-based image restoration, Multiscale Model. Simul., 4 (2005), pp. 460- 489.
26. R. T. Rockafellar, Convex Analysis, Princeton University Press, Princeton, NJ, 1996.
27. M. Schechter, Polyhedral functions and multiparametric linear programming, J. Optim. Theory Appl., 53 (1987), pp. 269-280
28. T. Serafini, G. Zanghirati, and L. Zanni, Gradient projection methods for quadratic programs and applications in training support vector machines, Optim. Methods Software, 20 (2005), pp. 353-378.
29. Z. Wen, W. Yin, D. Goldfarb, and Y. Zhang, A fast algorithm for sparse reconstruction based on shrinkage, subspace optimization, and continuation, SIAM J. Sci. Comput., 32 (2010), pp. 1832-1857.
30. E. Wong, Active-set Methods for Quadratic Programming, Ph.D. thesis, University of California, San Diego, 2011. Available online at http://www.ccom.ucsd.edu/elwong/p/elwthesis. pdf.
31. Y. Yang, M. Moeller, and S. Osher, A dual split Bregman method for fastℓ1 minimization, Math. Comp., to appear.
32. W. Yin, Analysis and generalizations of the linearized Bregman method, SIAM J. Imaging Sci., 3 (2010), pp. 856-877.
33. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, Bregman iterative algorithms for ℓ1- minimization with applications to compressed sensing, SIAM J. Imaging Sci., 1 (2008), pp. 143-168.