A penalty decomposition method for rank minimization problem with affine constraints
From MaRDI portal
Publication:2282364
DOI10.1016/j.apm.2015.03.054zbMath1443.93011OpenAlexW2053332507MaRDI QIDQ2282364
Xiaoke Zhao, Zheng-Fen Jin, Yun-hai Xiao, Zhong-Ping Wan
Publication date: 7 January 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2015.03.054
Learning and adaptive systems in artificial intelligence (68T05) Mathematical modeling or simulation for problems pertaining to systems and control theory (93-10)
Related Items
Uses Software
Cites Work
- Fixed point and Bregman iterative methods for matrix rank minimization
- Iterative thresholding for sparse approximations
- Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
- Exact matrix completion via convex optimization
- Block Coordinate Descent Methods for Semidefinite Programming
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Two-Point Step Size Gradient Methods
- Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An alternating direction method for linear‐constrained matrix nuclear norm minimization
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Sparse Approximation via Penalty Decomposition Methods
- Unnamed Item
- Unnamed Item
