摘要
本文提出一种求解单调非线性互补问题的Mehrotra型预估-校正算法.新算法采用不同的自适应更新策略.在尺度化的Lipschitz条件下,证明了新算法的迭代复杂性为O(n2log((x0)Ts0/ε)),其中(x0,s0)为初始点,ε为精度.
In this paper we present a Mehrotra-type predictor-corrector algorithm for monotone nonlinear complementarity problem.The Mehrotra heuristic of our algorithm is different from others.Under a scaled Lipschitz condition,we show the algorithm has an O(n2log((x0)Ts0/ε)) iteration complexity,where (x0,s0) is initial point and ε is tolerance.
出处
《应用数学》
CSCD
北大核心
2011年第4期691-698,共8页
Mathematica Applicata
基金
the Natural Science Foundation of Hubei Province of China (2008CDZ047)