Results 41 to 50 of about 142 (116)

Self-adaptive subgradient extragradient-type methods for solving variational inequalities

Journal of Inequalities and Applications, 2022
AbstractIn this paper, we introduce two subgradient extragradient-type algorithms for solving variational inequality problems in the real Hilbert space. The first one can be applied when the mapping f is strongly pseudomonotone (not monotone) and Lipschitz continuous.
Beibei Ma, Wanyu Wang
openaire   +2 more sources

A Hybrid Subgradient Algorithm for Finding a Common Solution of an Equilibrium Problem and a Family of Strict Pseudocontraction Mappings

Journal of Applied Mathematics, Volume 2014, Issue 1, 2014., 2014
We propose a new strongly convergent algorithm for finding a common point in the solution set of a class of pseudomonotone equilibrium problems and the set of common fixed points of a family of strict pseudocontraction mappings in a real Hilbert space. The strong convergence theorem of proposed algorithms is investigated without the Lipschitz condition
Ekkarath Thailert, Rabian Wangkeeree, Chanoksuda Khantree, Giuseppe Marino   +3 more
wiley   +1 more source

A Subgradient Extragradient Framework Incorporating a Relaxation and Dual Inertial Technique for Variational Inequalities

Mathematics
This paper presents an enhanced algorithm designed to solve variational inequality problems that involve a pseudomonotone and Lipschitz continuous operator in real Hilbert spaces.
Habib ur Rehman, Kanokwan Sitthithakerngkiet, Thidaporn Seangwattana   +2 more
doaj   +1 more source

A Convergent Algorithm for Equilibrium Problem to Predict Prospective Mathematics Teachers’ Technology Integrated Competency

Mathematics, 2022
Educational data classification has become an effective tool for exploring the hidden pattern or relationship in educational data and predicting students’ performance or teachers’ competency.
Nipa Jun-on, Watcharaporn Cholamjiak, Raweerote Suparatulatorn   +2 more
doaj   +1 more source

A General Self‐Adaptive Relaxed‐PPA Method for Convex Programming with Linear Constraints

Abstract and Applied Analysis, Volume 2013, Issue 1, 2013., 2013
We present an efficient method for solving linearly constrained convex programming. Our algorithmic framework employs an implementable proximal step by a slight relaxation to the subproblem of proximal point algorithm (PPA). In particular, the stepsize choice condition of our algorithm is weaker than some elegant PPA‐type methods.
Xiaoling Fu, Abdellah Bnouhachem
wiley   +1 more source

An Extension of Subgradient Method for Variational Inequality Problems in Hilbert Space

Abstract and Applied Analysis, Volume 2013, Issue 1, 2013., 2013
An extension of subgradient method for solving variational inequality problems is presented. A new iterative process, which relates to the fixed point of a nonexpansive mapping and the current iterative point, is generated. A weak convergence theorem is obtained for three sequences generated by the iterative process under some mild conditions.
Xueyong Wang, Shengjie Li, Xipeng Kou, Guanglu Zhou   +3 more
wiley   +1 more source

A Projection‐Type Method for Multivalued Variational Inequality

Abstract and Applied Analysis, Volume 2013, Issue 1, 2013., 2013
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, Shenglan Chen, Jiming Zheng, Shawn X. Wang   +3 more
wiley   +1 more source

On Mann-Type Subgradient-like Extragradient Method with Linear-Search Process for Hierarchical Variational Inequalities for Asymptotically Nonexpansive Mappings

Mathematics, 2021
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, Jen-Chih Yao, Yekini Shehu   +2 more
doaj   +1 more source

A Modified Form of Inertial Viscosity Projection Methods for Variational Inequality and Fixed Point Problems

Journal of Mathematics, Volume 2024, Issue 1, 2024.
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, Sumit Chandok, Valerii Obukhovskii   +2 more
wiley   +1 more source

Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets

Abstract and Applied Analysis, Volume 2013, Issue 1, 2013., 2013
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