Column $\ell_{2,0}$-Norm Regularized Factorization Model of Low-Rank Matrix Recovery and Its Computation

DOI10.1137/20M136205XzbMath1505.65186arXiv2008.10466OpenAlexW3081460781WikidataQ114074160 ScholiaQ114074160MaRDI QIDQ5081098

Shaohua Pan, Ting Tao, Yitian Qian

Publication date: 1 June 2022

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.10466

zbMATH Keywords

factorization modelAMM methodcolumn \(\ell_{2,0}\)-norm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Iterative hard thresholding methods for \(l_0\) regularized convex cone programming
• Fixed point and Bregman iterative methods for matrix rank minimization
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• Max-norm optimization for robust matrix recovery
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
• First-order methods almost always avoid strict saddle points
• Exact matrix completion via convex optimization
• Guaranteed Matrix Completion via Non-Convex Factorization
• Matrix completion via an alternating direction method
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Variational Analysis
• A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems
• Global Optimality in Low-Rank Matrix Optimization
• Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization
• Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably
• The non-convex geometry of low-rank matrix optimization
• Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
• Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
• Sparse Approximation via Penalty Decomposition Methods
• Low-rank matrix completion using alternating minimization
• Unnamed Item
• Unnamed Item