An inexact alternating direction method for solving a class of structured variational inequalities

DOI10.1016/j.amc.2013.01.067zbMath1293.49071OpenAlexW2063331413MaRDI QIDQ2451382

Abdellah Bnouhachem, Hafida Benazza, Mohamed Khalfaoui

Publication date: 3 June 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.01.067

zbMATH Keywords

monotone operatornonlinear complementarity problemlogarithmic-quadratic proximal methodinexact alternating direction methodstructured variational inequalities (VIs)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Variational inequalities (49J40) Monotone operators and generalizations (47H05) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)

Related Items

A generalized Weber problem with different gauges for different regions ⋮ 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 descent alternating direction method with LQP regularization for the structured variational inequalities ⋮ Sensitivity analysis of the proximal-based parallel decomposition methods ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ Efficient algorithms for solving condition number-constrained matrix minimization problems ⋮ 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 ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ On LQP alternating direction method for solving variational inequality problems with separable structure ⋮ An LQP-SQP 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 efficient method for solving a matrix least squares problem over a matrix inequality constraint ⋮ A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach ⋮ A new implementable prediction-correction method for monotone variational inequalities with separable structure ⋮ On the pointwise iteration-complexity of a dynamic regularized ADMM with over-relaxation stepsize

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A projection-based prediction-correction method for structured monotone variational inequalities
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A variable-penalty alternating directions method for convex optimization
• A logarithmic-quadratic proximal method for variational inequalities
• Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities
• A proximal-based deomposition method for compositions method for convex minimization problems
• A new inexact alternating directions method for monotone variational inequalities
• An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convergence of Proximal-Like Algorithms
• On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization