Inexact accelerated augmented Lagrangian methods
type: Item
instance of: scholarly article
title: Inexact accelerated augmented Lagrangian methods
zbMATH Open document ID: 1353.90145
author: Myeongmin Kang
author: Myungjoo Kang
author: Miyoun Jung
published in: Computational Optimization and Applications
publication date: 2015-10-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6499528
zbMATH Keywords: augmented Lagrangian method
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: inexactness
zbMATH Keywords: acceleration
zbMATH Keywords: compressive sensing
zbMATH Keywords: image inpainting
describes a project that uses: iPiasco
describes a project that uses: RecPF
MaRDI profile type: Publication
full work available at URL: s10589-015-9742-8
OpenAlex ID: W1973706450
cites work: A proximal point method for nonsmooth convex optimization problems in Banach spaces
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Inexact Bregman iteration with an application to Poisson data reconstruction
cites work: Q3690580
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Linearized Bregman iterations for compressed sensing
cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: Nonlocal total variation models for multiplicative noise removal using split Bregman iteration
cites work: On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
cites work: Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
cites work: Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
cites work: Exact Regularization of Convex Programs
cites work: Fast Alternating Direction Optimization Methods
cites work: The Split Bregman Method for L1-Regularized Problems
cites work: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
cites work: A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
cites work: An accelerated inexact proximal point algorithm for convex minimization
cites work: Multiplier and gradient methods
cites work: Q3141900
cites work: Accelerated linearized Bregman method
cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
cites work: Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
cites work: Inexact Alternating Direction Methods for Image Recovery
cites work: iPiasco: inertial proximal algorithm for strongly convex optimization
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Variational Analysis
cites work: Operator splittings, Bregman methods and frame shrinkage in image processing
cites work: Accelerated and inexact forward-backward algorithms
cites work: Sparse Reconstruction by Separable Approximation
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: A dual split Bregman method for fast $\ell ^1$ minimization
cites work: Analysis and Generalizations of the Linearized Bregman Method
cites work: Error forgetting of Bregman iteration
cites work: Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
DOI: 10.1007/S10589-015-9742-8
description: scientific article; zbMATH DE number 6499528