Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
From MaRDI portal
The authors define several stronger monotonicity and pseudomonotonicity properties for mappings \(F: D\to\mathbb{R}^n\) (\(D\) being an open convex subset of \(\mathbb{R}^n\)) and give linear algebraic and first-order sufficient conditions ensuring them. These new notions are useful for studying variational inequality problems and, in particular, for analyzing the convergence of cutting plane and interior point methods.
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)- On penalty method for equilibrium problems in lexicographic order
- An interior proximal method for a class of quasimonotone variational inequalities
- A proximal analytic center cutting plane algorithm for solving variational inequality problems
- Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
- Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
- Pseudomonotone\(_*\) maps and the cutting plane property
- Gâteaux differentiability of the dual gap function of a variational inequality
- Pseudomonotone operators: a survey of the theory and its applications
- 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
- New classes of generalized invex monotonicity
- Continuity properties of solution maps of parametric lexicographic equilibrium problems
- A proximal method with logarithmic barrier for nonlinear complementarity 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
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- scientific article; zbMATH DE number 1867122 (Why is no real title available?)
- Random and cyclic projection algorithms for variational inequalities
- A new projection algorithm for solving constrained equilibrium problems in Hilbert spaces
- The demand functions that satisfy the weak axiom of revealed preference and generalized monotonicity
- Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation
- On gap functions for multivalued Stampacchia variational inequalities
- Characterizations of the solution sets of convex programs and variational inequality problems
- Generalized invex monotonicity and its role in solving variational-like inequalities
- Lexicographic and sequential equilibrium problems
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)
