CONVEX MINIMIZATION OVER THE SPLIT COMMON FIXED POINT PROBLEMS VIA A HYBRID STEEPEST-DESCENT METHOD
  • Arfat, Yasir
  • Cho, Yeol je
  • Kumam, Poom
  • Sitthithakerngkiet, Kanokwan
  • Khan, Muhammad aqeel ahmad
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

In this paper, we revisit the hybrid steepest-descent method for a convex minimization problem over the solution set of a split common fixed point problem. We develop this framework for the finite families of demimetric mappings in Hilbert spaces and validate the hybrid steepest-descent method via appropriate numerical examples.

키워드

Convex minimization problemHybrid steepest descent methodSplit common fixed point problemVariational inequalitySHRINKING PROJECTION METHODSET
제목
CONVEX MINIMIZATION OVER THE SPLIT COMMON FIXED POINT PROBLEMS VIA A HYBRID STEEPEST-DESCENT METHOD
저자
Arfat, YasirCho, Yeol jeKumam, PoomSitthithakerngkiet, KanokwanKhan, Muhammad aqeel ahmad
DOI
10.23952/jnfa.2024.33
발행일
2024
유형
Article
저널명
JOURNAL OF NONLINEAR FUNCTIONAL ANALYSIS
2024
33
페이지
1 ~ 14