Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
From MaRDI portal
Publication:1587939
DOI10.1007/s101070000164zbMath0976.49008MaRDI QIDQ1587939
Patrice Marcotte, Jean-Pierre Crouzeix, Dao-Li Zhu
Publication date: 3 December 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
variational inequalitiesinterior point methodsgeneralized monotonicitypseudomonotonicitycutting plane methods
Nonconvex programming, global optimization (90C26) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40)
Related Items
A proximal method with logarithmic barrier for nonlinear complementarity problems ⋮ Characterizations of the solution sets of convex programs and variational inequality problems ⋮ Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities ⋮ Random and cyclic projection algorithms for variational inequalities ⋮ An interior proximal method for a class of quasimonotone variational inequalities ⋮ Gâteaux differentiability of the dual gap function of a variational inequality ⋮ Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation ⋮ Pseudomonotone operators: a survey of the theory and its applications ⋮ On gap functions for multivalued Stampacchia variational inequalities ⋮ A projection subgradient method for solving optimization with variational inequality constraints ⋮ A two-phase algorithm for a variational inequality formulation of equilibrium problems ⋮ Existence of solutions and convergence of iterative algorithms for a system of generalized nonlinear mixed quasi-variational inclusions ⋮ Generalized invex monotonicity and its role in solving variational-like inequalities ⋮ On penalty method for equilibrium problems in lexicographic order ⋮ Lexicographic and sequential equilibrium problems ⋮ The demand functions that satisfy the weak axiom of revealed preference and generalized monotonicity ⋮ New classes of generalized invex monotonicity ⋮ Pseudomonotone\(_*\) maps and the cutting plane property ⋮ Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order ⋮ A new projection algorithm for solving constrained equilibrium problems in Hilbert spaces ⋮ Continuity properties of solution maps of parametric lexicographic equilibrium problems ⋮ Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity