Alternating direction method of multipliers for solving dictionary learning models
DOI10.1007/s40304-015-0050-5zbMath1321.49049OpenAlexW1973732034MaRDI QIDQ2343040
Xinchang Xie, Yusheng Li, Zhou-Wang Yang
Publication date: 4 May 2015
Published in: Communications in Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40304-015-0050-5
image processingmultiplierssignal processingalternating direction methodorthogonal matching pursuitdictionary learningsparse representations
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computing methodologies for image processing (68U10) Numerical methods based on nonlinear programming (49M37) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Inverse problems in optimal control (49N45)
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A comparison of dictionary based approaches to inpainting and denoising with an emphasis to independent component analysis learned dictionaries
- An alternating direction algorithm for matrix completion with nonnegative factors
- Algorithms and software for total variation image reconstruction via first-order methods
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Multi-frame compression: theory and design.
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Stable recovery of sparse overcomplete representations in the presence of noise
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Sparse and Redundant Representations
- Fast Sparse Representation Based on Smoothed ℓ0 Norm
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Orthogonal least squares methods and their application to non-linear system identification
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A generalized uncertainty principle and sparse representation in pairs of bases
- Matching pursuits with time-frequency dictionaries
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
- On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems
- Sparse Approximation via Penalty Decomposition Methods
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- Adaptive greedy approximations
This page was built for publication: Alternating direction method of multipliers for solving dictionary learning models
