Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
DOI10.1007/S11075-018-0630-ZOpenAlexW2900646979WikidataQ128959730 ScholiaQ128959730MaRDI QIDQ2322836
Jianxi Zhao, Qian Feng, Li-Na Zhao
Publication date: 5 September 2019
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-018-0630-z
Taylor expansionrobust principal component analysislow-rank matrix completionalternating direction minimization
Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Iterative numerical methods for linear systems (65F10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical linear algebra (65Fxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
- Fixed point and Bregman iterative methods for matrix rank minimization
- Exact matrix completion via convex optimization
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Rank-Sparsity Incoherence for Matrix Decomposition
- Matrix completion via an alternating direction method
- Decoding by Linear Programming
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An alternating direction method for linear‐constrained matrix nuclear norm minimization
- Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
This page was built for publication: Alternating direction and Taylor expansion minimization algorithms for unconstrained nuclear norm optimization
