一种分解型Quasi-Newton电容层析成像图像重建算法

针对电容层析成像系统中的"软场"效应和病态问题,在分析电容层析成像和QuasiNewton算法原理的基础上,基于非线性最小二乘的成像原理,提出了一种新的分解型Quasi-Newton电容层析成像算法,推导出了求解ECT反问题的分解型拟牛顿图像重建算法放的计算步骤,同时利用信赖域公式对目标函数的Hessian矩阵进行校正.仿真实验表明,基于分解型拟牛顿方法具有可行性,对于基本流型该算法与LBP算法相比,具有成像质量高和边界均匀稳定的特点,为ECT图像重建的研究提供了一个新的思路.

一种μGA+Quasi-Newton的混合优化算法

提出了一种新型的优化算法。此算法利用微种群遗传算法(μGA)的全局最优性在大范围内搜索可能的极值,而用拟牛顿(Quasi Newton)法的目标函数梯度下降特性在极值点附近快速搜索,从而实现了全局最优与快速搜索的有机结合。同时,通过几个典型的试验函数对此混合算法与微种群遗传算法的寻优效果做了比较。

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.

Rapid Springback Compensation for Age Forming Based on Quasi Newton Method

Iterative methods based on finite element simulation are effective approaches to design mold shape to compensate springback in sheet metal forming. However, convergence rate of iterative methods is difficult to improve greatly. To increase the springback compensate speed of designing age forming mold, process of calculating springback for a certain mold with finite element method is analyzed. Springback compensation is abstracted as finding a solution for a set of nonlinear functions and a springback compensation algorithm is presented on the basis of quasi Newton method. The accuracy of algorithm is verified by developing an ABAQUS secondary development program with MATLAB. Three rectangular integrated panels of dimensions 710 mmx750 mm integrated panels with intersected ribs of 10 mm are selected to perform case studies. The algorithm is used to compute mold contours for the panels with cylinder, sphere and saddle contours respectively and it takes 57%, 22% and 33% iterations as compared to that of displacement adjustment （DA） method. At the end of iterations, maximum deviations on the three panels are 0.618 4 mm, 0.624 1 mm and 0.342 0 mm that are smaller than the deviations determined by DA method （0.740 8 mm, 0.740 8 mm and 0.713 7 mm respectively）. In following experimental verification, mold contour for another integrated panel with 400 ram^380 mm size is designed by the algorithm. Then the panel is age formed in an autoclave and measured by a three dimensional digital measurement devise. Deviation between measuring results and the panel＇s design contour is less than 1 mm. Finally, the iterations with different mesh sizes （40 mm, 35 mm, 30 mm, 25 mm, 20 mm） in finite element models are compared and found no considerable difference. Another possible compensation method, Broyden-Fletcher-Shanmo method, is also presented based on the solving nonlinear fimctions idea. The Broyden-Fletcher-Shanmo method is employed to compute mold contour for the second panel. It only takes 50% iterations compared to that of DA. The proposed method can serve a faster mold contour compensation method for sheet metal forming.

GLOBAL COVERGENCE OF THE NON-QUASI-NEWTON METHOD FOR UNCONSTRAINED OPTIMIZATION PROBLEMS

In this paper, the non-quasi-Newton＇s family with inexact line search applied to unconstrained optimization problems is studied. A new update formula for non-quasi-Newton＇s family is proposed. It is proved that the constituted algorithm with either Wolfe-type or Armijotype line search converges globally and Q-superlinearly if the function to be minimized has Lipschitz continuous gradient.

BFGS quasi-Newton location algorithm using TDOAs and GROAs

With the emergence of location-based applications in various fields, the higher accuracy of positioning is demanded. By utilizing the time differences of arrival （TDOAs） and gain ratios of arrival （GROAs）, an efficient algorithm for estimating the position is proposed, which exploits the Broyden-Fletcher-Goldfarb-Shanno （BFGS） quasi-Newton method to solve nonlinear equations at the source location under the additive measurement error. Although the accuracy of two-step weighted-least-square （WLS） method based on TDOAs and GROAs is very high, this method has a high computational complexity. While the proposed approach can achieve the same accuracy and bias with the lower computational complexity when the signal-to-noise ratio （SNR） is high, especially it can achieve better accuracy and smaller bias at a lower SNR. The proposed algorithm can be applied to the actual environment due to its real-time property and good robust performance. Simulation results show that with a good initial guess to begin with, the proposed estimator converges to the true solution and achieves the Cramer-Rao lower bound （CRLB） accuracy for both near-field and far-field sources.

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.

Quasi-Newton Method for Optimal Blank Allowance Balancing

A balancing technique for casting or forging parts to be machined is presented in this paper.It allows an optimal part setup to make sure that no shortage of material(undercut)will occur during machining.Particularly in the heavy part in- dustry,where the resulting casting size and shape may deviate from expectations,the balancing process discovers whether or not the design model is totally enclosed in the actual part to be machined.The alignment is an iterative process involving nonlinear con- strained optimization,which forces data points to lie outside the nominal model under a specific order of priority.Newton methods for non-linear numerical minimization are rarely applied to this problem because of the high cost of computing.In this paper, Newton methods are applied to the balancing of blank part.The aforesaid algorithm is demonstrated in term of a marine propeller blade,and result shows that The Newton methods are more efficient and accurate than those implemented in past research and have distinct advantages compared to the registration methods widely used today.

A Switching Algorithm Based on Modified Quasi-Newton Equation

In this paper, a switching method for unconstrained minimization is proposed. The method is based on the modified BFGS method and the modified SR1 method. The eigenvalues and condition numbers of both the modified updates are evaluated and used in the switching rule. When the condition number of the modified SR1 update is superior to the modified BFGS update, the step in the proposed quasi-Newton method is the modified SR1 step. Otherwise the step is the modified BFGS step. The efficiency of the proposed method is tested by numerical experiments on small, medium and large scale optimization. The numerical results are reported and analyzed to show the superiority of the proposed method.

OPTIMAL MOTION PLANNING FOR A RIGID SPACECRAFT WITH TWO MOMENTUM WHEELS USING QUASI-NEWTON METHOD

An optimal motion planning scheme based on the quasi-Newton method is proposed for a rigid spacecraft with two momentum wheels. A cost functional is introduced to incorporate the control energy, the final state errors and the constraints on states. The motion planning for determining control inputs to minimize the cost functional is formulated as a nonlinear optimal control problem. Using the control parametrization, one can transform the infinite dimensional optimal control problem to a finite dimensional one that is solved via the quasi-Newton methods for a feasible trajectory which satisfies the nonholonomic constraint. The optimal motion planning scheme was applied to a rigid spacecraft with two momentum wheels. The simulation results show the effectiveness of the proposed optimal motion planning scheme.

An Improved Quasi-Newton Method for Unconstrained Optimization

We present an improved method. If we assume that the objective function is twice continuously differentiable and uniformly convex, we discuss global and superlinear convergence of the improved quasi-Newton method.

The Design of Circular Microstrip Patch Antenna by Using Quasi-Newton Algorithm of ANN

The paper presents the Quasi Newton model of Artificial Neural Network for design of circular microstrip antenna (MSA). In this model, a closed form expression is used for accurate determination of the resonant frequency of circular microstrip patch antenna. The calculated resonant frequency results are in good agreement with the experimental results reported elsewhere. The results show better agreement with the trained and tested data of ANN models. The results are verified by the experimental results to produce accurate ANN models. This presents ANN model practically as an alternative method to the detailed electromagnetic design of circular microstrip antenna.

A Study of BCI Signal Pattern Recognition by Using Quasi-Newton-SVM Method

The recognition of electroencephalogram (EEG) signals is the key of brain computer interface (BCI). Aimed at the problem that the recognition rate of EEG by using support vector machine (SVM) is low in BCI, based on the assumption that a well-defined physiological signal which also has a smooth form "hides" inside the noisy EEG signal, a Quasi-Newton-SVM recognition method based on Quasi-Newton method and SVM algorithm was presented. Firstly, the EEG signals were preprocessed by Quasi-Newton method and got the signals which were fit for SVM. Secondly, the preprocessed signals were classified by SVM method. The present simulation results indicated the Quasi-Newton-SVM approach improved the recognition rate compared with using SVM method; we also discussed the relationship between the artificial smooth signals and the classification errors.

基于拟Newton法的并联机构位置正解

基于Newton法的迭代搜索算法是求解并联机构位置正解的重要数值算法,但是在其每一步的迭代过程中都需要构造机构的Jacobian矩阵。在Newton法的基础上,将拟Newton法应用于并联机构的位置正解求解,该方法用当前的函数值代替Jacobian矩阵,能够减小每一迭代步的计算量。定义机构的虚工作空间,并分析6-RUS这一类并联机构虚工作空间受限的原因及迭代搜索算法在求解这一类机构位置正解时的局限性,提出将这一类机构的位置正解等效求解的方法。进一步分析耦合型少自由度机构虚工作空间受限的原因,采用虚设机构法和改进的Jacobian矩阵使迭代搜索算法能够适用于这一类机构。数值算例表明:相比于Newton法,拟Newton法的总迭代步数并没有明显增加,但由于每一迭代步的计算量少,计算效率明显提高,为并联机构位置正解在实时场合的应用提供了一定的理论指导;等效机构法能够扩大机构的虚工作空间,增加迭代搜索算法的适用范围。

菱—方、椭—方孔型系统的拟Newton迭代算法

提出一种通过求解非线性方程组确定中间菱形、椭圆孔型尺寸的方法。文中以Мутъев和Wusatowski宽展公式为例,讨论了求解菱一方和椭一方孔型系统时非线性方程组的建立方法,并采用拟Newton法对方程组求解。该算法可靠性好,计算效率高且具有通用性,算法误差为:△H_1/H_1<0.3%、△B_2/B_1<0.1%、△F_1/F_1<0.2%。

基于拟Newton算法的Purex流程计算机模拟程序

在多级逆流萃取MESH方程基础上 ,基于拟Newton算法编写了用于模拟Purex萃取流程的计算机程序 ,使用SEPHIS分配比模型 ,分别以 1A、2D槽工艺条件为例 ,计算了其各级出口的U、Pu、酸浓度。程序计算结果与实验浓度剖面符合很好。相对于已有的一些计算机模拟程序 ,该程序具有适用性广。

拟Newton法在高阶矩阵中的应用——求解最大特征值及特征向量

将求解高阶矩阵的最大特征值及其对应的特征向量问题转化为高阶非线性方程组的求解问题。在此基础上,提出了求解矩阵最大特征值及其对应特征向量的拟Newton法,给出求解矩阵最大特征值及其单位化向量重新整理后的Broyden方法公式、BFS方法公式、DFP方法公式及其对应的Broyden算法,BFS算法,DFP算法。以层次分析法中高阶判断矩阵为例验证了该方法的可行性,说明了该方法相对收敛速度快的优势。

一类非拟Newton算法及其收敛性

本文对求解无约束最优化问题提出一类非拟Newton算法,此方法同样具有二次终止性,产生的矩阵序列保持正定对称传递性。并证明了新类中的任何一种算法的全局收敛和超线性收敛性。

用行列修正拟Newton法求解奇异问题

给出了求解奇异问题的行列修正拟Newton法的收敛性定理及渐近收敛速率.