Convergence properties of projection and contraction methods for variational inequality problems
From MaRDI portal
Some convergence properties of the projection and contraction method are proven in solving the variational inequality problem of finding a vector \(x^*\) of a convex closed set \(K\subseteq \mathbb{R}^n\) such that \(\langle f(x^*), x-x^* \rangle\geq 0\) for all \(x\in K\), where \(f\) is a continuous vector function from \(R^n\) to itself. In one of the variants of the method, when a nondegenerate solution is obtained, the entire optimal face can be identified after a finite number of iterations.
Recommendations
- scientific article; zbMATH DE number 1264071
- On the convergence rate of two projection methods for variational inequalities in \(\mathbb{R}^ n\)
- scientific article; zbMATH DE number 1486701
- A modified projection method with a new direction for solving variational inequalities
- A new class of projection and contraction methods for solving variational inequality problems
Cited in
(31)- Modified extragradient methods for solving variational inequalities
- Modified fixed-point equations and related iterative methods for variational inequalities
- Local convergence analysis of projection-type algorithms: unified approach
- Some recent advances in projection-type methods for variational inequalities
- On the convergence properties of scaled gradient projection methods with non-monotone Armijo-like line searches
- An infeasible stochastic approximation and projection algorithm for stochastic variational inequalities
- Convergence analysis of a projection algorithm for variational inequality problems
- A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Modified descent-projection method for solving variational inequalities
- Convergence of an extragradient-type method for variational inequality with applications to optimal control problems
- A generalized Weber problem with different gauges for different regions
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- From the projection and contraction methods for variational inequalities to the splitting contraction methods for convex optimization
- Modified projection method for general variational inequalities
- On a new numerical method for solving general variational inequalities
- A convergence analysis result for constrained convex minimization problem
- A regularized gradient projection method for the minimization problem
- Strong convergence of a projected gradient method
- Variant gradient projection methods for the minimization problems
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- AN ELLIPSOIDAL PROJECTION METHOD FOR VARIATIONAL INEQUALITY PROBLEMS OVER A POLYHEDRAL SET
- Remarks on Chen's inequalities for submanifolds of a Riemannian manifold of nearly quasi-constant curvature
- A descent Dai-Liao projection method for convex constrained nonlinear monotone equations with applications
- Convergence properties of nonmonotone spectral projected gradient methods
- Local convergence behavior of some projection-type methods for affine variational inequalities
- Modified extragradient method for variational inequalities and verification of solution existence
- Explicit hierarchical fixed point approach to variational inequalities
- Convergence of one-step projected gradient methods for variational inequalities
- A superlinearly convergent projection method for constrained systems of nonlinear equations
- New extragradient-type methods for solving variational inequalities
This page was built for publication: Convergence properties of projection and contraction methods for variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5939808)
