Spectral CG Algorithm for Solving Fuzzy Nonlinear Equations

The nonlinear conjugate gradient method is an effective technique for solving large-scale minimizations problems, and has a wide range of applications in various fields, such as mathematics, chemistry, physics, engineering and medicine. This study presents a novel spectral conjugate gradient algorithm (non-linear conjugate gradient algorithm), which is derived based on the Hisham–Khalil (KH) and Newton algorithms. Based on pure conjugacy condition The importance of this research lies in finding an appropriate method to solve all types of linear and non-linear fuzzy equations because the Buckley and Qu method is ineffective in solving fuzzy equations. Moreover, the conjugate gradient method does not need a Hessian matrix (second partial derivatives of functions) in the solution. The descent property of the proposed method is shown provided that the step size at meets the strong Wolfe conditions. In numerous circumstances, numerical results demonstrate that the proposed technique is more efficient than the Fletcher–Reeves and KH algorithms in solving fuzzy nonlinear equations.

Two efficient modifications of AZPRP conjugate gradient method with sufficient descent property

The conjugate gradient method can be applied in many fields, such as neural networks, image restoration, machine learning, deep learning, and many others. Polak–Ribiere–Polyak and Hestenses–Stiefel conjugate gradient methods are considered as the most efficient methods to solve nonlinear optimization problems. However, both methods cannot satisfy the descent property or global convergence property for general nonlinear functions. In this paper, we present two new modifications of the PRP method with restart conditions. The proposed conjugate gradient methods satisfy the global convergence property and descent property for general nonlinear functions. The numerical results show that the new modifications are more efficient than recent CG methods in terms of number of iterations, number of function evaluations, number of gradient evaluations, and CPU time.

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.

3D Convolution Conjugate Gradient Inversion of Potential Fields in Acoculco Geothermal Prospect, Mexico

Potential field data have long been used in geophysical exploration for archeological, mineral, and reservoir targets. For all these targets, the increased search of highly detailed three-dimensional subsurface volumes has also promoted the recollection of high-density contrast data sets. While there are several approaches to handle these large-scale inverse problems, most of them rely on either the extensive use of high-performance computing architectures or data-model compression strategies that may sacrifice some level of model resolution. We posit that the superposition and convolutional properties of the potential fields can be easily used to compress the information needed for data inversion and also to reduce significantly redundant mathematical computations. For this, we developed a convolution-based conjugate gradient 3D inversion algorithm for the most common types of potential field data. We demonstrate the performance of the algorithm using a resolution test and a synthetic experiment. We then apply our algorithm to gravity and magnetic data for a geothermal prospect in the Acoculco caldera in Mexico. The resulting three-dimensional model meaningfully determined the distribution of the existent volcanic infill in the caldera as well as the interrelation of various intrusions in the basement of the area. We propose that these intrusive bodies play an important role either as a low-permeability host of the heated fluid or as the heat source for the potential development of an enhanced geothermal system.

A Class of Three-Dimensional Subspace Conjugate Gradient Algorithms for Unconstrained Optimization

In this paper, a three-parameter subspace conjugate gradient method is proposed for solving large-scale unconstrained optimization problems. By minimizing the quadratic approximate model of the objective function on a new special three-dimensional subspace, the embedded parameters are determined and the corresponding algorithm is obtained. The global convergence result of a given method for general nonlinear functions is established under mild assumptions. In numerical experiments, the proposed algorithm is compared with SMCG_NLS and SMCG_Conic, which shows that the given algorithm is robust and efficient.

On three-term conjugate gradient method for optimization problems with applications on COVID-19 model and robotic motion control

The three-term conjugate gradient (CG) algorithms are among the efficient variants of CG algorithms for solving optimization models. This is due to their simplicity and low memory requirements. On the other hand, the regression model is one of the statistical relationship models whose solution is obtained using one of the least square methods including the CG-like method. In this paper, we present a modification of a three-term conjugate gradient method for unconstrained optimization models and further establish the global convergence under inexact line search. The proposed method was extended to formulate a regression model for the novel coronavirus (COVID-19). The study considers the globally infected cases from January to October 2020 in parameterizing the model. Preliminary results have shown that the proposed method is promising and produces efficient regression model for COVID-19 pandemic. Also, the method was extended to solve a motion control problem involving a two-joint planar robot.

Self-organizing Maps and Bayesian Regularized Neural Network for Analyzing Gasoline and Diesel Price Drifts

Any nation’s growth depends on the trend of the price of fuel. The fuel price drifts have both direct and indirect impacts on a nation’s economy. Nation’s growth will be hampered due to the higher level of inflation prevailing in the oil industry. This paper proposed a method of analyzing Gasoline and Diesel Price Drifts based on Self-organizing Maps and Bayesian regularized neural networks. The US gasoline and diesel price timeline dataset is used to validate the proposed approach. In the dataset, all grades, regular, medium, and premium with conventional, reformulated, all formulation of gasoline combinations, and diesel pricing per gallon weekly from 1995 to January 2021, are considered. For the data visualization purpose, we have used self-organizing maps and analyzed them with a neural network algorithm. The nonlinear autoregressive neural network is adopted because of the time series dataset. Three training algorithms are adopted to train the neural networks: Levenberg-Marquard, scaled conjugate gradient, and Bayesian regularization. The results are hopeful and reveal the robustness of the proposed model. In the proposed approach, we have found Levenberg-Marquard error falls from − 0.1074 to 0.1424, scaled conjugate gradient error falls from − 0.1476 to 0.1618, and similarly, Bayesian regularization error falls in − 0.09854 to 0.09871, which showed that out of the three approaches considered, the Bayesian regularization gives better results.

Conjugate gradient algorithm for consistent generalized Sylvester-transpose matrix equations

<abstract><p>We develop an effective algorithm to find a well-approximate solution of a generalized Sylvester-transpose matrix equation where all coefficient matrices and an unknown matrix are rectangular. The algorithm aims to construct a finite sequence of approximated solutions from any given initial matrix. It turns out that the associated residual matrices are orthogonal, and thus, the desire solution comes out in the final step with a satisfactory error. We provide numerical experiments to show the capability and performance of the algorithm.</p></abstract>