Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
From MaRDI portal
Publication:1650690
DOI10.1007/s11425-016-9107-yzbMath1391.90411OpenAlexW2795478447MaRDI QIDQ1650690
Jian Yu, Ding-Tao Peng, Nai-Hua Xiu
Publication date: 5 July 2018
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-9107-y
matrix completion problemglobal optimality condition\(\ell_p\) regularized matrix minimization\(p\)-thresholding operatorfixed point continuation algorithm
Ill-posedness and regularization problems in numerical linear algebra (65F22) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Global solutions of non-Lipschitz \(S_{2}\)-\(S_{p}\) minimization over the positive semidefinite cone
- Fixed point and Bregman iterative methods for matrix rank minimization
- Estimation of high-dimensional low-rank matrices
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- \(\ell _p\) regularized low-rank approximation via iterative reweighted singular value minimization
- Least angle regression. (With discussion)
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Penalty decomposition methods for rank minimization
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- A Singular Value Thresholding Algorithm for Matrix Completion
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Iteratively reweighted least squares minimization for sparse recovery
- <formula formulatype="inline"><tex Notation="TeX">$L_{1/2}$</tex> </formula> Regularization: Convergence of Iterative Half Thresholding Algorithm
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
