Asynchronous - parallel pseudo - newtonian algorithm for solving non - convex function minimals 求解非凸函数极小的异步并行拟牛顿算法
Quasi - newton method 拟牛顿法
Global convergence of non - quasi - newton merhods with a class of inexact line searching 带一类非精确线搜索的非拟牛顿算法的整体收敛性
Global convergence of the non - quasi - newton method for unconstrained optimization problems problems 基于非拟牛顿方法无约束最优化问题的全局收敛性
Study of the combination of ant algorithm and quasi - newton algorithm in computing mathematical model of water supply network 蚂蚁算法与拟牛顿法嫁接求解管网数学模型
Convergence analysis of a successive approximation quasi - newton method for solving nonlinear complementarity problems 求解非线性互补问题的逐次逼近拟牛顿法的收敛性分析
Firstly , we simply introduce the scope , value and developement of the sparse quasi - newton method for unconstrained optimization problems 第一章为绪论简要介绍稀疏拟牛顿法的提出，研究情况及研究价值。
K was given by : k = ( x , g ) / ( g , g ] ( a . b ) denotes the usual inner product of the vectors a and b 于是我们在cane切、牛顿、拟牛顿等算法的基础上并受bar幻和borwein算法思想的启发，提出了稀疏拟牛顿法。
However , conventional solution methods such as newton iterative method , quasi - newton iterative method are initialization dependent and maybe could not reliable converge 传统的求解方法如牛顿迭代法和拟牛顿迭代法都是典型的局部收敛性方法。
In this paper , we give a class of superlincarly convcngent algorithms for nonlinear programming problems with linear constrained by combining non - quasi - newton methods with the projection methods 本文结合文[ 2 ]中的非拟牛顿法与投影类算法，给出了求解线性约束非线性优化问题的一类具有超线性收敛的投影非拟牛顿算法。
