A SMOOTHING CONJUGATE GRADIENT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS

在线阅读 下载PDF 导出详情
摘要 APRP-typesmoothingconjugategradientmethodforsolvinglargescalenonlinearcomplementarityproblems(NCP(F))isproposed.Ateachiteration,twoArmijolinesearchesareperformed,whichguaranteesthepositivepropertyofthesmoothingparameterandminimizesthemeritfunctionformedbyFischer-Burmeisterfunction,respectively.GlobalconvergenceisstudiedwhenF:R~n→R~nisacontinuouslydifferentiableP_0+R_0function.Numericalresultsshowthatthemethodisefficient.
机构地区 不详
出版日期 2008年04月14日(中国期刊网平台首次上网日期,不代表论文的发表时间)
  • 相关文献