An iterative method for generalized complementarity problems

DOI10.1109/TAC.1980.1102537zbMath0483.49027MaRDI QIDQ3941951

Shu-Cherng Fang

Publication date: 1980

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

zbMATH Keywords

polyhedral cones; an iterative method; complementarity problem over a cone

Mathematics Subject Classification ID

90C25: Convex programming

49J40: Variational inequalities

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

90C55: Methods of successive quadratic programming type

52Bxx: Polytopes and polyhedra

Related Items

A variant of korpelevich’s method for variational inequalities with a new search strategy, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, Iterative algorithms for semi-linear quasi-complementarity problems, On the nonlinear complementarity problem, Fixed point approach for complementarity problems, Solving symmetric monotone linear variational inequalities by some modified Levitin-Polyak projection methods, A new method for a class of linear variational inequalities, Perturbed proximal point algorithms for generalized quasivariational inclusions, On a class of generalized nonlinear implicit quasivariational inclusions, A new class of projection and contraction methods for solving variational inequality problems, Unnamed Item, A Strongly Convergent Direct Method for Monotone Variational Inequalities in Hilbert Spaces, A relaxed projection method for variational inequalities, Set–Valued Implicit Wiener-Hopf Equations and Generalized Strongly Nonlinear Quasivariational Inequalities