Fetching the paper…
Reading the bibliography…
We study the minimization of a convex function $f(X)$ over the set of $n\times n$ positive semi-definite matrices, but when the problem is recast as $\min_U g(U) := f(UU^\top)$, with $U \in \mathbb{R}^{n \times r}$ and $r \leq n$.
A trace inequality of John von Neumann
Leon Mirsky · 1975
Earlier work this paper cites.
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · 1984
Earlier work this paper cites.
Perturbation bounds for matrix eigenvalues
Rajendra Bhatia · 1987
Earlier work this paper cites.
A general approach to polynomial-time algorithms design for convex programming
Yurii Nesterov and Arkadi Nemirovski · 1988
Earlier work this paper cites.
Self-concordant functions and polynomial-time methods in convex programming
Yurii Nesterov and Arkadi Nemirovski · 1989
Earlier work this paper cites.
A new algorithm for minimizing convex functions over convex sets
Pravin M Vaidya · 1989
Earlier work this paper cites.
Topics in matrix analysis
Roger A Horn and Charles R Johnson · 1991
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
Farid Alizadeh · 1995
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
Efficient approximation algorithms for semidefinite programs arising from MAX CUT and COLORING
Philip Klein and Hsueh-I Lu · 1996
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
Alan Edelman, Tomás A Arias, and Steven T Smith · 1998
Earlier work this paper cites.
A spectral bundle method for semidefinite programming
Christoph Helmberg and Franz Rendl · 2000
Earlier work this paper cites.
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, and Kazuhide Nakata · 2001
Earlier work this paper cites.
Algorithms for non-negative matrix factorization
Daniel D Lee and H Sebastian Seung · 2001
Earlier work this paper cites.
Matrix rank minimization with applications
M. Fazel · 2002
Earlier work this paper cites.
Semidefinite programming in the space of partial positive semidefinite matrices
Samuel Burer · 2003
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Samuel Burer and Renato DC Monteiro · 2003
Earlier work this paper cites.
First-and second-order methods for semidefinite programming
Renato DC Monteiro · 2003
Earlier work this paper cites.
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, and Kazuo Murota · 2003
Earlier work this paper cites.
Convex optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Introductory lectures on convex optimization
Yurii Nesterov · 2004
Earlier work this paper cites.
Solving large scale semidefinite programs via an iterative solver on the augmented systems
Kim-Chuan Toh · 2004
Earlier work this paper cites.
Fast algorithms for approximate semidefinite programming using the multiplicative weights update method
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2005
Earlier work this paper cites.
Local minima and convergence in low-rank semidefinite programming
Samuel Burer and Renato DC Monteiro · 2005
Earlier work this paper cites.
The learnability of quantum states
Scott Aaronson · 2007
Earlier work this paper cites.
A combinatorial, primal-dual approach to semidefinite programs
Sanjeev Arora and Satyen Kale · 2007
Earlier work this paper cites.
A direct formulation for sparse PCA using semidefinite programming
Alexandre d’Aspremont, Laurent El Ghaoui, Michael I Jordan, and Gert RG Lanckriet · 2007
Earlier work this paper cites.
Smoothing technique and its applications in semidefinite optimization
Yurii Nesterov · 2007
Earlier work this paper cites.
Sparse approximate solutions to semidefinite programs
Elad Hazan · 2008
Cited alongside, same era.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Cited alongside, same era.
Fast global convergence rates of gradient methods for high-dimensional statistical recovery
Alekh Agarwal, Sahand Negahban, and Martin J Wainwright · 2010
Cited alongside, same era.
A singular value thresholding algorithm for matrix completion
J. Cai, E. Candès, and Z. Shen · 2010
Cited alongside, same era.
A general framework for high-dimensional estimation in the presence of incoherence
Yuxin Chen and Sujay Sanghavi · 2010
Cited alongside, same era.
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
Kenneth L Clarkson · 2010
Cited alongside, same era.
Localization from incomplete noisy distance measurements
Adel Javanmard and Andrea Montanari · 2013
Later among the works it cites.
Phase retrieval using alternating minimization
Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi · 2013
Later among the works it cites.
Minimax sparse principal subspace estimation in high dimensions
Vincent Q Vu, Jing Lei, et al · 2013
Later among the works it cites.
Optimization and estimation on manifolds
Nicolas Boumal · 2014
Later among the works it cites.
Theory of convex optimization for machine learning
Sébastien Bubeck · 2014
Later among the works it cites.
Coherent matrix completion
Yudong Chen, Srinadh Bhojanapalli, Sujay Sanghavi, and Rachel Ward · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum state tomography via compressed sensing
David Gross, Yi-Kai Liu, Steven T Flammia, Stephen Becker, and Jens Eisert · 2010
Cited alongside, same era.
Guaranteed rank minimization via singular value projection
Prateek Jain, Raghu Meka, and Inderjit S Dhillon · 2010
Cited alongside, same era.
Low-rank optimization on the cone of positive semidefinite matrices
Michel Journée, Francis Bach, P-A Absil, and Rodolphe Sepulchre · 2010
Cited alongside, same era.
Matrix completion from a few entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Benjamin Recht, Maryam Fazel, and Pablo A Parrilo · 2010
Cited alongside, same era.
Alternating direction augmented Lagrangian methods for semidefinite programming
Zaiwen Wen, Donald Goldfarb, and Wotao Yin · 2010
Cited alongside, same era.
The spectral bundle method with second-order information
Christoph Helmberg, Michael L Overton, and Franz Rendl · 2014
Later among the works it cites.
Matrix recipes for hard thresholding methods
Anastasios Kyrillidis and Volkan Cevher · 2014
Later among the works it cites.
Scalable sparse covariance estimation via self-concordance
Anastasios Kyrillidis, Rabeeh Karimi, Quoc Tran Dinh, and Volkan Cevher · 2014
Later among the works it cites.
Guaranteed matrix completion via non-convex factorization
Ruoyu Sun and Zhi-Quan Luo · 2014
Later among the works it cites.
Large-scale multi-label learning with missing labels
Hsiang-Fu Yu, Prateek Jain, Purushottam Kar, and Inderjit Dhillon · 2014
Later among the works it cites.
Sparse PCA via bipartite matchings
Megasthenis Asteris, Dimitris Papailiopoulos, Anastasios Kyrillidis, and Alexandros G Dimakis · 2015
Closest in time.
Nicolas Boumal · 2015
Closest in time.
Phase retrieval via matrix completion
Emmanuel J Candes, Yonina C Eldar, Thomas Strohmer, and Vladislav Voroninski · 2015
Closest in time.
Phase retrieval via wirtinger flow: Theory and algorithms
Emmanuel J Candes, Xiaodong Li, and Mahdi Soltanolkotabi · 2015
Closest in time.
Yudong Chen and Martin J Wainwright · 2015
Closest in time.
Composite self-concordant minimization
Quoc Tran Dinh, Anastasios Kyrillidis, and Volkan Cevher · 2015
Closest in time.
Computing matrix squareroot via non convex local search
Prateek Jain, Chi Jin, Sham M Kakade, and Praneeth Netrapalli · 2015
Closest in time.
Global convergence of stochastic gradient descent for some non-convex matrix problems
Christopher D Sa, Christopher Re, and Kunle Olukotun · 2015
Closest in time.
Low-rank solutions of linear matrix equations via Procrustes flow
Stephen Tu, Ross Boczar, Mahdi Soltanolkotabi, and Benjamin Recht · 2015
Closest in time.
Greedy rank updates combined with riemannian descent methods for low-rank optimization
Andre Uschmajew and Bart Vandereycken · 2015
Closest in time.
The local convexity of solving systems of quadratic equations
Chris D White, Sujay Sanghavi, and Rachel Ward · 2015
Closest in time.
A universal primal-dual convex optimization framework
A. Yurtsever, Q. Tran-Dinh, and V. Cevher · 2015
Closest in time.
Global convergence of a grassmannian gradient descent algorithm for subspace estimation
Dejiao Zhang and Laura Balzano · 2015
Closest in time.
A nonconvex optimization framework for low rank matrix estimation
Tuo Zhao, Zhaoran Wang, and Han Liu · 2015
Closest in time.
Qinqing Zheng and John Lafferty · 2015
Closest in time.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2016
Closest in time.