DYNAMIC STRING-AVERAGING PROJECTION METHODS FOR CONVEX FEASIBILITY PROBLEMS IN THE PRESENCE OF COMPUTATIONAL ERRORS

被引：1

作者：

Zaslavski, Alexander J. ^{[1
]}

机构：

[1] Technion Israel Inst Technol, Dept Math, IL-32000 Haifa, Israel

来源：

JOURNAL OF NONLINEAR AND CONVEX ANALYSIS | 2014年 / 15卷 / 03期

关键词：

Approximate solution; feasibility problem; Hilbert space; string-averaging projection algorithm; CONVERGENCE; ALGORITHMS; PRODUCTS; HILBERT;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In the present paper we study convergence of dynamic string-averaging projection methods for solving convex feasibility problems in a Hilbert space. Our goal is to obtain an approximate solution of the problem in the presence of computational errors. We show that our dynamic string-averaging projection algorithm generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant.

引用

页码：623 / 636

页数：14

共 37 条

[21] Hilbertian convex feasibility problem: Convergence of projection methods
Combettes P.L.
Applied Mathematics and Optimization, 1997, 35 (3): : 311 - 330
[22] Stochastic block projection algorithms with extrapolation for convex feasibility problems
Necoara, I
OPTIMIZATION METHODS & SOFTWARE, 2022, 37 (05): : 1845 - 1875
[23] DESCENT METHODS FOR NONCONVEX PROBLEMS WITH COMPUTATIONAL ERRORS
Reich, Simeon
Zaslavski, Alexander J.
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2020, 21 (05) : 1035 - 1045
[24] Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
Tian, Ming
Huang, Li-Hua
JOURNAL OF INEQUALITIES AND APPLICATIONS, 2013,
[25] A LEARNING-ENHANCED PROJECTION METHOD FOR SOLVING CONVEX FEASIBILITY PROBLEMS
Rieger, Janosch
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS-SERIES B, 2022, 27 (01): : 555 - 568
[26] QUASI-SUBGRADIENT METHODS WITH BREGMAN DISTANCE FOR QUASI-CONVEX FEASIBILITY PROBLEMS
Hu, Yaohua
Li, Jingchao
Liu, Yanyan
Yu, Carisa Kwok Wai
JOURNAL OF NONLINEAR AND VARIATIONAL ANALYSIS, 2024, 8 (03): : 381 - 395
[27] 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
[28] Quasi-convex feasibility problems: Subgradient methods and convergence rates
Hu, Yaohua
Li, Gongnong
Yu, Carisa Kwok Wai
Yip, Tsz Leung
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 298 (01) : 45 - 58
[29] Three shrinking projection methods with multiple inertial effects for solving a class of split feasibility problems
Reich, Simeon
Tuyen, Truong Minh
JOURNAL OF FIXED POINT THEORY AND APPLICATIONS, 2024, 26 (04)
[30] The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
Zaslavski, Alexander J.
NUMERICAL ALGORITHMS, 2022, 91 (03) : 1427 - 1439

← 1 2 3 4 →