Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities
From MaRDI portal
Publication:704729
DOI10.1023/B:JOTA.0000025706.49562.08zbMath1056.49011MaRDI QIDQ704729
Publication date: 19 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
variational inequalitiesdecompositionregularizationgeneralized monotonicitypseudomonotonicityconvergence of algorithms
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Numerical methods based on nonlinear programming (49M37)
Related Items (8)
New step lengths in conjugate gradient methods ⋮ Solution methods for pseudomonotone variational inequalities ⋮ Qualitative properties of strongly pseudomonotone variational inequalities ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ Pseudomonotone variational inequalities: convergence of the auxiliary problem method ⋮ Study of equilibrium problem in Hadamard manifolds by extending some concepts of nonlinear analysis ⋮ Modified projection method for strongly pseudomonotone variational inequalities ⋮ Relaxed quasimonotone operators and relaxed quasiconvex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Auxiliary problem principle and decomposition of optimization problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Auxiliary problem principle extended to variational inequalities
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Complementarity problems over cones with monotone and pseudomonotone maps
- Progressive regularization of variational inequalities and decomposition algorithms
- Multi-valued variational inequalities with \(K\)-pseudomonotone operators
- Pseudomonotone variational inequality problems: Existence of solutions
- Strong and Weak Convexity of Sets and Functions
- Submonotone mappings and the proximal point algorithm
- Iterative methods for variational and complementarity problems
- Optimization by decomposition and coordination: A unified approach
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
- Pseudomonotone variational inequalities: Convergence of proximal methods
- Pseudomonotone variational inequalities: convergence of the auxiliary problem method
This page was built for publication: Convergent algorithm based on progressive regularization for solving pseudomonotone variational inequalities
