Low-rank optimization for semidefinite convex problems

M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , J. Assoc. Comput. Mach. 42

1995

Earlier work this paper cites.

A. S. Lewis, Derivatives of spectral functions , Math. Oper. Res. 21

1996

Earlier work this paper cites.

A. S. Lewis and H. S. Sendov, Twice differentiable spectral functions , SIAM J. Matrix Anal. Appl. 23

2001

Earlier work this paper cites.

S. Burer and R. D. C. Monteiro, A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization , Math. Program. 95

2003

Earlier work this paper cites.

S. Boyd and L. Vandenberghe, Convex optimization , Cambridge University Press, 2004

2004

Earlier work this paper cites.

H. Zou, T. Hastie, and R. Tibshirani, Sparse principal component analysis , Journal of Computational and Graphical Statistics 15

Original

2006

Cited alongside, same era.

P.-A. Absil, C. G. Baker, and K. A. Gallivan, Trust-region methods on Riemannian manifolds , Found. Comput. Math. 7

2007

Cited alongside, same era.

A. d’Aspremont, F. R. Bach, and L. El Ghaoui, Full regularization path for sparse principal component analysis , ICML ’07: Proceedings of the 24th international conference on Machine learning, 2007, pp. 177–184

2007

Cited alongside, same era.

A. d’Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet, A direct formulation for sparse PCA using semidefinite programming , Siam Review 49

2007

Cited alongside, same era.

I. Grubisic and R. Pietersz, Efficient rank reduction of correlation matrices , Linear Algebra Appl. 422

2007

Later among the works it cites.

A. Teschendorff, M. Journée, P.-A. Absil, R. Sepulchre, and C. Caldas, Elucidating the altered transcriptional programs in breast cancer using independent component analysis , PLoS Computational Biology 3

2007

Later among the works it cites.

P.-A. Absil, M. Ishteva, L. De Lathauwer, and S. Van Huffel, A geometric Newton method for Oja’s vector field , Tech. Report UCL-INMA-2008.013, Université catholique de Louvain, Département d’ingénierie mathématique, Av. G. Lemaître 4, 1348 Louvain-la-Neuve, Belgium, April 2008, arXiv:0804.0989

Original

2008

Closest in time.

P.-A. Absil, R. Mahony, and R. Sepulchre, Optimization algorithms on matrix manifolds , Princeton University Press, Princeton, NJ, January 2008

2008

Closest in time.