A Modified Scaled Spectral-Conjugate Gradient-Based Algorithm for Solving Monotone Operator Equations

This paper proposes a modified scaled spectral-conjugate-based algorithm for finding solutions to monotone operator equations. The algorithm is a modification of the work of Li and Zheng in the sense that the uniformly monotone assumption on the operator is relaxed to just monotone. Furthermore, unlike the work of Li and Zheng, the search directions of the proposed algorithm are shown to be descent and bounded independent of the monotonicity assumption. Moreover, the global convergence is established under some appropriate assumptions. Finally, numerical examples on some test problems are provided to show the efficiency of the proposed algorithm compared to that of Li and Zheng.

A new smoothing spectral conjugate gradient method for solving tensor complementarity problems

<p style='text-indent:20px;'>In recent years, the tensor complementarity problem has attracted widespread attention and has been extensively studied. The research work of tensor complementarity problem mainly focused on theory, solution methods and applications. In this paper, we study the solution method of tensor complementarity problem. Based on the equivalence relation of the tensor complementarity problem and unconstrained optimization problem, we propose a new smoothing spectral conjugate gradient method with Armijo line search. Under mild conditions, we establish the global convergence of the proposed method. Finally, some numerical results are given to show the effectiveness of the proposed method and verify our theoretical results.</p>

A fast spectral conjugate gradient method for solving nonlinear optimization problems

<span>This paper proposes a new spectral conjugate gradient (SCG) approach for solving unregulated nonlinear optimization problems. Our approach proposes Using Wolfe's rapid line scan to adjust the standard conjugate descent (CD) algorithm. A new spectral parameter is a mixture of new gradient and old search path. The path provided by the modified method provides a path of descent for the solution of objective functions. The updated method fits the traditional CD method if the line check is correct. The stability and global convergence properties of the current new SCG are technically obtained from applying certain well-known and recent mild assumptions. We test our approach with eight recently published CD and SCG methods on 55 optimization research issues from the CUTE library. The suggested and all other algorithms included in our experimental research were implemented in FORTRAN language with double precision arithmetic and all experiments were conducted on a PC with 8 GB ram Processor Intel Core i7. The results indicate that our proposed solution outperforms recently reported algorithms by processing and performing fewer iterations in a shorter time.</span>