New parallel descent-like method for solving a class of variational inequalities
From MaRDI portal
Publication:987502
DOI10.1007/s10957-009-9619-zzbMath1197.90335OpenAlexW2032209591MaRDI QIDQ987502
Publication date: 13 August 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9619-z
Related Items (16)
A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ 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 ⋮ On descent alternating direction method with LQP regularization for the structured variational inequalities ⋮ An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ On alternating direction method for solving variational inequality problems with separable structure ⋮ A new descent alternating direction method with LQP regularization for the structured variational inequalities ⋮ A descent SQP alternating direction method for minimizing the sum of three convex functions ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ A new LQP alternating direction method for solving variational inequality problems with separable structure ⋮ An alternating direction-based contraction method for linearly constrained separable convex programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A variable-penalty alternating directions method for convex optimization
- Advances in randomized parallel computing
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- New alternating direction method for a class of nonlinear variational inequality problems
- A new inexact alternating directions method for monotone variational inequalities
- Network economics: a variational inequality approach
- Proximal alternating directions method for structured variational inequalities
- Projection methods for variational inequalities with application to the traffic assignment problem
- Engineering and Economic Applications of Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the basic theorem of complementarity
This page was built for publication: New parallel descent-like method for solving a class of variational inequalities