Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities

DOI10.1007/S101070000164MaRDI QIDQ1587939zbMATH OpenFDO

Authors J.-P. Crouzeix, P. Marcotte, Daoli Zhu

Publication date 3 December 2000

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S101070000164

zbMATH Keywords

interior point methodspseudomonotonicityvariational inequalitiesgeneralized monotonicitycutting plane methods

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40)

Recommendations

• scientific article; zbMATH DE number 1867122
• On the solution of variational inequality problems by using cutting plane methods
• Pseudomonotone\(_*\) maps and the cutting plane property
• An analytic center cutting plane method for pseudomonotone variational inequalities
• The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms

Cited in

(26)

• Continuity properties of solution maps of parametric lexicographic equilibrium problems
• The Orthogonality Theorem and the Strong-f-Monotonicity Condition for Variational Inequality Algorithms
• On the solution of variational inequality problems by using cutting plane methods
• Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
• scientific article; zbMATH DE number 1867122 (Why is no real title available?)
• A proximal method with logarithmic barrier for nonlinear complementarity problems
• On penalty method for equilibrium problems in lexicographic order
• Lexicographic and sequential equilibrium problems
• A projection subgradient method for solving optimization with variational inequality constraints
• On gap functions for multivalued Stampacchia variational inequalities
• Characterizations of the solution sets of convex programs and variational inequality problems
• Pseudomonotone operators: a survey of the theory and its applications
• An interior proximal method for a class of quasimonotone variational inequalities
• A proximal analytic center cutting plane algorithm for solving variational inequality problems
• Gâteaux differentiability of the dual gap function of a variational inequality
• Pseudomonotone\(_*\) maps and the cutting plane property
• Existence of solutions and convergence of iterative algorithms for a system of generalized nonlinear mixed quasi-variational inclusions
• The demand functions that satisfy the weak axiom of revealed preference and generalized monotonicity
• Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
• Random and cyclic projection algorithms for variational inequalities
• A two-phase algorithm for a variational inequality formulation of equilibrium problems
• A new projection algorithm for solving constrained equilibrium problems in Hilbert spaces
• New classes of generalized invex monotonicity
• Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
• Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation
• Generalized invex monotonicity and its role in solving variational-like inequalities

This page was built for publication: Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587939)