\(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
From MaRDI portal
Publication:1694395
DOI10.1007/s10589-017-9933-6zbMath1388.90096arXiv1401.0869OpenAlexW2744876888MaRDI QIDQ1694395
Yong Zhang, Jian Lu, Zhaosong Lu
Publication date: 1 February 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0869
low-rank approximationiterative reweighted least squaresiterative reweighted singular value minimizationSchatten-\(p\) quasi-norm regularized matrix minimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Eigenvalues, singular values, and eigenvectors (15A18) Matrix completion problems (15A83)
Related Items
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization ⋮ Iterative positive thresholding algorithm for non-negative sparse optimization ⋮ A new nonlocal low-rank regularization method with applications to magnetic resonance image denoising ⋮ A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems ⋮ Smoothing fast proximal gradient algorithm for the relaxation of matrix rank regularization problem ⋮ A global exact penalty for rank-constrained optimization problem and applications ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ Rician noise removal via weighted nuclear norm penalization ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ Nonconvex and nonsmooth sparse optimization via adaptively iterative reweighted methods ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ A smoothing proximal gradient algorithm for matrix rank minimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Fixed point and Bregman iterative methods for matrix rank minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Convergence of the reweighted \(\ell_1\) minimization algorithm for \(\ell_2-\ell_p\) minimization
- A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Nonsmooth analysis of singular values. I: Theory
- Nonsmooth analysis of singular values. II: Applications
- Exact matrix completion via convex optimization
- An affine scaling methodology for best basis selection
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- EXACT LOW-RANK MATRIX RECOVERY VIA NONCONVEX SCHATTEN p-MINIMIZATION
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- Penalty decomposition methods for rank minimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
- Restricted isometry properties and nonconvex compressive sensing
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Iteratively reweighted least squares minimization for sparse recovery
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion
