Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization

DOI10.1007/s10898-021-01077-0zbMath1490.90283arXiv1911.04293OpenAlexW3198205161MaRDI QIDQ2052408

Shujun Bi, Shaohua Pan, Ting Tao

Publication date: 26 November 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

error boundKL property of exponent 1/2F-norm regularized factorization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
• Log-concavity and strong log-concavity: a review
• Estimation of (near) low-rank matrices with noise and high-dimensional scaling
• CoCoLasso for high-dimensional error-in-variables regression
• Optimal rates of convergence for covariance matrix estimation
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• First-order methods almost always avoid strict saddle points
• Exact matrix completion via convex optimization
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Guaranteed Matrix Completion via Non-Convex Factorization
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Variational Analysis
• Global Optimality in Low-Rank Matrix Optimization
• The Global Optimization Geometry of Low-Rank Matrix Optimization
• Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex 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
• Low-rank matrix completion using alternating minimization