Quartic first-order methods for low-rank minimization
From MaRDI portal
Publication:2031993
DOI10.1007/s10957-021-01820-3zbMath1470.90050arXiv1901.10791OpenAlexW3136201867MaRDI QIDQ2031993
Alexandre d'Aspremont, Jérôme Bolte, Radu-Alexandru Dragomir
Publication date: 15 June 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10791
matrix factorizationEuclidean distance matrix completionlow-rank minimizationBregman first-order methodsBurer-Monteiro
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Related Items
Uses Software
Cites Work
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Introductory lectures on convex optimization. A basic course.
- SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
- Forward-backward splitting with Bregman distances
- Local minima and convergence in low-rank semidefinite programming
- Exact matrix completion via convex optimization
- Julia: A Fresh Approach to Numerical Computing
- Guaranteed Matrix Completion via Non-Convex Factorization
- Phase Retrieval via Wirtinger Flow: Theory and Algorithms
- A Singular Value Thresholding Algorithm for Matrix Completion
- Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- A Nonconvex Splitting Method for Symmetric Nonnegative Matrix Factorization: Convergence Analysis and Optimality
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- Euclidean distance matrix completion problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Low-rank matrix completion using alternating minimization
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
