An inexact ADMM with proximal-indefinite term and larger stepsize

DOI10.1016/j.apnum.2022.10.015OpenAlexW4308512594MaRDI QIDQ2106244

Yanyan Li

Publication date: 9 December 2022

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2022.10.015

zbMATH Keywords

convergenceimage restorationstatistical learningindefinite proximal terminexact ADMMlarger stepsizes

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A practical relative error criterion for augmented Lagrangians
• An inexact alternating direction method of multipliers with relative error criteria
• Some projection methods with the BB step sizes for variational inequalities
• Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization
• Convergence study of indefinite proximal ADMM with a relaxation factor
• Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter
• 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 hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Approximate ADMM algorithms derived from Lagrangian splitting
• Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization
• Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• Generalized symmetric ADMM for separable convex optimization
• A parameterized proximal point algorithm for separable convex optimization
• Convergence rates for an inexact ADMM applied to separable convex optimization
• Iteration complexity analysis of a partial LQP-based alternating direction method of multipliers
• An inexact accelerated stochastic ADMM for separable convex optimization
• Convergence analysis of positive-indefinite proximal ADMM with a Glowinski's relaxation factor
• An inexact proximal generalized alternating direction method of multipliers
• A partially proximal S-ADMM for separable convex optimization with linear constraints
• Optimally linearizing the alternating direction method of multipliers for convex programming
• An LQP-based symmetric alternating direction method of multipliers with larger step sizes
• On the global and linear convergence of the generalized alternating direction method of multipliers
• On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
• Optimization theory and methods. Nonlinear programming
• Multiplier and gradient methods
• Iteration-complexity analysis of a generalized alternating direction method of multipliers
• An $\mathcal O(1/{k})$ Convergence Rate for the Variable Stepsize Bregman Operator Splitting Algorithm
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• Variational Analysis
• An Introduction to Variational Inequalities and Their Applications
• First-Order Methods in Optimization
• A NEW MODEL FOR SPARSE AND LOW-RANK MATRIX DECOMPOSITION
• Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming

This page was built for publication: An inexact ADMM with proximal-indefinite term and larger stepsize