A revisit of Chen-Teboulle's proximal-based decomposition method

DOI10.3934/jimo.2023112arXiv2006.11255OpenAlexW3036827554MaRDI QIDQ6149299

Feng Ma

Publication date: 5 February 2024

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

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

zbMATH Keywords

convex programmingproximal methodaugmented Lagrangianlarger step size

Mathematics Subject Classification ID

Convex programming (90C25) Numerical methods involving duality (49M29) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• 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
• Parallel multi-block ADMM with \(o(1/k)\) convergence
• Sensitivity analysis of the proximal-based parallel decomposition methods
• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
• Multiplier and gradient methods
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Optimal proximal augmented Lagrangian method and its application to full Jacobian splitting for multi-block separable convex minimization problems