A unifying geometric solution framework and complexity analysis for variational inequalities
From MaRDI portal
Publication:1919807
DOI10.1007/BF01590959zbMath0848.49009WikidataQ89215082 ScholiaQ89215082MaRDI QIDQ1919807
Thomas L. Magnanti, Georgia Perakis
Publication date: 18 September 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Solving variational inequalities defined on a domain with infinitely many linear constraints ⋮ An analytic center cutting plane method for pseudomonotone variational inequalities ⋮ Some Goldstein's type methods for co-coercive variant variational inequalities ⋮ Global bounds for the distance to solutions of co-coercive variational inequalities ⋮ Global bounds for cocoercive variational inequalities ⋮ Solving asymmetric variational inequalities via convex optimization ⋮ Solving variational inequality and fixed point problems by line searches and potential optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- The gap function of a convex program
- Network economics: a variational inequality approach
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
- On the Solution of Variational Inequalities by the Ellipsoid Method
- Generalized Descent Methods for Asymmetric Systems of Equations
- Feature Article—The Ellipsoid Method: A Survey
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory
