Results 51 to 60 of about 745 (143)
A Projection‐Type Method for Multivalued Variational Inequality
We propose a projection‐type method for multivalued variational inequality. The iteration sequence generated by the algorithm is proven to be globally convergent to a solution, provided that the multivalued mapping is continuous with nonempty compact convex values.
Changjie Fang +3 more
wiley +1 more source
We propose two Mann-type subgradient-like extra gradient iterations with the line-search procedure for hierarchical variational inequality (HVI) with the common fixed-point problem (CFPP) constraint of finite family of nonexpansive mappings and an ...
Lu-Chuan Ceng +2 more
doaj +1 more source
This paper aims to introduce an iterative algorithm based on an inertial technique that uses the minimum number of projections onto a nonempty, closed, and convex set. We show that the algorithm generates a sequence that converges strongly to the common solution of a variational inequality involving inverse strongly monotone mapping and fixed point ...
Watanjeet Singh +2 more
wiley +1 more source
Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets
Consider the variational inequality VI(C, F) of finding a point x* ∈ C satisfying the property 〈Fx*, x − x*〉≥0, for all x ∈ C, where C is the intersection of finite level sets of convex functions defined on a real Hilbert space H and F : H → H is an L‐Lipschitzian and η‐strongly monotone operator.
Songnian He, Caiping Yang, Simeon Reich
wiley +1 more source
In this paper, we present a modified subgradient extragradient method with double inertial extrapolation terms and a non-monotonic adaptive step size for solving quasi-monotone and Lipschitz continuous variational inequalities in real Hilbert spaces.
Haiying Li, Xingfang Wang
openaire +1 more source
Implicit Methods for Equilibrium Problems on Hadamard Manifolds
We use the auxiliary principle technique to suggest and analyze an implicit method for solving the equilibrium problems on Hadamard manifolds. The convergence of this new implicit method requires only the speudomonotonicity, which is a weaker condition than monotonicity. Some special cases are also considered.
Muhammad Aslam Noor +3 more
wiley +1 more source
This research focuses on developing a novel approach to finding fixed points of quasi-nonexpansive mappings without relying on the demi-closedness condition, a common requirement in previous studies. The approach is based on the Subgradient Extragradient
Anchalee Sripattanet, Atid Kangtunyakarn
doaj +1 more source
A plethora of applications in non-linear analysis, including minimax problems, mathematical programming, the fixed-point problems, saddle-point problems, penalization and complementary problems, may be framed as a problem of equilibrium.
Wiyada Kumam, Kanikar Muangchoo
doaj +1 more source
A new modified subgradient extragradient method for solving variational inequalities
The goal of the note is to introduce a new modified subgradient extragradient algorithm for solving variational inequalities in Hilbert spaces.
Migórski, Stanisław +2 more
openaire +2 more sources
Modified Halfspace‐Relaxation Projection Methods for Solving the Split Feasibility Problem
This paper presents modified halfspace‐relaxation projection (HRP) methods for solving the split feasibility problem (SFP). Incorporating with the techniques of identifying the optimal step length with positive lower bounds, the new methods improve the efficiencies of the HRP method (Qu and Xiu (2008)). Some numerical results are reported to verify the
Min Li, Abdellah Bnouhachem
wiley +1 more source

