期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A Trust Region Algorithm with Memory Model for Convex Constrained Optimization 被引量:1
1
作者 YUZhen-sheng wangchang-yu 《应用数学》 CSCD 北大核心 2004年第2期220-226,共7页
In this paper, we develop a trust region algorithm for convex constrained optimizationproblems. Different from the traditional trust region algorithms, our trust region model includesmemory of the past iteration, whic... In this paper, we develop a trust region algorithm for convex constrained optimizationproblems. Different from the traditional trust region algorithms, our trust region model includesmemory of the past iteration, which makes the algorithm more farsighted in the sense that its behav-ior is not completely dominated by the local nature of the objective function. We present a nonmono-tone algorithm that has this feature and prove its global convergence under suitable conditions. 展开更多
关键词 凸约束优化 信赖域 迭代点 全局收敛性 非单调技术
下载PDF
A New Convergence Result of Gauss-NewtonMethods for the Complementarity Problem
2
作者 wangchang-yu QUBiao 《Systems Science and Systems Engineering》 CSCD 2002年第4期414-418,共5页
The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem. In this paper, a new stepsize is presented and a new glob... The authors study the convergence properties of the damped Gauss-Newton algorithm which was originally proposed by Subramamian for the complementarity problem. In this paper, a new stepsize is presented and a new global convergence result is given. This result here have improved and generalized those in the literature. 展开更多
关键词 complementarity problem Gauss-Newton algorithm nonlinear systems of equation global convergence
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部