Dual descent augmented Lagrangian method and alternating direction method of multipliers
From MaRDI portal
Recommendations
- An alternating augmented Lagrangian method for constrained nonconvex optimization
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A First-Order Primal-Dual Method for Nonconvex Constrained Optimization Based on the Augmented Lagrangian
- A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- A proximal alternating direction method of multiplier for linearly constrained nonconvex minimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- A three-operator splitting scheme and its optimization applications
- A two-level distributed algorithm for nonconvex constrained optimization
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
- Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- Convex Analysis
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- Iteration Complexity of a Proximal Augmented Lagrangian Method for Solving Nonconvex Composite Optimization Problems with Nonlinear Convex Constraints
- Iteration Complexity of an Inner Accelerated Inexact Proximal Augmented Lagrangian Method Based on the Classical Lagrangian Function
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Multiplier and gradient methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- On the linear convergence of the alternating direction method of multipliers
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- 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
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- Sequential quadratic optimization for nonlinear equality constrained stochastic optimization
- Stochastic first-order methods for convex and nonconvex functional constrained optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- The multiplier method of Hestenes and Powell applied to convex programming
- The Numerical Solution of Parabolic and Elliptic Differential Equations
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)
