A self-adaptive descent LQP alternating direction method for the structured variational inequalities

DOI10.1007/s11075-020-00890-0zbMath1456.65047OpenAlexW3012141446MaRDI QIDQ2219447

Abdellah Bnouhachem

Publication date: 20 January 2021

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-020-00890-0

zbMATH Keywords

variational inequalitiesmonotone operatorprojection methodalternating direction methodlogarithmic-quadratic proximal method

Mathematics Subject Classification ID

Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• New descent LQP alternating direction methods for solving a class of structured variational inequalities
• A descent LQP alternating direction method for solving variational inequality problems with separable structure
• An inexact LQP alternating direction method for solving a class of structured variational inequalities
• On the \(O(1/t)\) convergence rate of the alternating direction method with LQP regularization for solving structured variational inequality problems
• On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities
• A new parallel splitting descent method for structured variational inequalities
• An inexact alternating direction method for structured variational inequalities
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
• A projection-based prediction-correction method for structured monotone variational inequalities
• New parallel descent-like method for solving a class of variational inequalities
• Application of the alternating direction method of multipliers to separable convex programming problems
• A variable-penalty alternating directions method for convex optimization
• A logarithmic-quadratic proximal method for variational inequalities
• A new inexact alternating directions method for monotone variational inequalities
• A new descent alternating direction method with LQP regularization for the structured variational inequalities
• On LQP alternating direction method for solving variational inequality problems with separable structure
• Parallel LQP alternating direction method for solving variational inequality problems with separable structure
• An inexact alternating direction method for solving a class of structured variational inequalities
• A modified alternating projection based prediction-correction method for structured variational inequalities
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
• Projection methods for variational inequalities with application to the traffic assignment problem
• Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
• Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
• Lagrangian Duality and Related Multiplier Methods for Variational Inequality Problems
• On alternating direction method for solving variational inequality problems with separable structure
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• A hybrid LQP-based method for structured variational inequalities
• On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• On Preconditioning of Incompressible Non-Newtonian Flow Problems
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
• Entropic proximal decomposition methods for convex programs and variational inequalities

This page was built for publication: A self-adaptive descent LQP alternating direction method for the structured variational inequalities