Search

In this work, two inertial algorithms for approximating common elements of the sets of solutions of three important problems are constructed. The first problem is a generalized mixed equilibrium one involving relaxed monotone mapping, the second is a zero problem of inverse strongly monotone mappings, while the third one is a fixed point problem of a family of relatively nonexpansive mappings. The first algorithm is a shrinking projection type for a common solution of all the three problems. The second is a generalized Alber projection free method for the second and the third problems. Each of the devised algorithms uses the conjugate gradient-like direction, which allows it to accelerate its iterates toward a solution of the problems. The strong convergence theorem for each of the algorithms is formulated and proved in a real 2 - uniformly convex and uniformly smooth Banach space. Additionally, the applications of our algorithms to convex optimization problems and image recovery problems are studied. The advantages and computational efficiency of our methods are analyzed based on their numerical performance in comparison to some of the existing and recently proposed methods using numerical example. [ABSTRACT FROM AUTHOR]

Many real-world phenomena in engineering, economics, statistical inference, compressed sensing and machine learning involve finding sparse solutions to under-determined or ill-conditioned equations. Our interest in this paper is to introduce a derivative-free method for recovering sparse signal and blurred image arising in compressed sensing by solving a nonlinear equation involving a monotone operator. The global convergence of the proposed method is established under the assumptions of monotonicity and Lipschitz continuity of the underlying operator. Numerical experiments are performed to illustrate the efficiency of the proposed method in the reconstruction of sparse signals and blurred images. [ABSTRACT FROM AUTHOR]

Variational inclusion is an important general problem consisting of many useful problems like variational inequality, minimization problem and nonlinear monotone equations. In this article, a new scheme for solving variational inclusion problem is proposed and the scheme uses inertial and relaxation techniques. Moreover, the scheme is self adaptive, that is, the stepsize does not depend on the factorial constants of the underlying operator, instead it can be computed using a simple updating rule. Weak convergence analysis of the iterates generated by the new scheme is presented under mild conditions. In addition, schemes for solving variational inequality problem and split feasibility problem are derived from the proposed scheme and applied in solving Nash-Cournot equilibrium problem and image restoration. Experiments to illustrate the implementation and potential applicability of the proposed schemes in comparison with some existing schemes in the literature are presented. [ABSTRACT FROM AUTHOR]