Convergence study on the proximal alternating direction method with larger step size
From MaRDI portal
(Redirected from Publication:2200786)
Recommendations
- On the convergence of alternating direction method multipliers with larger step size than Glowinski's
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex
- Proximal ADMM with larger step size for two-block separable convex programming and its application to the correlation matrices calibrating problems
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes
- A proximal point algorithm revisit on the alternating direction method of multipliers
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3919744 (Why is no real title available?)
- scientific article; zbMATH DE number 3772867 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A new inexact alternating directions method for monotone variational inequalities
- A proximal point algorithm revisit on the alternating direction method of multipliers
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A unified primal-dual algorithm framework based on Bregman iteration
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Alternating proximal gradient method for convex minimization
- An introduction to continuous optimization for imaging
- Compressive principal component pursuit
- Convergence study on the symmetric version of ADMM with larger step sizes
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Linearized alternating direction method for constrained linear least-squares problem.
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Matrix completion via an alternating direction method
- Modeling, simulation and optimization for science and technology. Selected contributions based on the presentations at the conferences ``Optimization and PDE's with industrial applications, Jyväskylä, Finland, June, 2012 on the occasion of the 70th bi
- Multiplier and gradient methods
- On Glowinski's open question on the alternating direction method of multipliers
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
- 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
- On the global and linear convergence of the generalized alternating direction method of multipliers
- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Optimally linearizing the alternating direction method of multipliers for convex programming
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers
- Proximal alternating directions method for structured variational inequalities
- Solving large-scale least squares semidefinite programming by alternating direction methods
- Some Facts About Operator-Splitting and Alternating Direction Methods
- Splitting Methods in Communication, Imaging, Science, and Engineering
- Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
- The linearized alternating direction method of multipliers for Dantzig selector
- Understanding the convergence of the alternating direction method of multipliers: theoretical and computational perspectives
Cited in
(11)- On the iteration-complexity of a non-Euclidean hybrid proximal extragradient framework and of a proximal ADMM
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex
- The generalized proximal point algorithm with step size 2 is not necessarily convergent
- A relaxed proximal ADMM method for block separable convex programming
- An LQP-based symmetric alternating direction method of multipliers with larger step sizes
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming
- Convergence study on the symmetric version of ADMM with larger step sizes
- On the convergence of alternating direction method multipliers with larger step size than Glowinski's
- Convergence rate bounds for a proximal ADMM with over-relaxation stepsize parameter for solving nonconvex linearly constrained problems
- On Glowinski's open question on the alternating direction method of multipliers
- On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize
This page was built for publication: Convergence study on the proximal alternating direction method with larger step size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200786)
