An Accelerated Linearized Alternating Direction Method of Multipliers

DOI10.1137/14095697XzbMath1321.90105arXiv1401.6607MaRDI QIDQ5250009

Guanghui Lan, Eduardo Pasiliao, Yunmei Chen, Yuyuan Ouyang

Publication date: 15 May 2015

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.6607

zbMATH Keywords

convex optimizationalternating direction method of multipliersaccelerated gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items (64)

Stochastic accelerated alternating direction method of multipliers with importance sampling ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm ⋮ Accelerated gradient sliding for structured convex optimization ⋮ Iteration-complexity analysis of a generalized alternating direction method of multipliers ⋮ On lower iteration complexity bounds for the convex concave saddle point problems ⋮ Proportional-integral projected gradient method for conic optimization ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Wasserstein-Based Projections with Applications to Inverse Problems ⋮ Inertial alternating direction method of multipliers for non-convex non-smooth optimization ⋮ LAVIR -- locally adaptive variational image registration ⋮ Accelerated Bregman operator splitting with backtracking ⋮ A multi-step doubly stabilized bundle method for nonsmooth convex optimization ⋮ Distributed communication-sliding mirror-descent algorithm for nonsmooth resource allocation problem ⋮ Fast augmented Lagrangian method in the convex regime with convergence guarantees for the iterates ⋮ Fast bundle-level methods for unconstrained and ball-constrained convex optimization ⋮ A golden ratio proximal alternating direction method of multipliers for separable convex optimization ⋮ A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem ⋮ Partial convolution for total variation deblurring and denoising by new linearized alternating direction method of multipliers with extension step ⋮ A new Lagrangian-based first-order method for nonconvex constrained optimization ⋮ A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems ⋮ \(O(1/t)\) complexity analysis of the generalized alternating direction method of multipliers ⋮ A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming ⋮ A new stopping criterion for Eckstein and Bertsekas's generalized alternating direction method of multipliers ⋮ A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization ⋮ Improved Pointwise Iteration-Complexity of A Regularized ADMM and of a Regularized Non-Euclidean HPE Framework ⋮ Regularized non-local total variation and application in image restoration ⋮ The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates ⋮ Linearized block-wise alternating direction method of multipliers for multiple-block convex programming ⋮ Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems ⋮ Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming ⋮ An adaptive primal-dual framework for nonsmooth convex minimization ⋮ Distributed adaptive dynamic programming for data-driven optimal control ⋮ Convex blind image deconvolution with inverse filtering ⋮ Proximal alternating penalty algorithms for nonsmooth constrained convex optimization ⋮ An exp model with spatially adaptive regularization parameters for multiplicative noise removal ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization ⋮ TGV-based multiplicative noise removal approach: models and algorithms ⋮ Augmented Lagrangian method for total generalized variation based Poissonian image restoration ⋮ An introduction to continuous optimization for imaging ⋮ Dynamic stochastic approximation for multi-stage stochastic optimization ⋮ A primal-dual multiplier method for total variation image restoration ⋮ Analysis of fully preconditioned alternating direction method of multipliers with relaxation in Hilbert spaces ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers ⋮ A nonmonotone gradient algorithm for total variation image denoising problems ⋮ A Majorized ADMM with Indefinite Proximal Terms for Linearly Constrained Convex Composite Optimization ⋮ A FISTA-type accelerated gradient algorithm for solving smooth nonconvex composite optimization problems ⋮ Communication-efficient algorithms for decentralized and stochastic optimization ⋮ Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates ⋮ On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM ⋮ Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming ⋮ An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization ⋮ Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity ⋮ Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis ⋮ Optimal subgradient methods: computational properties for large-scale linear inverse problems ⋮ Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs ⋮ A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ LINEARIZED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR SEPARABLE CONVEX OPTIMIZATION OF REAL FUNCTIONS IN COMPLEX DOMAIN ⋮ Mirror Prox algorithm for multi-term composite minimization and semi-separable problems ⋮ An inexact accelerated stochastic ADMM for separable convex optimization

Uses Software

• NESTA
• RecPF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Smooth minimization of non-smooth functions
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
• Forward-backward and Tseng's type penalty schemes for monotone inclusion problems
• A simple proof of the restricted isometry property for random matrices
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Enlargement of monotone operators with applications to variational inequalities
• Introductory lectures on convex optimization. A basic course.
• An algorithm for total variation minimization and applications
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Bregman operator splitting with variable stepsize for total variation image reconstruction
• Iteration-complexity of first-order penalty methods for convex programming
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
• Multiplier and gradient methods
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Fast Algorithms for Image Reconstruction with Application to Partially Parallel MR Imaging
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• The Split Bregman Method for L1-Regularized Problems
• Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
• Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Smooth Optimization with Approximate Gradient
• Two-Point Step Size Gradient Methods
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• Monotone Operators and the Proximal Point Algorithm
• Optimal Primal-Dual Methods for a Class of Saddle Point Problems
• Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
• Excessive Gap Technique in Nonsmooth Convex Minimization
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Signal Recovery by Proximal Forward-Backward Splitting
• Convex Analysis

This page was built for publication: An Accelerated Linearized Alternating Direction Method of Multipliers