Results 41 to 50 of about 748 (130)
Improved subgradient extragradient methods for solving pseudomonotone variational inequalities in Hilbert spaces [PDF]
Applied Numerical Mathematics, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Viet Thong Duong, Tu Vuong Phan
openaire +2 more sources
Mathematics, 2020 Two inertial subgradient extragradient algorithms for solving variational inequality problems involving pseudomonotone operator are proposed in this article.
Jamilu Abubakar +3 more
doaj +1 more source
A New Extragradient‐Type Algorithm for the Split Feasibility Problem
Mathematical Problems in Engineering, Volume 2016, Issue 1, 2016., 2016 We consider the split feasibility problem (SFP) in Hilbert spaces, inspired by extragradient method presented by Ceng, Ansari for split feasibility problem, subgradient extragradient method proposed by Censor, and variant extragradient‐type method presented by Yao for variational inequalities; we suggest an extragradient‐type algorithm for the SFP.
Yazheng Dang +3 more
wiley +1 more source
On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Optimization
, 2019 Extrapolation is a well-known technique for solving convex optimization and variational inequalities and recently attracts some attention for non-convex optimization. Several recent works have empirically shown its success in some machine learning tasks.
Jin, Rong +4 more
core +1 more source
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 +3 more
wiley +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
MathematicsThis 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 +2 more
doaj +1 more source
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 +2 more
doaj +1 more source
A hybrid method without extrapolation step for solving variational inequality problems
, 2014 In this paper, we introduce a new method for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space.
Malitsky, Yu. V., Semenov, V. V.
core +1 more source
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