A cutting plane method for solving quasimonotone variational inequalities
From MaRDI portal
Publication:5948407
DOI10.1023/A:1011219303531zbMath1054.90073OpenAlexW1636353766MaRDI QIDQ5948407
Publication date: 2001
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1011219303531
Related Items (13)
Analytic center cutting plane methods for variational inequalities over convex bodies ⋮ Solving variational inequalities defined on a domain with infinitely many linear constraints ⋮ 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 ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ Finite convergence of a projected proximal point algorithm for the generalized variational inequalities ⋮ A projection-type method for generalized variational inequalities with dual solutions ⋮ Generalized invex monotonicity and its role in solving variational-like inequalities ⋮ Weak convergence of iterative methods for solving quasimonotone variational inequalities ⋮ A double projection method for solving variational inequalities without monotonicity ⋮ Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms ⋮ Fast inertial extragradient algorithms for solving non-Lipschitzian equilibrium problems without monotonicity condition in real Hilbert spaces ⋮ An infeasible projection type algorithm for nonmonotone variational inequalities
This page was built for publication: A cutting plane method for solving quasimonotone variational inequalities