AN INERTIAL TSENG SUBGRADIENT PROJECTION METHOD FOR SOLVING SPLIT FEASIBILITY PROBLEMS IN NON-CONVEX SETTING

被引：0

作者：

Chen, Jinzuo ^{[1
]}

Liou, Yeong-Cheng ^{[2
,3
,4
]}

Yin, Tzu-Chien ^{[5
]}

机构：

[1] Lingnan Normal Univ, Sch Math & Stat, Zhanjiang, Peoples R China

[2] Kaohsiung Med Univ, Dept Healthcare Adm & Med Informat, Kaohsiung 807, Taiwan

[3] Kaohsiung Med Univ, Res Ctr Nonlinear Anal & Optimizat, Kaohsiung 807, Taiwan

[4] Kaohsiung Med Univ Hosp, Dept Med Res, Kaohsiung 807, Taiwan

[5] China Med Univ, China Med Univ Hosp, Res Ctr Interneural Comp, Taichung 40402, Taiwan

来源：

JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2024年 / 25卷 / 01期

关键词：

Nonconvex split feasibility problems; S-subdifferentiable; S-subgradient projection; Armijo-type line rule; inertial technique; APPROXIMATING SOLUTIONS; CQ ALGORITHM;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this work, we introduce an inertial Tseng subgradient projection method for solving split feasibility problems in finite dimensional spaces. The main advantages of this paper are that the introduced step -size is chosen according to Armijo-type line rule, the construction of iterative algorithm involves inertial technique and the underlying sets are non-convex.

引用

页码：181 / 189

页数：9

共 50 条

[41] A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem
Dang, Yazheng
Gao, Yan
APPLICATIONS OF MATHEMATICS, 2014, 59 (01) : 37 - 51
[42] A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem
Yazheng Dang
Yan Gao
Applications of Mathematics, 2014, 59 : 37 - 51
[43] Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
Necoara, Ion
Nedic, Angelia
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2021, 80 (01) : 121 - 152
[44] A viscosity method for solving convex feasibility problems
Zhang, Yunpeng
Li, Yanling
JOURNAL OF NONLINEAR SCIENCES AND APPLICATIONS, 2016, 9 (02): : 641 - 651
[45] A SUBGRADIENT METHOD BASED ON GRADIENT SAMPLING FOR SOLVING CONVEX OPTIMIZATION PROBLEMS
Hu, Yaohua
Sim, Chee-Khian
Yang, Xiaoqi
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2015, 36 (12) : 1559 - 1584
[46] AN EFFICIENT METHOD FOR NON-CONVEX QCQP PROBLEMS
Osmanpour, Naser
Keyanpour, Mohammad
PACIFIC JOURNAL OF OPTIMIZATION, 2021, 17 (01): : 23 - 45
[47] A Stochastic Subgradient Method for Distributionally Robust Non-convex and Non-smooth Learning
Mert Gürbüzbalaban
Andrzej Ruszczyński
Landi Zhu
Journal of Optimization Theory and Applications, 2022, 194 : 1014 - 1041
[48] A Stochastic Subgradient Method for Distributionally Robust Non-convex and Non-smooth Learning
Gurbuzbalaban, Mert
Ruszczynski, Andrzej
Zhu, Landi
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2022, 194 (03) : 1014 - 1041
[49] Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces
Mebawondu, A. A.
Jolaoso, L. O.
Abass, H. A.
Narain, O. K.
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS, 2022, 15 (06)
[50] RELAXED DOUBLE INERTIAL TSENG'S EXTRAGRADIENT METHOD FOR SOLVING NON-LIPSCHITZ SPLIT MONOTONE VARIATIONAL INCLUSION PROBLEMS WITH FIXED POINT CONSTRAINTS
Mewomo, Oluwatosin Temitope
Godwin, Emeka Chigaemezu
Alakoya, Timilehin Opeyemi
JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (04) : 1318 - 1350

← 1 2 3 4 5 →