A revisit of Chen-Teboulle's proximal-based decomposition method
From MaRDI portal
Publication:6149299
DOI10.3934/JIMO.2023112arXiv2006.11255OpenAlexW3036827554MaRDI QIDQ6149299FDOQ6149299
Authors: Feng Ma 
Publication date: 5 February 2024
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Abstract: In this paper, we show that Chen-Teboulle's proximal-based decomposition method can be interpreted as a proximal augmented Lagrangian method. More precisely, it coincides with a linearized augmented Lagrangian method. We then proposed three generalized methods based on this interpretation. By invoking recent work (He et al., IMA J. Numer. Anal., 32 (2020), pp. 227--245), we show that the step size condition of Chen-Teboulle's method can be relaxed without adding any further assumptions. Our analysis offers a new insight into this proximal-based decomposition method.
Full work available at URL: https://arxiv.org/abs/2006.11255
Recommendations
- A proximal-based deomposition method for compositions method for convex minimization problems
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- A proximal multiplier method for separable convex minimization
- The rate of convergence of proximal method of multipliers for equality constrained optimization problems
- Generalizations of the proximal method of multipliers in convex optimization
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Numerical methods involving duality (49M29)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Title not available (Why is that?)
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Multiplier and gradient methods
- Title not available (Why is that?)
- A proximal-based deomposition method for compositions method for convex minimization problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems
- Title not available (Why is that?)
- Sensitivity analysis of the proximal-based parallel decomposition methods
- My 20 years research on alternating directions method of multipliers
- On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
This page was built for publication: A revisit of Chen-Teboulle's proximal-based decomposition method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6149299)
