Douglas-rachford feasibility methods for matrix completion problems

ANZIAM Journal

Volumn 55, Issue 4, 2014, Pages 299-326

  Artacho, Francisco J Aragón ^a,b   Borwein, Jonathan M ^b   Tam, Matthew K ^b  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

feasibility problems; Hadamard matrices; matrix completion; Phrases Douglas Rachford projections; protein reconstruction; reflections

Indexed keywords

EID: 84911888099     PISSN: 14461811     EISSN: 14468735     Source Type: Journal    
DOI: 10.1017/S1446181114000145     Document Type: Article

References (44)

1. G. Ammar, P. Benner and V. Mehrmann, "A multishift algorithm for the numerical solution of algebraic Riccati equations", Electron. Trans. Numer. Anal. 1 (1993) 33-48.
2. F. J. Aragón Artacho and J. M. Borwein, "Global convergence of a non-convex Douglas-Rachford iteration", J. Global Optim. 57 (2013) 753-769; doi:10.1007/s10898-012-9958-4.
3. F. J. Aragón Artacho, J. M. Borwein and M. K. Tam, "Recent results on Douglas-Rachford method for combinatorial optimization problems", J. Optim. Theory Appl. (2013); doi:10.1007/s10957-013-0488-0.
4. M. Bəćak, M. I. Searston and I. B. Sims, "Alternating projections in CAT(0) spaces", J. Math. Anal. Appl. 385 (2012) 599-607.
5. H. H. Bauschke and J. M. Borwein, "On the convergence of von Neumann's alternating projection algorithm for two sets", Set-Valued Anal. 1 (1993) 185-212; doi:10.1007/BF01027691.
6. H. H. Bauschke and J. M. Borwein, "Dykstra's alternating projection algorithm for two sets", J. Approx. Theory 79 (1994) 418-443; doi:10.1006/jath.1994.1136.
7. H. H. Bauschke and J. M. Borwein, "On projection algorithms for solving convex feasibility problems", SIAM Rev. 38 (1996) 367-426; doi:10.1137/S0036144593251710.
8. H. H. Bauschke, J. M. Borwein and A. Lewis, "The method of cyclic projections for closed convex sets in Hilbert space", Contemp. Math. 204 (1997) 1-38; doi:10.1090/conm/204/02620.
9. H. H. Bauschke, P. L. Combettes and D. R. Luke, "Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization", J. Opt. Soc. Amer. A 19 (2002) 1334-1345; doi:10.1364/JOSAA.19.001334.
10. H. H. Bauschke, P. L. Combettes and D. R. Luke, "Hybrid projection-reflection method for phased retrieval", J. Opt. Soc. Amer. A 20 (2003) 1025-1034; doi:10.1364/JOSAA.20.001025.
11. H. H. Bauschke, P. L. Combettes and D. R. Luke, "Finding best approximation pairs relative to two closed convex sets in Hilbert space", J. Approx. Theory 127 (2004) 178-192; doi:10.1016/j.jat.2004.02.006.
12. E. G. Birgin and M. Raydan, "Robust stopping criteria for Dykstra's algorithm", SIAM J. Sci. Comput. 26 (2005) 1405-1414; doi:10.1137/03060062X.
13. J. M. Borwein and A. S. Lewis, Convex analysis and nonlinear optimization (Springer, New York, 2006).
14. J. M. Borwein and D. R. Luke, "Entropic regularization of the 0 function", in: Fixed-point algorithms for inverse problems in science and engineering (Springer, New York, 2011), 65-92.
15. J. M. Borwein and B. Sims, "The Douglas-Rachford algorithm in the absence of convexity", in: Fixed-point algorithms for inverse problems in science and engineering (Springer, New York, 2011), 93-109.
16. J. M. Borwein and M. K. Tam, "A cyclic Douglas-Rachford iteration scheme", J. Optim. Theory Appl. 160 (2014) 1-29; doi:10.1007/s10957-013-0381-x.
17. J. Boyle and R. Dykstra, "A method for finding projections onto the intersection of convex sets in Hilbert spaces", Lecture Notes in Statist. 37 (1986) 28-47; doi:10.1007/978-1-4613-9940-73.
18. J. F. Cai, E. J. Candés and Z. Shen, "A singular value thresholding algorithm for matrix completion", SIAM J. Optim. 20 (2010) 717-772; doi:10.1137/080738970.
19. E. J. Candés and B. Recht, "Exact matrix completion via convex optimization", Found. Comput. Math. 9 (2009) 717-772; doi:10.1007/s10208-009-9045-5.
20. Y. Chen and X. Ye, "Projection onto a simplex", arXiv:1101.6081v2, 2011.
21. J. Dattorro, Convex optimization and Euclidean distance geometry (Meboo Publishing, California, 2013).
22. P. Drineas, A. Javed, M. Magdon-Ismail, G. Pandurangant, R. Virrankoski and A. Savvides, "Distance matrix reconstruction from incomplete distance information for sensor network localization", Proc. IEEE Int. Conf. Sensor, Mesh and Ad Hoc Communications and Networks (SECON'06), 2006, 536-544; doi:10.1109/SAHCN.2006.288510.
23. R. Escalante and M. Raydan, Alternating Projection Methods (SIAM, Philadelphia, 2011); doi:10.1137/19781611971941.
24. L. Fabry-Asztalos, I. Lorentz and R. Andonie, "Molecular distance geometry optimization using geometric build-up and evolutionary techniques on GPU", Comput. Intell. Bioinform. Comput. Biol. (2012) 321-328; doi:10.1109/CIBCB.2012.6217247.
25. N. Gake and R. Mathar, "A cyclic projection algorithm via duality", Metrika 36 (1989) 29-54; doi:10.1007/BF02614077.
26. M. R. Gholami, L. Tetruashvili, E. G. Strm and Y. Censor, "Cooperative wireless sensor network positioning via implicit convex feasibility", IEEE Trans. Signal Process. 61 (2013) 5830-5840; doi:10.1109/TSP.2013.2279770.
27. W. Glunt, T. L. Hayden, S. Hong and J. Wells, "An alternating projection algorithm for computing the nearest Euclidean distance matrix", SIAM J. Matrix Anal. Appl. 11 (1990) 589-600; doi:10.1137/0611042.
28. T. L. Hayden and J. Wells, "Approximation by matrices positive semidefinite on a subspace", Linear Algebra Appl. 109 (1988) 115-130; doi:10.1016/0024-3795(88)90202-9.
29. R. Hesse and D. R. Luke, "Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems", SIAM J. Optim. 23 (2013) 2397-2419; doi:10.1137/120902653.
30. N. J. Higham, "Computing the polar decomposition-with applications", SIAM J. Sci. Stat. Comput. 7 (1986) 1160-1174; doi:10.1137/0907079.
31. A. Hjørungnes, Complex-Valued Matrix Derivatives: with Applications in Signal Processing and Communications (Cambridge University Press, New York, 2011); doi:10.1017/CBO9780511921490.
32. K. J. Horadam, Hadamard Matrices and their Applications (Princeton University Press, New Jersey, 2007).
33. R. A. Horn and C. R. Johnson, Matrix Analysis (Cambridge University Press, New York, 1985); doi:101017/CBO9780511810817.
34. C. R. Johnson, "Matrix completion problems: a survey", Proc. Sympos. Appl. Math. 40 (1990) 171-198; doi:10.1090/psapm/040/1059486.
35. N. Kirslock and H. Wolkowicz, "Explicit sensor network localization using semidefinite representations and facial reductions", SIAM J. Optim. 20 (2010) 2679-2708.
36. C. Koukouvinos and S. Stylianou, "On skew-Hadamard matrices", Discrete Math. 309 (2008) 2723-2731; doi:10.1016/j.disc.2006.06.037.
37. M. Laurent, "Matrix completion problems", Encyclopedia Optim. 271 (2001) 221-229; doi:10.1007/0-306-48332-7271.
38. K. H. Leung and B. Schmidt, "New restrictions on possible order of circulant Hadamard matrices", Des. Codes Cryptogr. 64 (2012) 143-151; doi:10.1007/s10623-011-9493-1.
39. B. D. McKay, "Hadamard equivalence via graph isomorphism", Discrete Math. 27 (1979) 213-214; doi:10.1016/0012-365X(79)90113-4.
40. J. Piantadosi, P. Howlett and J. M. Borwein, "Modelling and simulation of seasonal rainfall using the principle of maximum entropy", Entropy 16 (2014) 747-769; doi:10.3390/e16020747.
41. I. J. Schoenberg, "Remarks to Maurice Fréchet's article 'Sur la définition axiomatique d'une classe d'espace distanciés vectoriellement applicable sur l'espace de Hilbert'", Ann. of Math. (2) 36 (1935) 724-732.
42. P. H. Schönemann, "A generalized solution to the orthogonal Procrustes problem", Psychometrika 31 (1966) 1-10; doi:10.1007/BF02289451.
43. P. L. Takouda, "Un probléme d'approximation matricielle: quelle est la matrice bistochastique la plus proche d'une matrice donnée?", RAIRO Oper. Res. 39 (2005) 35-54.
44. A. K. Yuen, O. Lafon, O. T. Charpentier, M. Roy, F. Brunet, P. Berthault, D. Sakellariou, B. Robert, S. Rimsky, F. Pillon, J. C. Cintrat and B. Rousseau, "Measurement of long-range interatomic distances by solid-state tritium-NMR spectroscopy", J. Amer. Chem. Soc. 132 (2010) 1734-1735; doi:10.1021/ja908915v.