检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张新华[1]
出 处:《数学杂志》2015年第1期1-11,共11页Journal of Mathematics
基 金:Supported by National Natural Science Foundation of China(71001053)
摘 要:本文设计了一个新的求解等式约束非凸优化问题的修正牛顿算法.利用修正的拉格朗日函数,通过求解线性方程组获得搜索方向,利用价值函数的线性近似模型确定步长.在没有非奇异性假设的条件下,证明了算法的全局收敛性.数值结果表明,算法是有效的.A regularized Newton method is presented in this paper to solve equality con- strained nonconvex minimization problems. Such a method is characterized by its use of the per- turbation of the Lagrangian function's Hessian to deal with the negative curvature. The method is based on successively solving linear systems for which effective software is readily available. The linear model of a merit function is employed to attain a sufficient reduction in a local approximation of the merit function during each iteration. Without the nonsingularity assumption of solution, the global convergence of the regularized Newton method is established. Some preliminary numerical results are reported, which show the efficiency of the method.
分 类 号:O221.2[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30