An alternating direction method with continuation for nonconvex low rank minimization
From MaRDI portal
Publication:257130
DOI10.1007/s10915-015-0045-0zbMath1342.65144OpenAlexW317954863MaRDI QIDQ257130
Xiliang Lu, Zheng-Fen Jin, Zhong-Ping Wan, Yu Ling Jiao
Publication date: 15 March 2016
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-015-0045-0
convergencenumerical experimentalternating direction methodleast squares optimization problemlow rank minimizationminimax concave penalty functionrecovering low-rank matrices
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data, A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery, Accelerated matrix completion algorithm using continuation strategy and randomized SVD, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression, Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery, A new nonconvex approach to low-rank matrix completion with application to image inpainting, An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions, A ``nonconvex+nonconvex approach for image restoration with impulse noise removal, Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix, Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- Solving semidefinite-quadratic-linear programs using SDPT3
- An implementable proximal point algorithmic framework for nuclear norm minimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
- Primal and dual alternating direction algorithms for \(\ell _{1}\)-\(\ell _{1}\)-norm minimization problems in compressive sensing
- A reweighted nuclear norm minimization algorithm for low rank matrix recovery
- Alternating direction method for covariance selection models
- Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
- Exact matrix completion via convex optimization
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Alternating direction methods for classical and ptychographic phase retrieval
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Atomic Decomposition by Basis Pursuit
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
- A Primal Dual Active Set Algorithm With Continuation for Compressed Sensing
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- An alternating direction method for linear‐constrained matrix nuclear norm minimization
- Matrix Completion From a Few Entries
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- A new look at the statistical model identification
