欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
利用新的曲线搜索方法,提出一种解决无约束优化问题的记忆拟牛顿算法,给出该算法全局收敛的条件并进行数值实验.新算法由曲线搜索确定迭代步长,搜索方向用到当前迭代点信息的同时还用到上一次迭代点的信息,而且搜索方向与迭代步长同时确定,是一种有效的算法.
英文摘要：
By means of a new curve search rule ,we propose a new memory quasi-Newton method for unconstrained optimization problems. A global convergent result is proved and numerical experiments are carried out. The step-size of the new algorithm is determined by the new curve search rule. The search direction not only make use of the current iterative information but also the previous kerative information. Moreover, the search direction and the step-size are determined simultaneously at each iteration. Numerical results show that the algorithm is effective.
同期刊论文项目
同项目期刊论文
A general projection gradient method for linear constrained optimization with superlinear convergenc
A Superlinearly Convergent SQP Algorithm for Mathematical Programs
with Linear Complementarity Const
A globally and superlinearly convergent smoothing Broyden-like method for solving nonlinear compleme
An interior point type QP-free algorithm with superlinear convergence for inequality constrained opt
A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity cons
A Sequential Equality Constrained Quadratic Programming Algorithm
for Inequality Constrained Optimiz
A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity const
期刊信息
位置：