SearcharxivSearch

arXiv subjects

Fuying Cui

Publications and source records attributed to Fuying Cui.

3 recordsLinked to original sources

Convergence analysis of an inexact inertial Krasnoselskii-Mann algorithm with applications

The classical Krasnoselskii-Mann iteration is broadly used for approximating fixed points of nonexpansive operators. To accelerate the convergence of the Krasnoselskii-Mann iteration, the inertial methods were received much attention in recent years. In this paper, we propose an inexact inertial Krasnoselskii-Mann algorithm. In comparison with the original inertial Krasnoselskii-Mann algorithm, our algorithm allows error for updating the iterative sequence, which makes it more flexible and useful in practice. We establish weak convergence results for the proposed algorithm under different conditions on parameters and error terms. Furthermore, we provide a nonasymptotic convergence rate for the proposed algorithm. As applications, we propose and study inexact inertial proximal point algorithm and inexact inertial forward-backward splitting algorithm for solving monotone inclusion problems and the corresponding convex minimization problems.

math.FA

An inertial three-operator splitting algorithm with applications to image inpainting

The three-operators splitting algorithm is a popular operator splitting method for finding the zeros of the sum of three maximally monotone operators, with one of which is cocoercive operator. In this paper, we propose a class of inertial three-operator splitting algorithm. The convergence of the proposed algorithm is proved by applying the inertial Krasnoselskii-Mann iteration under certain conditions on the iterative parameters in real Hilbert spaces. As applications, we develop an inertial three-operator splitting algorithm to solve the convex minimization problem of the sum of three convex functions, where one of them is differentiable with Lipschitz continuous gradient. Finally, we conduct numerical experiments on a constrained image inpainting problem with nuclear norm regularization. Numerical results demonstrate the advantage of the proposed inertial three-operator splitting algorithms.

math.OC

Convergence analysis of a variable metric forward-backward splitting algorithm with applications

The forward-backward splitting algorithm is a popular operator-splitting method for solving monotone inclusion of the sum of a maximal monotone operator and a cocoercive operator. In this paper, we present a new convergence analysis of a variable metric forward-backward splitting algorithm with extended relaxation parameters in real Hilbert spaces. We prove that this algorithm is weakly convergent when certain weak conditions are imposed upon the relaxation parameters. Consequently, we recover the forward-backward splitting algorithm with variable step sizes. As an application, we obtain a variable metric forward-backward splitting algorithm for solving the minimization problem of the sum of two convex functions, where one of them is differentiable with a Lipschitz continuous gradient. Furthermore, we discuss the applications of this algorithm to the fundamental of the variational inequalities problem, constrained convex minimization problem, and split feasibility problem. Numerical experimental results on LASSO problem in statistical learning demonstrate the effectiveness of the proposed iterative algorithm.

math.FA