A golden ratio proximal alternating direction method of multipliers for separable convex optimization

DOI10.1007/s10898-022-01154-yOpenAlexW4226287074MaRDI QIDQ6064037

Guoyong Gu, Junfeng Yang, Hongmei Chen

Publication date: 8 November 2023

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-022-01154-y

zbMATH Keywords

alternating direction method of multipliersergodic convergencegolden ratioproximalseparable convex optimizationlinear equality constrained

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Golden ratio proximal gradient ADMM for distributed composite convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Nonlinear total variation based noise removal algorithms
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• 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 new inexact alternating directions method for monotone variational inequalities
• Stochastic accelerated alternating direction method of multipliers with importance sampling
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A golden ratio primal-dual algorithm for structured convex optimization
• Golden ratio algorithms for variational inequalities
• Optimally linearizing the alternating direction method of multipliers for convex programming
• Accelerated alternating direction method of multipliers: an optimal \(O(1 / K)\) nonergodic analysis
• Multiplier and gradient methods
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A General Framework for a Class of First Order Primal-Dual Algorithms for Convex Optimization in Imaging Science
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization
• A First-Order Primal-Dual Algorithm with Linesearch
• The Linearized Alternating Direction Method of Multipliers for Dantzig Selector
• Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
• Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
• Accelerated First-Order Primal-Dual Proximal Methods for Linearly Constrained Composite Convex Programming
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Faster Lagrangian-Based Methods in Convex Optimization
• An Accelerated Linearized Alternating Direction Method of Multipliers
• Convex Analysis

This page was built for publication: A golden ratio proximal alternating direction method of multipliers for separable convex optimization