An infeasible projection type algorithm for nonmonotone variational inequalities
From MaRDI portal
Publication:2118960
DOI10.1007/s11075-021-01170-1zbMath1505.47098OpenAlexW3188642928MaRDI QIDQ2118960
Publication date: 23 March 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-021-01170-1
global convergenceconvergence rateinfeasible projection algorithmquasiconvex minimization problemsquasimonotone variational inequality problems
Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Projection algorithms for solving nonmonotone equilibrium problems in Hilbert space
- A class of shrinking projection extragradient methods for solving non-monotone equilibrium problems in Hilbert spaces
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Complementarity problems over cones with monotone and pseudomonotone maps
- Error bounds in mathematical programming
- Convergence rate analysis of iteractive algorithms for solving variational inequality problems
- Combined relaxation methods for variational inequalities
- Two new self-adaptive projection methods for variational inequality problems
- Solvability of the Minty variational inequality
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Some recent advances in projection-type methods for variational inequalities
- On linear convergence of iterative methods for the variational inequality problem
- On combined relaxation methods' convergence rates
- An interior proximal method for a class of quasimonotone variational inequalities
- Weak convergence of iterative methods for solving quasimonotone variational inequalities
- An extragradient method for solving variational inequalities without monotonicity
- An iterative algorithm for solving variational inequality, generalized mixed equilibrium, convex minimization and zeros problems for a class of nonexpansive-type mappings
- A projection algorithm for non-monotone variational inequalities
- A strong convergence theorem for solving pseudo-monotone variational inequalities using projection methods
- Fast and simple Bregman projection methods for solving variational inequalities and related problems in Banach spaces
- Projection extragradient algorithms for solving nonmonotone and non-Lipschitzian equilibrium problems in Hilbert spaces
- Inertial methods for finding minimum-norm solutions of the split variational inequality problem beyond monotonicity
- A class of projection and contraction methods for monotone variational inequalities
- A double projection method for solving variational inequalities without monotonicity
- A new double projection algorithm for variational inequalities
- Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Monotone Operators and the Proximal Point Algorithm
- A New Projection Method for Variational Inequality Problems
- An improved projection method for solving generalized variational inequality problems
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Modified inertial subgradient extragradient method with self adaptive stepsize for solving monotone variational inequality and fixed point problems
- A Subgradient-Based Approach for Finding the Maximum Feasible Subsystem with Respect to a Set
- Projected Reflected Gradient Methods for Monotone Variational Inequalities
- A half-space projection method for solving generalized Nash equilibrium problems
- Nonlinear Programming
- Extragradient algorithms extended to equilibrium problems¶
- Convex programming in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- A cutting plane method for solving quasimonotone variational inequalities
