Iteration complexity of generalized complementarity problems

DOI10.1186/s13660-019-2024-8zbMath1499.90252OpenAlexW2947957240WikidataQ128200930 ScholiaQ128200930MaRDI QIDQ2067800

Meshari Alesemi, Salahuddin

Publication date: 19 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-019-2024-8

zbMATH Keywords

projection operatorsconvergence rateiteration complexitygeneralized complementarity problemsergodic and nonergodic sense

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (1)

On the parametric elliptical variational-hemivariational inequality problem with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gradient methods for minimizing composite functions
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A new method for a class of linear variational inequalities
• On non-ergodic convergence rate of Douglas-Rachford alternating direction method of multipliers
• On the iteration complexity of some projection methods for monotone linear variational inequalities
• Engineering and Economic Applications of Complementarity Problems
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Complementarity problems

This page was built for publication: Iteration complexity of generalized complementarity problems