The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
From MaRDI portal
Publication:3124045
DOI10.1137/S1052623493259227zbMath0872.90085MaRDI QIDQ3124045
Thomas L. Magnanti, Georgia Perakis
Publication date: 5 October 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Convex programming (90C25) Nonlinear programming (90C30) Variational inequalities (49J40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)
Related Items (5)
A unifying geometric solution framework and complexity analysis for 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 ⋮ Solving variational inequality and fixed point problems by line searches and potential optimization ⋮ Coupling the auxiliary problem principle and epiconvergence theory to solve general variational inequalities
This page was built for publication: The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
