An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity
From MaRDI portal
Publication:6565284
DOI10.1080/02331934.2023.2187661MaRDI QIDQ6565284FDOQ6565284
Authors: Minglu Ye
Publication date: 1 July 2024
Published in: Optimization (Search for Journal in Brave)
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40)
Cites Work
- iPiano: inertial proximal algorithm for nonconvex optimization
- Gradient methods for minimizing composite functions
- Combined relaxation methods for variational inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Convex programming in Hilbert space
- Improvements of some projection methods for monotone nonlinear variational inequalities
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Complementarity problems over cones with monotone and pseudomonotone maps
- A new double projection algorithm for variational inequalities
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Extensions of Korpelevich's extragradient method for the variational inequality problem in Euclidean space
- Title not available (Why is that?)
- A New Projection Method for Variational Inequality Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A class of projection and contraction methods for monotone variational inequalities
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- Convex analysis and monotone operator theory in Hilbert spaces
- A combined relaxation method for variational inequalities with nonlinear constraints
- Modified hybrid projection methods for finding common solutions to variational inequality problems
- Some methods of speeding up the convergence of iteration methods
- A half-space projection method for solving generalized Nash equilibrium problems
- Some recent advances in projection-type methods for variational inequalities
- The extragradient algorithm with inertial effects for solving the variational inequality
- Unified framework of extragradient-type methods for pseudomonotone variational inequalities.
- Title not available (Why is that?)
- Two new self-adaptive projection methods for variational inequality problems
- An extragradient algorithm for monotone variational inequalities
- Projected reflected gradient methods for monotone variational inequalities
- On combined relaxation methods' convergence rates
- Title not available (Why is that?)
- Inertial projection and contraction algorithms for variational inequalities
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- An improved projection method for solving generalized variational inequality problems
- A proximal difference-of-convex algorithm with extrapolation
- On the convergence of inertial two-subgradient extragradient method for variational inequality problems
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
This page was built for publication: An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565284)