An accelerated proximal augmented Lagrangian method and its application in compressive sensing
From MaRDI portal
Publication:2412861
DOI10.1186/s13660-017-1539-0zbMath1373.90108OpenAlexW2766519462WikidataQ46018958 ScholiaQ46018958MaRDI QIDQ2412861
Publication date: 27 October 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1539-0
global convergenceconvex programmingcompressive sensingproximal augmented Lagrangian multiplier method
Related Items (1)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Smooth minimization of non-smooth functions
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
- A class of customized proximal point algorithms for linearly constrained convex optimization
- A new inexact alternating directions method for monotone variational inequalities
- Two proximal splitting methods for multi-block separable programming with applications to stable principal component pursuit
- Parameter selection for nonnegative $l_1$ matrix/tensor sparse decomposition
- A proximal fully parallel splitting method for stable principal component pursuit
- Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
- A fast \(\ell_1\)-solver and its applications to robust face recognition
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- The symmetric ADMM with indefinite proximal regularization and its application
- An accelerated augmented Lagrangian method for linearly constrained convex programming with the rate of convergence \(O\left({1/{k^2}} \right)\)
- Multiplier and gradient methods
- A customized proximal point algorithm for convex minimization with linear constraints
- A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
This page was built for publication: An accelerated proximal augmented Lagrangian method and its application in compressive sensing
