An alternating direction method with continuation for nonconvex low rank minimization
From MaRDI portal
Publication:257130
DOI10.1007/S10915-015-0045-0zbMATH Open1342.65144OpenAlexW317954863MaRDI QIDQ257130FDOQ257130
Authors: Zheng-Fen Jin, Xiliang Lu, Zhongping 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
Recommendations
- Fast alternating minimization method with non-monotone search for low-rank and sparse matrix recovery
- A non-monotone alternating directional method for matrix recovery problem
- Matrix completion via an alternating direction method
- A fast proximal iteratively reweighted nuclear norm algorithm for nonconvex low-rank matrix minimization problems
- A nonconvex approach to low-rank matrix completion using convex optimization.
convergencealternating direction methodleast squares optimization problemlow rank minimizationminimax concave penalty functionnumerical experimentrecovering low-rank matrices
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Cites Work
- Nearly unbiased variable selection under minimax concave penalty
- Solving semidefinite-quadratic-linear programs using SDPT3
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- A new look at the statistical model identification
- Analysis of multi-stage convex relaxation for sparse regularization
- Atomic Decomposition by Basis Pursuit
- Title not available (Why is that?)
- Robust principal component analysis?
- A Singular Value Thresholding Algorithm for Matrix Completion
- Exact matrix completion via convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- 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
- Eigentaste: A constant time collaborative filtering algorithm
- 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
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Alternating direction methods for classical and ptychographic phase retrieval
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An implementable proximal point algorithmic framework for nuclear norm minimization
- 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
- Fixed point and Bregman iterative methods for matrix rank minimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- A primal dual active set with continuation algorithm for the \(\ell^0\)-regularized optimization problem
Cited In (26)
- Matrix recovery from nonconvex regularized least absolute deviations
- An extended linearized alternating direction method of multipliers for fused-Lasso penalized linear regression
- Accelerated matrix completion algorithm using continuation strategy and randomized SVD
- A ``nonconvex+nonconvex approach for image restoration with impulse noise removal
- A novel nonconvex relaxation approach to low-rank matrix completion of inexact observed data
- An efficient semi-proximal ADMM algorithm for low-rank and sparse regularized matrix minimization problems with real-world applications
- A singular value \(p\)-shrinkage thresholding algorithm for low rank matrix recovery
- A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems
- The basins of attraction of the global minimizers of non-convex inverse problems with low-dimensional models in infinite dimension
- An alternating direction method of multipliers for MCP-penalized regression with high-dimensional data
- Column \(\ell_{2,0}\)-norm regularized factorization model of low-rank matrix recovery and its computation
- A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis
- Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications
- A novel \(\ell_0\) minimization framework of tensor tubal rank and its multi-dimensional image completion application
- Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Nonconvex mixed matrix minimization
- Fast alternating minimization method with non-monotone search for low-rank and sparse matrix recovery
- A nonconvex approach to low-rank matrix completion using convex optimization.
- Strictly contractive Peaceman-Rachford splitting method to recover the corrupted low rank matrix
- Poisson noise removal based on non-convex hybrid regularizers
- An ADMM with continuation algorithm for non-convex SICA-penalized regression in high dimensions
- 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
- A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm
- A non-monotone alternating directional method for matrix recovery problem
Uses Software
This page was built for publication: An alternating direction method with continuation for nonconvex low rank minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q257130)
