Combining the projection method of Solodov and Svaiter with the Liu-Storey and Fletcher Reeves conjugate gradient algorithm of Djordjević for unconstrained minimization problems, a hybrid conjugate gradient algorithm is proposed and extended to solve convex constrained nonlinear monotone equations. Under some suitable conditions, the global convergence result of the proposed method is established. Furthermore, the proposed method is applied to solve the 𝓁 1 -norm regularized problems to restore sparse signal and image in compressive sensing. Numerical comparisons of the proposed algorithm versus some other conjugate gradient algorithms on a set of benchmark test problems, sparse signal reconstruction and image restoration in compressive sensing show that the proposed scheme is computationally more efficient and robust than the compared schemes.
The relaxed inertial Tseng-type method for solving the inclusion problem involving a maximally monotone mapping and a monotone mapping is proposed in this article. The study modifies the Tseng forward-backward forward splitting method by using both the relaxation parameter, as well as the inertial extrapolation step. The proposed method follows from time explicit discretization of a dynamical system. A weak convergence of the iterates generated by the method involving monotone operators is given. Moreover, the iterative scheme uses a variable step size, which does not depend on the Lipschitz constant of the underlying operator given by a simple updating rule. Furthermore, the proposed algorithm is modified and used to derive a scheme for solving a split feasibility problem. The proposed schemes are used in solving the image deblurring problem to illustrate the applicability of the proposed methods in comparison with the existing state-of-the-art methods.
Two inertial subgradient extragradient algorithms for solving variational inequality problems involving pseudomonotone operator are proposed in this article. The iterative schemes use self-adaptive step sizes which do not require the prior knowledge of the Lipschitz constant of the underlying operator. Furthermore, under mild assumptions, we show the weak and strong convergence of the sequences generated by the proposed algorithms. The strong convergence in the second algorithm follows from the use of viscosity method. Numerical experiments both in finite- and infinite-dimensional spaces are reported to illustrate the inertial effect and the computational performance of the proposed algorithms in comparison with the existing state of the art algorithms.
A derivative-free conjugate gradient algorithm for solving nonlinear equations and image restoration is proposed. The conjugate gradient (CG) parameter of the proposed algorithm is a convex combination of Hestenes-Stiefel (HS) and Dai-Yuan (DY) type CG parameters. The search direction is descent and bounded. Under suitable assumptions, the convergence of the proposed hybrid algorithm is obtained. Using some benchmark test problems, the proposed algorithm is shown to be efficient compared with existing algorithms. In addition, the proposed algorithm is effectively applied to solve image restoration problems.
In this paper, a derivative-free conjugate gradient method for solving nonlinear equations with convex constraints is proposed. The proposed method can be viewed as an extension of the three-term modified Polak-Ribiére-Polyak method (TTPRP) and the three-term Hestenes-Stiefel conjugate gradient method (TTHS) using the projection technique of Solodov and Svaiter [Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, 1998, 355-369]. The proposed method adopts the adaptive line search scheme proposed by Ou and Li [Journal of Applied Mathematics and Computing 56.1-2 (2018): 195-216] which reduces the computational cost of the method. Under the assumption that the underlying operator is Lipschitz continuous and satisfies a weaker condition of monotonicity, the global convergence of the proposed method is established. Furthermore, the proposed method is extended to solve image restoration problem arising in compressive sensing. Numerical results are presented to demonstrate the effectiveness of the proposed method.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.