A penalty decomposition method for rank minimization problem with affine constraints
From MaRDI portal
Publication:2282364
Recommendations
- Penalty decomposition methods for rank minimization
- On linear convergence of projected gradient method for a class of affine rank minimization problems
- Affine matrix rank minimization problem via non-convex fraction function penalty
- A penalty decomposition method for nuclear norm minimization with l₁ norm fidelity term
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
Cites work
- A Singular Value Thresholding Algorithm for Matrix Completion
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An alternating direction method for linear-constrained matrix nuclear norm minimization.
- Block coordinate descent methods for semidefinite programming
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- Interior-point method for nuclear norm approximation with application to system identification
- Iterative thresholding for sparse approximations
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Matrix completion via an alternating direction method
- Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
- Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
- Sparse Approximation via Penalty Decomposition Methods
- Two-Point Step Size Gradient Methods
Cited in
(9)- A penalty method for rank minimization problems in symmetric matrices
- An efficient method for convex constrained rank minimization problems based on DC programming
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix
- A penalty decomposition method for nuclear norm minimization with l₁ norm fidelity term
- \(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
- Equivalence between the affine matrix rank minimization problem and the unconstrained matrix rank minimization problem
- Penalty decomposition methods for rank minimization
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- A novel single-parameter continuously differentiable filled function for global optimization
This page was built for publication: A penalty decomposition method for rank minimization problem with affine constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2282364)
