Dual descent augmented Lagrangian method and alternating direction method of multipliers

Numerical mathematical programming methods (65K05) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cites Work

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Distributed optimization and statistical learning via the alternating direction method of multipliers
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
Title not available (Why is that?)
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
Convex Analysis
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
Multiplier and gradient methods
Title not available (Why is that?)
The multiplier method of Hestenes and Powell applied to convex programming
A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
Title not available (Why is that?)
On Augmented Lagrangian Methods with General Lower-Level Constraints
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
Accelerated gradient methods for nonconvex nonlinear and stochastic programming
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
The Numerical Solution of Parabolic and Elliptic Differential Equations
On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
On the linear convergence of the alternating direction method of multipliers
A three-operator splitting scheme and its optimization applications
A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
Iteration-complexity of first-order augmented Lagrangian methods for convex programming
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Global convergence of ADMM in nonconvex nonsmooth optimization
A globally convergent algorithm for nonconvex optimization based on block coordinate update
Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
Stochastic first-order methods for convex and nonconvex functional constrained optimization
A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
A two-level distributed algorithm for nonconvex constrained optimization
A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization
Penalty Dual Decomposition Method for Nonsmooth Nonconvex Optimization—Part I: Algorithms and Convergence Analysis
Penalty Dual Decomposition Method for Nonsmooth Nonconvex Optimization—Part II: Applications
Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian

Cited In (1)

A partially feasible Jacobi-type distributed SQO method for two-block general linearly constrained smooth optimization

This page was built for publication: Dual descent augmented Lagrangian method and alternating direction method of multipliers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542544)