Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization
From MaRDI portal
Publication:2435026
DOI10.1007/s10957-013-0334-4zbMath1282.90197OpenAlexW2089630933MaRDI QIDQ2435026
Li-Zhi Liao, Min Li, Xiao-Ming Yuan
Publication date: 3 February 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-013-0334-4
inexactvariational inequalityconvergence ratealternating direction method of multiplierslogarithmic-quadratic proximal regularization
Related Items
An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems ⋮ Inexact alternating direction methods of multipliers for separable convex optimization ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming ⋮ On inexact ADMMs with relative error criteria ⋮ Efficient alternating minimization methods for variational edge-weighted colorization models ⋮ Convergence rates for an inexact ADMM applied to separable convex optimization ⋮ Acceleration of primal-dual methods by preconditioning and simple subproblem procedures ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A logarithmic-quadratic proximal method for variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- On Preconditioning of Incompressible Non-Newtonian Flow Problems
- Entropic proximal decomposition methods for convex programs and variational inequalities