A polynomial-time algorithm for affine variational inequalities

DOI10.1016/0893-9659(91)90162-OzbMath0718.65048OpenAlexW2039941572MaRDI QIDQ2639604

Baichun Xiao, Patrick T. Harker

Publication date: 1991

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(91)90162-o

zbMATH Keywords

convergencenumerical examplepolynomial-time algorithmaffine variational inequalityconvex quadratic programs

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Variational inequalities (49J40)

Related Items (2)

Solving nonmonotone affine variational inequalities problem by DC programming and DCA ⋮ Solving asymmetric variational inequalities via convex optimization

Cites Work

• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• A new continuation method for complementarity problems with uniform P- functions
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A polynomial-time algorithm for a class of linear complementarity problems
• On the Solution of Variational Inequalities by the Ellipsoid Method

This page was built for publication: A polynomial-time algorithm for affine variational inequalities