A New Two-Parameter Family of Nonlinear Conjugate Gradient Method Without Line Search for Unconstrained Optimization Problem

This paper puts forward a two-parameter family of nonlinear conjugate gradient(CG)method without line search for solving unconstrained optimization problem.The main feature of this method is that it does not rely on any line search and only requires a simple step size formula to always generate a sufficient descent direction.Under certain assumptions,the proposed method is proved to possess global convergence.Finally,our method is compared with other potential methods.A large number of numerical experiments show that our method is more competitive and effective.

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.

Almost Sure Convergence of Proximal Stochastic Accelerated Gradient Methods

Proximal gradient descent and its accelerated version are resultful methods for solving the sum of smooth and non-smooth problems. When the smooth function can be represented as a sum of multiple functions, the stochastic proximal gradient method performs well. However, research on its accelerated version remains unclear. This paper proposes a proximal stochastic accelerated gradient (PSAG) method to address problems involving a combination of smooth and non-smooth components, where the smooth part corresponds to the average of multiple block sums. Simultaneously, most of convergence analyses hold in expectation. To this end, under some mind conditions, we present an almost sure convergence of unbiased gradient estimation in the non-smooth setting. Moreover, we establish that the minimum of the squared gradient mapping norm arbitrarily converges to zero with probability one.

Gradient Recovery Based Two-Grid Finite Element Method for Parabolic Integro-Differential Optimal Control Problems

In this paper, the optimal control problem of parabolic integro-differential equations is solved by gradient recovery based two-grid finite element method. Piecewise linear functions are used to approximate state and co-state variables, and piecewise constant function is used to approximate control variables. Generally, the optimal conditions for the problem are solved iteratively until the control variable reaches error tolerance. In order to calculate all the variables individually and parallelly, we introduce a gradient recovery based two-grid method. First, we solve the small scaled optimal control problem on coarse grids. Next, we use the gradient recovery technique to recover the gradients of state and co-state variables. Finally, using the recovered variables, we solve the large scaled optimal control problem for all variables independently. Moreover, we estimate priori error for the proposed scheme, and use an example to validate the theoretical results.

One-step green method to prepare progressive burning gun propellant through gradient denitration strategy

Gradiently denitrated gun propellant(GDGP)prepared by a“gradient denitration”strategy is obviously superior in progressive burning performance to the traditional deterred gun propellant.Currently,the preparation of GDGP employed a tedious two-step method involving organic solvents,which hinders the large-scale preparation of GDGP.In this paper,GDGP was successfully prepared via a novelty and environmentally friendly one-step method.The obtained samples were characterized by FT-IR,Raman,SEM and XPS.The results showed that the content of nitrate groups gradiently increased from the surface to the core in the surface layer of GDGP and the surface layer of GDGP exhibited a higher compaction than that of raw gun propellant,with a well-preserved nitrocellulose structure.The denitration process enabled the propellant surface with regressive energy density and good progressive burning performance,as confirmed by oxygen bomb and closed bomb test.At the same time,the effects of different solvents on the component loss of propellant were compared.The result showed that water caused the least component loss.Finally,the stability of GDGP was confirmed by methyl-violet test.This work not only provided environmentally friendly,simple and economic preparation of GDGP,but also confirmed the stability of GDGP prepared by this method.

A Methodology to Reduce Thermal Gradients Due to the Exothermic Reactions in Resin Transfer Molding Applications

Resin transfer molding(RTM)is among the most used manufacturing processes for composite parts.Initially,the resin cure is initiated by heat supply to the mold.The supplementary heat generated during the reaction can cause thermal gradients in the composite,potentially leading to undesired residual stresses which can cause shrinkage and warpage.In the present numerical study of these processes,a one-dimensional finite difference method is used to predict the temperature evolution and the degree of cure in the course of the resin polymerization;the effect of some parameters on the thermal gradient is then analyzed,namely:the fiber nature,the use of multiple layers of reinforcement with different thermal properties and also the temperature cycle variation.The validity of this numerical model is tested by comparison with experimental and numerical results in the existing literature.

On the spreading behavior of a droplet on a circular cylinder using the lattice Boltzmann method

The study of a droplet spreading on a circular cylinder under gravity was carried out using the pseudo-potential lattice Boltzmann high-density ratios multiphase model with a non-ideal Peng–Robinson equation of state. The calculation results indicate that the motion of the droplet on the cylinder can be divided into three stages: spreading, sliding, and aggregating.The contact length and contact time of a droplet on a cylindrical surface can be affected by factors such as the wettability gradient of the cylindrical wall, the Bond number, and droplet size. Furthermore, phase diagrams showing the relationship between Bond number, cylinder wall wettability gradient, and contact time as well as maximum contact length for three different droplet sizes are given. A theoretical foundation for additional research into the heat and mass transfer process between the droplet and the cylinder can be established by comprehending the variable rules of maximum contact length and contact time.

Data-driven methods for predicting the representative temperature of bridge cable based on limited measured data

Cable-stayed bridges have been widely used in high-speed railway infrastructure.The accurate determination of cable’s representative temperatures is vital during the intricate processes of design,construction,and maintenance of cable-stayed bridges.However,the representative temperatures of stayed cables are not specified in the existing design codes.To address this issue,this study investigates the distribution of the cable temperature and determinates its representative temperature.First,an experimental investigation,spanning over a period of one year,was carried out near the bridge site to obtain the temperature data.According to the statistical analysis of the measured data,it reveals that the temperature distribution is generally uniform along the cable cross-section without significant temperature gradient.Then,based on the limited data,the Monte Carlo,the gradient boosted regression trees(GBRT),and univariate linear regression(ULR)methods are employed to predict the cable’s representative temperature throughout the service life.These methods effectively overcome the limitations of insufficient monitoring data and accurately predict the representative temperature of the cables.However,each method has its own advantages and limitations in terms of applicability and accuracy.A comprehensive evaluation of the performance of these methods is conducted,and practical recommendations are provided for their application.The proposed methods and representative temperatures provide a good basis for the operation and maintenance of in-service long-span cable-stayed bridges.

An empirical method for joint inversion of wave and wind parameters based on SAR and wave spectrometer data

Synthetic aperture radar(SAR)and wave spectrometers,crucial in microwave remote sensing,play an essential role in monitoring sea surface wind and wave conditions.However,they face inherent limitations in observing sea surface phenomena.SAR systems,for instance,are hindered by an azimuth cut-off phenomenon in sea surface wind field observation.Wave spectrometers,while unaffected by the azimuth cutoff phenomenon,struggle with low azimuth resolution,impacting the capture of detailed wave and wind field data.This study utilizes SAR and surface wave investigation and monitoring(SWIM)data to initially extract key feature parameters,which are then prioritized using the extreme gradient boosting(XGBoost)algorithm.The research further addresses feature collinearity through a combined analysis of feature importance and correlation,leading to the development of an inversion model for wave and wind parameters based on XGBoost.A comparative analysis of this model with ERA5 reanalysis and buoy data for of significant wave height,mean wave period,wind direction,and wind speed reveals root mean square errors of 0.212 m,0.525 s,27.446°,and 1.092 m/s,compared to 0.314 m,0.888 s,27.698°,and 1.315 m/s from buoy data,respectively.These results demonstrate the model’s effective retrieval of wave and wind parameters.Finally,the model,incorporating altimeter and scatterometer data,is evaluated against SAR/SWIM single and dual payload inversion methods across different wind speeds.This comparison highlights the model’s superior inversion accuracy over other methods.

Selecting the optimum location of the corner using gravity gradient method

The conventional gravity gradient method to plot the geologic body location is fuzzy. When the depth is large and the geologic body is small, the Vzz and Vzx derivative errors are also large. We describe that using the status distinguishing factor to optimally determine the comer location is more accurate than the conventional higher-order derivative method. Thus, a better small geologic body and fault resolution is obtained by using the gravity gradient method and trial theoretical model calculation. The actual data is better processed, providing a better basis for prospecting and determination of subsurface geologic structure.

A New Class of Nonlinear Conjugate Gradient Methods with Global Convergence Properties

非线性共轭梯度法由于其迭代简单和储存量小,且搜索方向不需要满足正割条件,在求解大规模无约束优化问题时占据及其重要的地位.提出了一类新的共轭梯度法,其搜索方向是目标函数的下降方向.若假设目标函数连续可微且梯度满足Lipschitz条件,线性搜索满足Wolfe原则,讨论了所设计算法的全局收敛性.

NEW HYBRID CONJUGATE GRADIENT METHOD AS A CONVEX COMBINATION OF LS AND FR METHODS

In this paper, we present a new hybrid conjugate gradient algorithm for unconstrained optimization. This method is a convex combination of Liu-Storey conjugate gradient method and Fletcher-Reeves conjugate gradient method. We also prove that the search direction of any hybrid conjugate gradient method, which is a convex combination of two conjugate gradient methods, satisfies the famous D-L conjugacy condition and in the same time accords with the Newton direction with the suitable condition. Furthermore, this property doesn't depend on any line search. Next, we also prove that, moduling the value of the parameter t,the Newton direction condition is equivalent to Dai-Liao conjugacy condition.The strong Wolfe line search conditions are used.The global convergence of this new method is proved.Numerical comparisons show that the present hybrid conjugate gradient algorithm is the efficient one.

GLOBAL CONVERGENCE RESULTS OF A THREE TERM MEMORY GRADIENT METHOD WITH A NON-MONOTONE LINE SEARCH TECHNIQUE

In this paper, a new class of three term memory gradient method with non-monotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient.

3D magnetotelluric inversions with unstructured finite-element and limited-memory quasi-Newton methods

Traditional 3D Magnetotelluric(MT) forward modeling and inversions are mostly based on structured meshes that have limited accuracy when modeling undulating surfaces and arbitrary structures. By contrast, unstructured-grid-based methods can model complex underground structures with high accuracy and overcome the defects of traditional methods, such as the high computational cost for improving model accuracy and the difficulty of inverting with topography. In this paper, we used the limited-memory quasi-Newton(L-BFGS) method with an unstructured finite-element grid to perform 3D MT inversions. This method avoids explicitly calculating Hessian matrices, which greatly reduces the memory requirements. After the first iteration, the approximate inverse Hessian matrix well approximates the true one, and the Newton step(set to 1) can meet the sufficient descent condition. Only one calculation of the objective function and its gradient are needed for each iteration, which greatly improves its computational efficiency. This approach is well-suited for large-scale 3D MT inversions. We have tested our algorithm on data with and without topography, and the results matched the real models well. We can recommend performing inversions based on an unstructured finite-element method and the L-BFGS method for situations with topography and complex underground structures.

Convergence of Online Gradient Method with Penalty for BP Neural Networks

Online gradient method has been widely used as a learning algorithm for training feedforward neural networks. Penalty is often introduced into the training procedure to improve the generalization performance and to decrease the magnitude of network weights. In this paper, some weight boundedness and deterministic con- vergence theorems are proved for the online gradient method with penalty for BP neural network with a hidden layer, assuming that the training samples are supplied with the network in a fixed order within each epoch. The monotonicity of the error function with penalty is also guaranteed in the training iteration. Simulation results for a 3-bits parity problem are presented to support our theoretical results.

An Improved Double-Threshold Method Based on Gradient Histogram

This paper analyzes the characteristics of the output gradient histogram and shortages of several traditional automatic threshold methods in order to segment the gradient image better. Then an improved double-threshold method is proposed, which is combined with the method of maximum classes variance, estimating-area method and double-threshold method. This method can automatically select two different thresholds to segment gradient images. The computer simulation is performed on the traditional methods and this algorithm and proves that this method can get satisfying result. Key words gradient histogram image - threshold selection - double-threshold method - maximum classes variance method CLC number TP 391. 41 Foundation item: Supported by the National Nature Science Foundation of China (50099620) and the Project of Chenguang Plan in Wuhan (985003062)Biography: YANG Shen (1977-), female, Ph. D. candidate, research direction: multimedia information processing and network technology.

FPGA-based Acceleration of Davidon-Fletcher-Powell Quasi-Newton Optimization Method

Quasi-Newton methods are the most widely used methods to find local maxima and minima of functions in various engineering practices. However, they involve a large amount of matrix and vector operations, which are computationally intensive and require a long processing time. Recently, with the increasing density and arithmetic cores, field programmable gate array(FPGA) has become an attractive alternative to the acceleration of scientific computation. This paper aims to accelerate Davidon-Fletcher-Powell quasi-Newton(DFP-QN) method by proposing a customized and pipelined hardware implementation on FPGAs. Experimental results demonstrate that compared with a software implementation, a speed-up of up to 17 times can be achieved by the proposed hardware implementation.

Preparation of berberine hydrochloride long-circulating liposomes by ionophore A23187-mediated ZnSO_(4)gradient method

The aim of the study was to prepare berberine hydrochloride long-circulating liposomes and optimize the formulation and process parameters,and investigate the influence of different factors on the encapsulation efficiency.Berberine hydrochloride liposomes were prepared in response to a transmembrane ion gradient that was established by ionophore A23187.Free and liposomal drug were separated by cation exchange resin,and then the amount of intraliposomal berberine hydrochloride was determined by UV spectrophotometry.The optimized encapsulation efficiency of berberine hydrochloride liposomes was 94.3%
2.1%when the drug-to-lipid ratio was 1:20,and the mean diameter was 146.9 nm
3.2 nm.As a result,the ionophore A23187-mediated ZnSO_(4)gradient method was suitable for the preparation of berberine hydrochloride liposomes that we could get the desired encapsulation efficiency and drug loading.

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.

IMPROVED GRADIENT METHOD FOR MONOTONE AND LIPSCHITZ CONTINUOUS MAPPINGS IN BANACH SPACES

Let C be a nonempty closed convex subset of a 2-uniformly convex and uniformly smooth Banach space E and {An}n∈N be a family of monotone and Lipschitz continuos mappings of C into E＊. In this article, we consider the improved gradient method by the hybrid method in mathematical programming [i0] for solving the variational inequality problem for {AN} and prove strong convergence theorems. And we get several results which improve the well-known results in a real 2-uniformly convex and uniformly smooth Banach space and a real Hilbert space.