Low-rank factorization for rank minimization with nonconvex regularizers
From MaRDI portal
Publication:2044472
DOI10.1007/s10589-021-00276-5zbMath1473.90166arXiv2006.07702MaRDI QIDQ2044472
Publication date: 9 August 2021
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.07702
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares
- Nearly unbiased variable selection under minimax concave penalty
- Point source super-resolution via non-convex \(L_1\) based methods
- Fixed point and Bregman iterative methods for matrix rank minimization
- Low rank matrix completion by alternating steepest descent methods
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A penalty method for rank minimization problems in symmetric matrices
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Two relaxation methods for rank minimization problems
- The variation of the spectrum of a normal matrix
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- A Singular Value Thresholding Algorithm for Matrix Completion
- Derivatives of Eigenvalues and Eigenvectors of Matrix Functions
- A Sequential Semismooth Newton Method for the Nearest Low-rank Correlation Matrix Problem
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-Rank Matrix Completion
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
