Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userRegular Sequences of Quasi-Nonexpansive Operators and Their Applications
130
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we present a systematic study of regular sequences of quasi-nonexpansive operators in Hilbert space. We are interested, in particular, in weakly, boundedly and linearly regular sequences of operators. We show that the type of the regularity is preserved under relaxations, convex combinations and products of operators. Moreover, in this connection, we show that weak, bounded and linear regularity lead to weak, strong and linear convergence, respectively, of various iterative methods. This applies, in particular, to block iterative and string averaging projection methods, which, in principle, are based on the above-mentioned algebraic operations applied to projections. Finally, we show an application of regular sequences of operators to variational inequality problems.
rate research
Read More
In this note, we study the nonexpansive properties based on arbitrary variable metric and explore the connections between firm nonexpansiveness, cocoerciveness and averagedness. A convergence rate analysis for the associated fixed-point iterations is presented by developing the global ergodic and non-ergodic iteration-complexity bounds in terms of metric distances. The obtained results are finally exemplified with the metric resolvent, which provides a unified framework for many existing first-order operator splitting algorithms.
We estimate convergence rates for fixed-point iterations of a class of nonlinear operators which are partially motivated from solving convex optimization problems. We introduce the notion of the generalized averaged nonexpansive (GAN) operator with a positive exponent, and provide a convergence rate analysis of the fixed-point iteration of the GAN operator. The proposed generalized averaged nonexpansiveness is weaker than the averaged nonexpansiveness while stronger than nonexpansiveness. We show that the fixed-point iteration of a GAN operator with a positive exponent converges to its fixed-point and estimate the local convergence rate (the convergence rate in terms of the distance between consecutive iterates) according to the range of the exponent. We prove that the fixed-point iteration of a GAN operator with a positive exponent strictly smaller than 1 can achieve an exponential global convergence rate (the convergence rate in terms of the distance between an iterate and the solution). Furthermore, we establish the global convergence rate of the fixed-point iteration of a GAN operator, depending on both the exponent of generalized averaged nonexpansiveness and the exponent of the H$ddot{text{o}}$lder regularity, if the GAN operator is also H$ddot{text{o}}$lder regular. We then apply the established theory to three types of convex optimization problems that appear often in data science to design fixed-point iterative algorithms for solving these optimization problems and to analyze their convergence properties.
In a quantum system with d-dimensional Hilbert space, the Q-function of a Hermitian positive semidefinite operator ?, is defined in terms of the d2 coherent states in this system. The Choquet integral CQ of the Q-function, is introduced using a ranking of the values of the Q-function, and Mobius transforms which remove the overlaps between coherent states. It is a figure of merit of the quantum properties of Hermitian operators, and it provides upper and lower bounds to various physical quantities in terms of the Q-function. Comonotonicity is an important concept in the formalism, which is used to formalize the vague concept of physically similar operators. Comonotonic operators are shown to be bounded, with respect to an order based on Choquet integrals. Applications of the formalism to the study of the ground state of a physical system, are discussed. Bounds for partition functions, are also derived.
This paper is concerned with the variational inequality problem (VIP) over the fixed point set of a quasi-nonexpansive operator. We propose, in particular, an algorithm which entails, at each step, projecting onto a suitably chosen half-space, and prove that the sequences it generates converge to the unique solution of the VIP. We also present an application of our result to a hierarchical optimization problem.
Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular sequence. We consider then the following problem: describe the subsets n powersums forming a regular sequence. A necessary condition is that n! divides the product of the degrees of the elements. To find an easily verifiable sufficient condition turns out to be surprisingly difficult already in 3 variables. Given positive integers a<b<c with GCD(a,b,c)=1, we conjecture that p_a, p_b, p_c is a regular sequence for n=3 if and only if 6 divides abc. We provide evidence for the conjecture by proving it in several special instances.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
