A Globally Convergent Hybrid FR-PRP Conjugate Gradient Method for Unconstrained Optimization Problems

In this paper, a new conjugate gradient (CG) parameter is proposed through the convex combination of the Fletcher-Reeves (FR) and Polak-Ribiére-Polyak (PRP) CG update parameters such that the conjugacy condition of Dai-Liao is satisfied. The computational efficiency of the PRP method and the convergence profile of the FR method motivated the choice of these two CG methods. The corresponding CG algorithm satisfies the sufficient descent property and was shown to be globally convergent under the strong Wolfe line search procedure. Numerical tests on selected benchmark test functions show that the algorithm is efficient and very competitive in comparison with some existing classical methods.

A Modified Conjugate Gradient Method for Solving Large-Scale Nonlinear Equations

In this paper, we propose a modified Polak–Ribière–Polyak (PRP) conjugate gradient method for solving large-scale nonlinear equations. Under weaker conditions, we show that the proposed method is globally convergent. We also carry out some numerical experiments to test the proposed method. The results show that the proposed method is efficient and stable.

A derivative free globally convergent method and its deformations

The motive of the present work is to introduce and investigate the quadratically convergent Newton’s like method for solving the non-linear equations. We have studied some new properties of a Newton’s like method with examples and obtained a derivative-free globally convergent Newton’s like method using forward difference operator and bisection method. Finally, we have used various numerical test functions along with their fractal patterns to show the utility of the proposed method. These patterns support the numerical results and explain the compactness regarding the convergence, divergence and stability of the methods to different roots.

A triply cubic polynomials approach for globally convergent algorithm in coefficient inverse problems

In this paper, a triply cubic polynomials approach is proposed firstly for solving the globally convergent algorithm of coefficient inverse problems in three dimension. Using Taylor type expansion for three arguments to construct tripled cubic polynomials for the approximate solution as identifying coefficient function of parabolic initial-boundary problems, in which unknown coefficients appeared at nonlinear term. The presented computational approach is effective to execute in spatial 3D issues arising in real world. Further, the complete algorithm can be straightforwardly performed to lower or higher dimensions case

A triply cubic polynomials approach for globally convergent algorithm in coefficient inverse problems

In this paper, a triply cubic polynomials approach is proposed firstly for solving the globally convergent algorithm of coefficient inverse problems in three dimension. Using Taylor type expansion for three arguments to construct tripled cubic polynomials for the approximate solution as identifying coefficient function of parabolic initial-boundary problems, in which unknown coefficients appeared at nonlinear term. The presented computational approach is effective to execute in spatial 3D issues arising in real world. Further, the complete algorithm can be straightforwardly performed to lower or higher dimensions case