Entropic proximal decomposition methods for convex programs and variational inequalities
From MaRDI portal
Publication:5955559
DOI10.1007/s101070100241zbMath1051.90017OpenAlexW91193362MaRDI QIDQ5955559
Marc Teboulle, Alfred Auslender
Publication date: 2001
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100241
variational inequalitiesconvex optimizationdecomposition methodsentropic/interior proximal methodsLagrangian multiplier methods
Related Items
The interior proximal extragradient method for solving equilibrium problems ⋮ Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ A Strictly Contractive Peaceman-Rachford Splitting Method with Logarithmic-Quadratic Proximal Regularization for Convex Programming ⋮ The developments of proximal point algorithms ⋮ Inexact alternating direction methods of multipliers with logarithmic-quadratic proximal regularization ⋮ Convergence rate of a proximal multiplier algorithm for separable convex minimization ⋮ Modified Lagrangian methods for separable optimization problems ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ Benders decomposition for a class of variational inequalities ⋮ An improved proximal-based decomposition method for structured monotone variational inequalities ⋮ Further study on the convergence rate of alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ A note on augmented Lagrangian-based parallel splitting method ⋮ Comparison of two proximal point algorithms for monotone variational inequalities ⋮ Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization ⋮ An approximate proximal-extragradient type method for monotone variational inequalities ⋮ A proximal multiplier method for separable convex minimization ⋮ The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming ⋮ Dantzig-Wolfe decomposition of variational inequalities ⋮ An LQP-based symmetric alternating direction method of multipliers with larger step sizes ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ Nonlinear proximal decomposition method for convex programming ⋮ Convergence study on the logarithmic-quadratic proximal regularization of strictly contractive Peaceman–Rachford splitting method with larger step-size
This page was built for publication: Entropic proximal decomposition methods for convex programs and variational inequalities
