Alternating projections and douglas-rachford for sparse affine feasibility

IEEE Transactions on Signal Processing

Volumn 62, Issue 18, 2014, Pages 4868-4881

  Hesse, Robert ^a   Luke, D Russell ^a   Neumann, Patrick ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Compressed sensing; Iterative methods; Linear systems; Optimization; Projection algorithms; Sparse matrices

Indexed keywords

COMPRESSED SENSING; ITERATIVE METHODS; LINEAR SYSTEMS; OPTIMIZATION;

AFFINE CONSTRAINTS; ALTERNATING PROJECTIONS; CONSTRAINT QUALIFICATION; FEASIBILITY PROBLEM; METHOD OF ALTERNATING PROJECTIONS; PROJECTION ALGORITHMS; SPARSE MATRICES; UNDERDETERMINED SYSTEMS;

COMPUTATIONAL COMPLEXITY;

EID: 84906860875     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2014.2339801     Document Type: Article

References (39)

1. H. H. Bauschke, J. Y. B. Cruz, T. T. A. Nghia, H. M. Phan, and X. Wang, "The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle," J. Approx. Theory [Online]. Available: DOI 10.1016/j.jat.2014.06.002
2. H. H. Bauschke and J. M. Borwein, "On the convergence of von Neumanns alternating projection algorithm for two sets," Set-Valued Anal., vol. 1, no. 2, pp. 185-212, 1993.
3. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems," SIAM Rev., vol. 38, no. 3, pp. 367-426, 1996.
4. H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces. New York: Springer, 2011.
5. H. H. Bauschke, P. L. Combettes, and D. R. Luke, "Finding best approximation pairs relative to two closed convex sets in Hilbert spaces," J. Approx. Theory, vol. 127, pp. 178-314, 2004.
6. H. H. Bauschke, P. L. Combettes, and D. R. Luke, "A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space," J. Approx. Theory, vol. 141, no. 1, pp. 63-69, 2006.
7. H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang, "Restricted normal cones and the method of alternating projections: Applications," Set-Valued and Variat. Anal., vol. 21, pp. 475-501, 2013.
8. H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang, "Restricted normal cones and the method of alternating projections: Theory," Set- Valued and Variat. Anal., vol. 21, pp. 431-473, 2013.
9. H. H. Bauschke, D. R. Luke, H. M. Phan, and X. Wang, "Restricted normal cones and sparsity optimizationwith affine constraints," Found. Computat. Math., vol. 14, no. 1, pp. 63-83, 2014.
10. H. H. Bauschke and D. Noll, On the local convergence of the Douglas- Rachford algorithm [Online]. Available: http://arxiv.org/abs/1401. 6188v1, 2014
11. A. Beck andM. Teboulle, "A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems," in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer Optimization and Its Applications, H. H. Bauschke, R. S. Burachik, P. L. Combettes, V. Elser, D. R. Luke, and H.Wolkowicz, Eds. New York, NY, USA: Springer-Verlag, 2011, pp. 33-48.
12. T. Blumensath and M. Davies, "Iterative hard thresholding for compressed sensing," Appl. Comput. Harmon. Anal., vol. 27, no. 3, pp. 265-274, 2009.
13. T. Blumensath and M. Davies, "Normalised iterative hard thresholding; guaranteed stability and performance," IEEE J. Sel. Topics Signal Process., vol. 4, no. 2, pp. 298-309, Apr. 2010.
14. 0 function," in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H. Bauschke, R. Burachik, P. Combettes, V. Elser, D. R. Luke, and H.Wolkowicz, Eds. New York: Springer, 2011, pp. 65-92.
15. E. J. Candés, Y. Eldar, T. Strohmer, and V. Voroninski, "Phase retrieval via matrix completion," SIAM J. Imaging Sci., vol. 6, no. 1, pp. 199-225, 2011.
16. E. J. Candés and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
17. 1 minimization," J. Fourier Anal. Appl., vol. 14, pp. 877-905, 2007.
18. P. L. Combettes and H. J. Trussell, "Method of successive projections for finding a common point of sets inmetric spaces," J. Optimiz. Theory Appl., vol. 67, pp. 487-507, 1990.
19. L. Demanet and X. Zhang, "Eventual linear convergence of the Douglas Rachford iteration for basis pursuit," [Online]. Available: http:// arxiv.org/abs/1301.0542v3
20. D. Gabay, "Applications of the method of multipliers to variational inequalities," in Proc. Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems, 1983, pp. 299-340, North- Holland.
21. R. Hesse and D. R. Luke, "Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems," SIAM J. Optimiz., vol. 23-24, pp. 2397-2419, 2013.
22. J.-B. Hiriart-Urruty, "When only global optimization matters," J. Global Optimiz., vol. 56, no. 3, pp. 761-763, 2013.
23. A. D. Ioffe, "Metric regularity and subdifferential calculus," Russian Math. Surv., vol. 55, no. 3, p. 501, 2000.
24. B. Jin and D. A. Lorenz, "Heuristic parameter-choice rules for convex variational regularization based on error estimates," SIAM J. Numer. Anal., vol. 48, no. 3, pp. 1208-1229, 2010.
25. A. Y. Kruger, "About regularity of collections of sets," Set-Valued Anal., vol. 14, pp. 187-206, 2006.
26. A. Kyrillidis and V. Cevher, "Matrix recipes for hard thresholding methods," J. Math. Imag. Vision, vol. 28, no. 2, pp. 235-265, 2014.
27. q minimization with 0 < q ≤ 1 for sparse solution of underdetermined linear systems," SIAM J. Optimiz., vol. 21, no. 1, pp. 82-101, 2011.
28. H. Le, "Generalized subdifferentials of the rank function," Optimiz. Lett., vol. 7, pp. 1-13, 2012.
29. A. S. Lewis, D. R. Luke, and J. Malick, "Local linear convergence for alternating and averaged nonconvex projections," Found. Computat. Math., vol. 9, no. 4, pp. 485-513, 2009.
30. P. L. Lions and B. Mercier, "Splitting algorithms for the sum of two nonlinear operators," SIAM J. Numer. Anal., vol. 16, no. 6, pp. 964-979, 1979.
31. D. Luke, "Prox-regularity of rank constraint sets and implications for algorithms," J. Math. Imag. Vision, vol. 47, no. 3, pp. 231-238, 2013.
32. D. R. Luke, "Finding best approximation pairs relative to a convex and a prox-regular set in a Hilbert space," SIAM J. Optimiz., vol. 19, no. 2, pp. 714-739, 2008.
33. B. Mordukhovich, "Variational analysis and generalized differentiation, I: Basic theory; II: Applications," in Grundlehren Der Mathematischen Wissenschaften. New York, NY, USA: Springer-Verlag, 2006.
34. H. V. Ngai and M. Théra, "Metric inequality, subdifferential calculus and applications," Set-Valued Anal., vol. 9, pp. 187-216, 2001.
35. H.M. Phan, "Linear convergence of the Douglas-Rachford method for two closed sets" 2014 [Online]. Available: http://arxiv.org/abs/1401. 6509v1
36. G. Pierra, "Eclatement de contraintes en paralléle pour la minimisation d'une forme quadratique," Lecture Notes in Comput. Sci., vol. 41, pp. 200-218, 1976.
37. G. Pierra, "Decomposition through formalization in a product space," Math. Program., vol. 28, pp. 96-115, 1984.
38. R. T. Rockafellar and R. J. Wets, Variational Analysis. Grundlehren DerMathematischenWissenschaften. Berlin: Springer-Verlag, 1998.
39. A. Tillmann and M. E. Pfetsch, "The computational complexity of the restricted isometry property, the nullspace property, and related concepts in compressed sensing," IEEE Trans. Inf. Theory, vol. 60, no. 2, p. 12481259, Feb. 2014.