اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLandweber-type operator and its properties
56
0
0.0
(
0
)
تأليف
Andrzej Cegielski
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Our aim is to present several properties of a Landweber operator and of a Landweber-type operator. These operators are widely used in methods for solving the split feasibility problem and the split common fixed point problem. The presented properties can be used in proofs of convergence of related algorithms.
قيم البحث
اقرأ أيضاً
The aim of this paper is to investigate the use of an entropic projection method for the iterative regularization of linear ill-posed problems. We derive a closed form solution for the iterates and analyze their convergence behaviour both in a case o
f reconstructing general nonnegative unknowns as well as for the sake of recovering probability distributions. Moreover, we discuss several variants of the algorithm and relations to other methods in the literature. The effectiveness of the approach is studied numerically in several examples.
We consider the split convex feasibility problem in a fixed point setting. Motivated by the well-known CQ-method of Byrne (2002), we define an abstract andweber transform which applies to more general operators than the metric projection. We call the
result of this transform a Landweber operator. It turns out that the Landweber transform preserves many interesting properties. For example, the Landweber transform of a (quasi/firmly) nonexpansive mapping is again (quasi/firmly) nonexpansive. Moreover, the Landweber transform of a (weakly/linearly) regular mapping is again (weakly/linearly) regular. The preservation of regularity is important because it leads to (weak/linear) convergence of many CQ-type methods.
Monotone operator splitting is a powerful paradigm that facilitates parallel processing for optimization problems where the cost function can be split into two convex functions. We propose a generalized form of monotone operator splitting based on Br
egman divergence. We show that an appropriate design of the Bregman divergence leads to faster convergence than conventional splitting algorithms. The proposed Bregman monotone operator splitting (B-MOS) is applied to an application to illustrate its effectiveness. B-MOS was found to significantly improve the convergence rate.
We improve the existing Ando-Hiai inequalities for operator means and present new ones for operator perspectives in several ways. We also provide the operator perspective version of the Lie-Trotter formula and consider the extension problem of operat
or perspectives to non-invertible positive operators.
Matrix scaling is a classical problem with a wide range of applications. It is known that the Sinkhorn algorithm for matrix scaling is interpreted as alternating e-projections from the viewpoint of classical information geometry. Recently, a generali
zation of matrix scaling to completely positive maps called operator scaling has been found to appear in various fields of mathematics and computer science, and the Sinkhorn algorithm has been extended to operator scaling. In this study, the operator Sinkhorn algorithm is studied from the viewpoint of quantum information geometry through the Choi representation of completely positive maps. The operator Sinkhorn algorithm is shown to coincide with alternating e-projections with respect to the symmetric logarithmic derivative metric, which is a Riemannian metric on the space of quantum states relevant to quantum estimation theory. Other types of alternating e-projections algorithms are also provided by using different information geometric structures on the positive definite cone.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
