Pages that link to "Item:Q3711226"
From MaRDI portal
The following pages link to On the Solution of Variational Inequalities by the Ellipsoid Method (Q3711226):
Displaying 13 items.
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications (Q811414) (← links)
- Generalized Nash games and quasi-variational inequalities (Q1179010) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
- An analytic center cutting plane method for pseudomonotone variational inequalities (Q1374377) (← links)
- A unifying geometric solution framework and complexity analysis for variational inequalities (Q1919807) (← links)
- Solving asymmetric variational inequalities via convex optimization (Q2480044) (← links)
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method (Q2514448) (← links)
- General models in min-max continuous location: Theory and solution techniques (Q2564174) (← links)
- A polynomial-time algorithm for affine variational inequalities (Q2639604) (← links)
- A direct ellipsoid method for linear programming (Q4287866) (← links)
- An ellipsoid algorithm for equality-constrained nonlinear programs (Q5926611) (← links)
- Duality methods with an automatic choice of parameters. Application to shallow water equations in conservative form (Q5944731) (← links)
