共被期刊论文引用了3次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A SUPERLINEARLY CONVERGENT TRUST REGION ALGORITHM FOR LC^1 CONSTRAINED OPTIMIZATION PROBLEMS显示文摘In this paper, a new trust region algorithm for nonlinear equality constrained LC1 optimization problems is given. It obtains a search direction at each iteration not by solving a quadratic programming subproblem with a trust region bound, but by solving a system of linear equations. Since the computational complexity of a QP-Problem is in general much larger than that of a system of linear equations, this method proposed in this paper may reduce the computational complexity and hence improve computational efficiency. Furthermore, it is proved under appropriate assumptions that this algorithm is globally and super-linearly convergent to a solution of the original problem. Some numerical examples are reported, showing the proposed algorithm can be beneficial from a computational point of view. | 欧宜贵 侯定丕 | 2005 | Acta Mathematica Scientia2005，25，1： | 3 |
| 2 | 一个带固定步长的ODE型算法显示文摘提出了一种新的求解无约束优化问题的ODE型方法,其特点是:它在每次迭代时仅求解一个线性方程组系统来获得试探步;若该试探步不被接受,算法就沿着该试探步的方向求得下一个迭代点,其中步长通过固定公式计算得到.这样既避免了传统的ODE型算法中为获得可接受的试探步而重复求解线性方程组系统,又不必执行线搜索,从而减少了计算量.在适当的条件下,还证明了新算法的整体收敛性和局部超线性收敛性.数值试验结果表明:提出的算法是有效的. | 王冠舒 欧宜贵 | 2013 | 数学的实践与认识2013，43，1： | 3 |
| 3 | C^(1,1)半定规划的二阶最优性条件(英文)显示文摘研究了C^(1,1)函数类的半定规划问题,其中的目标函数是连续可微的,其梯度是拟可微的.利用拟可微分析分别给出了二阶必要条件和二阶充分条件. | 赵文会 高岩 戴天晟 | 2008 | 运筹学学报2008，12，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员