A polynomial-time algorithm for affine variational inequalities
From MaRDI portal
Publication:2639604
Recommendations
- Affine algorithms for the split variational inequality and equilibrium problems
- A polynomial algorithm for convex quadratic optimization subject to linear inequalities
- Polynomial affine algorithms for linear programming
- A class of polynomial variable metric algorithms for linear optimization
- Algorithms for the variational inequalities and fixed point problems
- scientific article; zbMATH DE number 953034
- Polynomial vector variational inequalities under polynomial constraints and applications
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- An algorithm to solve variational inequalities in the linear case
- A note on general algorithm for variational inequalities
Cites work
- A new continuation method for complementarity problems with uniform P- functions
- A polynomial-time algorithm for a class of linear complementarity problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On the Solution of Variational Inequalities by the Ellipsoid Method
Cited in
(6)- Interior-point algorithms for monotone affine variational inequalities
- A class of polynomial variable metric algorithms for linear optimization
- Reduction of affine variational inequalities
- Solving asymmetric variational inequalities via convex optimization
- Solving nonmonotone affine variational inequalities problem by DC programming and DCA
- An efficient DCA algorithm for solving non-monotone affine variational inequality problem
This page was built for publication: A polynomial-time algorithm for affine variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639604)