GLOBAL CONVERGENCE OF THE GENERAL THREE TERM CONJUGATE GRADIENT METHODS WITH THE RELAXED STRONG WOLFE LINE SEARCH

The global convergence of the general three term conjugate gradient methods with the relaxed strong Wolfe line search is proved.

A CLASSOF NONMONOTONE CONJUGATE GRADIENT METHODSFOR NONCONVEX FUNCTIONS

This paper discusses the global convergence of a class of nonmonotone conjugate gra- dient methods(NM methods) for nonconvex object functions.This class of methods includes the nonmonotone counterpart of modified Polak- Ribière method and modified Hestenes- Stiefel method as special cases

CONVERGENCE ANALYSIS ON A CLASS OF CONJUGATE GRADIENT METHODS WITHOUTSUFFICIENT DECREASE CONDITION

Recently, Gilbert and Nocedal([3]) investigated global convergence of conjugate gradient methods related to Polak-Ribiere formular, they restricted beta(k) to non-negative value. [5] discussed the same problem as that in [3] and relaxed beta(k) to be negative with the objective function being convex. This paper allows beta(k) to be selected in a wider range than [5]. Especially, the global convergence of the corresponding algorithm without sufficient decrease condition is proved.

An Adaptive Spectral Conjugate Gradient Method with Restart Strategy

As a generalization of the two-term conjugate gradient method(CGM),the spectral CGM is one of the effective methods for solving unconstrained optimization.In this paper,we enhance the JJSL conjugate parameter,initially proposed by Jiang et al.(Computational and Applied Mathematics,2021,40:174),through the utilization of a convex combination technique.And this improvement allows for an adaptive search direction by integrating a newly constructed spectral gradient-type restart strategy.Then,we develop a new spectral CGM by employing an inexact line search to determine the step size.With the application of the weak Wolfe line search,we establish the sufficient descent property of the proposed search direction.Moreover,under general assumptions,including the employment of the strong Wolfe line search for step size calculation,we demonstrate the global convergence of our new algorithm.Finally,the given unconstrained optimization test results show that the new algorithm is effective.

A modified three–term conjugate gradient method with sufficient descent property

A hybridization of the three–term conjugate gradient method proposed by Zhang et al. and the nonlinear conjugate gradient method proposed by Polak and Ribi`ere, and Polyak is suggested. Based on an eigenvalue analysis, it is shown that search directions of the proposed method satisfy the sufficient descent condition, independent of the line search and the objective function convexity. Global convergence of the method is established under an Armijo–type line search condition. Numerical experiments show practical efficiency of the proposed method.

High-efciency improved symmetric successive over-relaxation preconditioned conjugate gradient method for solving large-scale finite element linear equations

Fast solving large-scale linear equations in the finite element analysis is a classical subject in computational mechanics. It is a key technique in computer aided engineering （CAE） and computer aided manufacturing （CAM）. This paper presents a high-efficiency improved symmetric successive over-relaxation （ISSOR） preconditioned conjugate gradient （PCG） method, which maintains lelism consistent with the original form. Ideally, the by 50% as compared with the original algorithm. the convergence and inherent paralcomputation can It is suitable for be reduced nearly high-performance computing with its inherent basic high-efficiency operations. By comparing with the numerical results, it is shown that the proposed method has the best performance.

A New Nonlinear Conjugate Gradient Method for Unconstrained Optimization Problems

In this paper,an efficient conjugate gradient method is given to solve the general unconstrained optimization problems,which can guarantee the sufficient descent property and the global convergence with the strong Wolfe line search conditions.Numerical results show that the new method is efficient and stationary by comparing with PRP＋ method,so it can be widely used in scientific computation.

Global Convergence of a New Restarting Conjugate Gradient Method for Nonlinear Optimizations

Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.

Global Convergence of a New Restarting Three Terms Conjugate Gradient Method for Non-linear Optimizations

In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of FR method,a class of new restarting three terms conjugate gradient methods is presented.Global convergence properties of the new method with two kinds of common line searches are proved.

Subspace Minimization Conjugate Gradient Method Based on Cubic Regularization Model for Unconstrained Optimization

Many methods have been put forward to solve unconstrained optimization problems,among which conjugate gradient method(CG)is very important.With the increasing emergence of large⁃scale problems,the subspace technology has become particularly important and widely used in the field of optimization.In this study,a new CG method was put forward,which combined subspace technology and a cubic regularization model.Besides,a special scaled norm in a cubic regularization model was analyzed.Under certain conditions,some significant characteristics of the search direction were given and the convergence of the algorithm was built.Numerical comparisons show that for the 145 test functions under the CUTEr library,the proposed method is better than two classical CG methods and two new subspaces conjugate gradient methods.

Calculation method of sliding ratios for conjugate-curve gear pair and its application

The calculation method of sliding ratios for conjugate-curve gear pair, generated based on the theory of conjugate curves,is proposed. The theoretical model of conjugate-curve gear drive is briefly introduced. The general calculation formulas of sliding ratios are developed according to the conjugate curves. The applications to the circular arc gears based on conjugate curves and the novel involute-helix gears are studied. A comparison on the sliding coefficient with the conventional corresponding gear drive is also carried out. The influences of gear parameters such as spiral parameter, gear ratio and modulus on the sliding ratios of gear drive are discussed. Brief description of manufacturing method for conjugate-curve gear pair is given. The research results show that the sliding ratios of gear pair become smaller with the increase of spiral parameter and gear ratio, respectively. And it will be greater with the increase of modulus for the tooth profiles. The meshing characteristics of conjugate-curve gears are further reflected and the optimization design of tooth profiles with high performance may be obtained.

Streamline upwind finite element method for conjugate heat transfer problems

This paper presents a combined finite element method for solving conjugate heat transfer problems where heat conduction in a solid is coupled with heat convection in viscous fluid flow. The streamline upwind finite element method is used for the analysis of thermal viscous flow in the fluid region, whereas the analysis of heat conduction in solid region is performed by the Galerkin method. The method uses the three-node triangular element with equal-order interpolation functions for all the variables of the velocity components, the pressure and the temperature. The main advantage of the proposed method is to consistently couple heat transfer along the fluid-solid interface. Three test cases, i.e. conjugate Couette flow problem in parallel plate channel, counter-flow in heat exchanger, and conjugate natural convection in a square cavity with a conducting wall, are selected to evaluate the efficiency of the present method.

A New Conjugate Gradient Projection Method for Solving Stochastic Generalized Linear Complementarity Problems

In this paper, a class of the stochastic generalized linear complementarity problems with finitely many elements is proposed for the first time. Based on the Fischer-Burmeister function, a new conjugate gradient projection method is given for solving the stochastic generalized linear complementarity problems. The global convergence of the conjugate gradient projection method is proved and the related numerical results are also reported.

Preconditioned Iterative Methods for Algebraic Systems from Multiplicative Half-Quadratic Regularization Image Restorations

Image restoration is often solved by minimizing an energy function consisting of a data-fidelity term and a regularization term.A regularized convex term can usually preserve the image edges well in the restored image.In this paper,we consider a class of convex and edge-preserving regularization functions,i.e.,multiplicative half-quadratic regularizations,and we use the Newton method to solve the correspondingly reduced systems of nonlinear equations.At each Newton iterate,the preconditioned conjugate gradient method,incorporated with a constraint preconditioner,is employed to solve the structured Newton equation that has a symmetric positive definite coefficient matrix. The eigenvalue bounds of the preconditioned matrix are deliberately derived,which can be used to estimate the convergence speed of the preconditioned conjugate gradient method.We use experimental results to demonstrate that this new approach is efficient, and the effect of image restoration is reasonably well.

IMPROVED PRECONDITIONED CONJUGATE GRADIENT METHOD AND ITS APPLICATION IN F.E.A.FOR ENGINEERING

In this paper two theorems with theoretical and practical significance are given in respect to the preconditioned conjugate gradient method (PCCG). The theorems discuss respectively the qualitative property of the iterative solution and the construction principle of the iterative matrix. The authors put forward a new incompletely LU factorizing technique for non-M-matrix and the method of constructing the iterative matrix. This improved PCCG is used to calculate the ill-conditioned problems and large-scale three-dimensional finite element problems, and simultaneously contrasted with other methods. The abnormal phenomenon is analyzed when PCCG is used to solve the system of ill-conditioned equations, ft is shown that the method proposed in this paper is quite effective in solving the system of large-scale finite element equations and the system of ill-conditioned equations.

PRECONDITIONED METHODS FOR SPACE-TIME ADAPTIVE PROCESSING

This paper introduces the preconditioned methods for Space-Time Adaptive Processing(STAP).Using the Block-Toeplitz-Toeplitz-Block(BTTB)structure of the clutter-plus-noise covari-ance matrix,a Block-Circulant-Circulant-Block(BCCB)preconditioner is constructed.Based on thepreconditioner,a Preconditioned Multistage Wiener Filter(PMWF)which can be implemented by thePreconditioned Conjugate Gradient(PCG)method is proposed.Simulation results show that thePMWF has faster convergence rate and lower processing rank compared with the MWF.

The Conjugate Gradient Method in Random Variables

We study the conjugate gradient method for solving a system of linear equations with coefficients which are measurable functions and establish the rate of convergence of this method.

Full waveform inversion with spectral conjugategradient method

Spectral conjugate gradient method is an algorithm obtained by combination of spectral gradient method and conjugate gradient method,which is characterized with global convergence and simplicity of spectral gradient method,and small storage of conjugate gradient method.Besides,the spectral conjugate gradient method was proved that the search direction at each iteration is a descent direction of objective function even without relying on any line search method.Spectral conjugate gradient method is applied to full waveform inversion for numerical tests on Marmousi model.The authors give a comparison on numerical results obtained by steepest descent method,conjugate gradient method and spectral conjugate gradient method,which shows that the spectral conjugate gradient method is superior to the other two methods.

Accuracy and Efficiency: The Comparison of Different RPC Parameters Solving Methods

As a generalized sensor, the RPC model with its accuracy equally matches the physical sensor model. Moreover, the accurate positioning combining with the flexibility in application leads the RPC model to be the priority in photogrammetry processing. Generally, the RPC model is calculated through a control grid. Different RPC parameters solving methods and the operation efficiency all serve as variables in the accuracy of the model. In this paper, the ridge estimation iterative method, spectrum correction iteration, and conjugate gradient method are employed to solve RPC parameters;the accuracy and efficiency of three solving methods are analyzed and compared. The results show that ridge estimation iterative method and spectrum correction iteration have obvious advantages in accuracy. The ridge estimation iterative method has fewer iteration times and time con-sumption, and spectrum correction iteration has more stable precision.

基于改进神经网络PID算法的医用电子直线加速器温控系统研究

目的:探讨基于改进神经网络PID算法的医用电子直线加速器温控系统的实现。方法:针对医用电子直线加速器温度控制难题,提出了基于共轭梯度算法改进的BP神经网路PID控制算法,并在温度控制系统中进行了仿真。结果:该控制器能够实现较好控制效果。结论:利用共轭梯度算法改进的BP神经网路PID控制算法对医用电子直线加速器温度控制系统进行控制方法切实有效,简单可行。