Matrix nearness problems with bregman divergences

SIAM Journal on Matrix Analysis and Applications

Volumn 29, Issue 4, 2007, Pages 1120-1146

  Dhillon, Inderjit S ^a   Tropp, Joel A ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Alternating projections; Bregman divergences; Matrix nearness problems; Relative entropy; Squared euclidean distance

Indexed keywords

ALTERNATING PROJECTIONS; BREGMAN DIVERGENCES; MATRIX NEARNESS PROBLEMS; RELATIVE ENTROPY; SQUARED EUCLIDEAN DISTANCE;

APPROXIMATION THEORY; POLYNOMIAL APPROXIMATION; RISK ASSESSMENT;

PROBABILITY DISTRIBUTIONS;

EID: 38349053625     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/060649021     Document Type: Article

References (38)

1. A. BANERJEE, I. S. DHILLON, J. GHOSH, S. MERUGU, AND D. S. MODHA, A generalized maximum entropy approach to Bregman co-clustering and matrix approximation, J. Mach. Learn. Res., 8 (2007), pp. 1919-1986. Available online at http://jmlr.csail.mit.edu/ papers/volume8/banerjee07a/banerjee07a.pdf.
2. A. BANERJEE, S. MERUGU, I. DHILLON, AND J. GHOSH, Clustering with Bregman divergences, J. Mach. Learn. Res., 6 (2005), pp. 1705-1749.
3. O. BARNDORFF-NIELSEN, Information and Exponential Families in Statistical Theory, John Wiley, New York, 1978.
4. H. H. BAUSCHKE AND J. M. BORWEIN, Legendre functions and the method of random Bregman projections, J. Convex Anal., 4 (1997), pp. 27-67.
5. H. H. BAUSCHKE AND P. L. COMBETTES, Iterating Bregman retractions, SIAM J. Optim., 13 (2003), pp. 1159-1173.
6. H. H. BAUSCHKE AND A. S. LEWIS, Dykstra's algorithm with Bregman projections: A convergence proof, Optimization, 48 (2000), pp. 409-427.
7. S. BOYD AND L. XIAO, Least-squares covariance matrix adjustment, SIAM J. Matrix Anal. Appl., 27 (2005), pp. 532-546.
8. L. M. BREGMAN, The relaxation method of 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.
9. L. M. BREGMAN, Y. CENSOR, AND S. REICH, Dykstra's algorithm as the nonlinear extension of Bregman's optimization method, J. Convex Anal., 6 (1999), pp. 319-333.
10. Y. CENSOR AND S. A. ZENIOS, Parallel Optimization: Theory, Algorithms, and Applications, Numer. Math. Sci. Comput., Oxford University Press, Oxford, UK, 1997.
11. T. COVER AND J. THOMAS, Elements of Information Theory, John Wiley, New York, 1991.
12. I. CSISZÁR, I-divergence geometry of probability distributions and minimization problems, Ann. Probab., 3 (1975), pp. 146-158.
13. W. E. DEMING AND F. F. STEPHAN, On a least squares adjustment of a sampled frequency table when the expected marginal totals are known, Ann. Math. Statist., 11 (1943), pp. 427-444.
14. F. DEUTSCH, Best Approximation in Inner Product Spaces, Springer-Verlag, New York, 2001.
15. I. S. DHILLON, S. SRA, AND J. A. TROPP, Triangle fixing algorithms for the metric nearness problem, in Proceedings of the Eighteenth Annual Conference on Neural Information Processing Systems (NIPS), MIT Press, Cambridge, MA, 2005, pp. 361-368.
16. R. L. DYKSTRA, An algorithm for restricted least squares regression, J. Amer. Statist. Assoc., 78 (1983), pp. 837-842.
17. I. GRUBIŠIĆ AND R. PIETERSZ, Efficient rank reduction of correlation matrices, Linear Algebra Appl., 422 (2007), pp. 629-653.
18. S.-P. HAN, A successive projection method, Math. Programming, 40 (1988), pp. 1-14.
19. N. J. HIGHAM, Computing the nearest correlation matrix - a problem from finance, IMA J. Numer. Anal., 22 (2002), pp. 329-343.
20. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Fundamentals of Convex Analysis, Springer, Berlin, 2001.
21. R. A. HORN AND C. R. JOHNSON, Matrix Analysis, Cambridge University Press, Cambridge, UK, 1985.
22. C. T. IRELAND AND S. KULLBACK, Contingency tables with given marginals, Biometrika, 55 (1968), pp. 179-188.
23. E. T. JAYNES, Information theory and statistical mechanics, Phys. Rev., 106 (1957), pp. 620-630.
24. R. KRUITHOF, Telefoonverkeersrekening, De Ingenieur, 52 (1937), pp. E15-E25.
25. B. KULIS, M. SUSTIK, AND I. S. DHILLON, Learning low-rank kernel matrices, in Proceedings of the Twenty-Third International Conference on Machine Learning (ICML), Morgan Kaufmann, San Francisco, 2006, pp. 505-512.
26. A. S. LEWIS, The convex analysis of unitarily invariant matrix functions, J. Convex Anal., 2 (1995), pp. 173-183.
27. A. S. LEWIS, Convex analysis on the Hermitian matrices, SIAM J. Optim., 6 (1996), pp. 164-177.
28. J. MALICK, A dual approach to semidefinite least-squares problems, SIAM J. Matrix Anal. Appl., 26 (2004), pp. 272-284.
29. K. V. MARDIA, J. T. KENT, AND J. M. BIBBY, Multivariate Analysis, Academic Press, London, 1979.
30. M. V. MENON, Reduction of a matrix with positive elements to a doubly stochastic matrix, Proc. Amer. Math. Soc., (1967), pp. 244-247.
31. M. A. NIELSEN AND I. L. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
32. J. NOCEDAL AND S. J. WRIGHT, Numerical Optimization, 2nd ed., Springer, New York, 2006.
33. B. N. PARLETT AND T. L. LANDIS, Methods for scaling to doubly stochastic form, Linear Algebra Appl., 48 (1982), pp. 53-79.
34. H. QI AND D. SUN, A quadratically convergent Newton method for computing the nearest correlation matrix, SIAM J. Matrix Anal. Appl., 28 (2006), pp. 360-385.
35. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
36. R. SINKHORN, A relationship between arbitrary positive matrices and doubly stochastic matrices, Ann. Math. Statist, 35 (1964), pp. 876-879.
37. P. TSENG, Dual coordinate ascent methods for non-strictly convex minimization, Math. Programming, 59 (1993), pp. 231-247.
38. V. N. VAPNIK, Statistical Learning Theory, John Wiley, New York, 1998.