期刊文献+

一种求解对称锥互补问题的算法

Algorithm for Solving Symmetric Cone Complementarity Problems
下载PDF
导出
摘要 提出了一种求解对称锥互补问题的信赖域算法。基于光滑函数,将对称锥互补问题转化为无约束优化问题,构造了信赖域子问题,利用结合非单调策略的信赖域算法进行求解,并证明了该算法具有全局收敛性。仿真实验结果表明,算法对求解对称锥互补问题是有效的。 A monotonic trust region algorithm for symmetric cone complementarity problems was proposed based on a smoothing function. The problem was transformed into unconstrained optimization problem and the trust region subproblem was constructed. The problem was solved by using trust region algorithm combined with nonmonotonic strategies, and the global convergence of the algorithm was proved. Numerical experimental results demonstrate that the algorithm is effective for symmetric cone complementarity problems.
出处 《系统仿真学报》 CAS CSCD 北大核心 2015年第5期1050-1056,共7页 Journal of System Simulation
基金 教育部高校博士学科科研基金联合资助项目(20132121110009)
关键词 对称锥互补问题 信赖域算法 非单调策略 牛顿算法 光滑函数 symmetric cone complementarity problems trust region algorithms nonmonotonic strategies Newton method smooth function
  • 相关文献

参考文献22

  • 1Ni, Tie,Gu, Wei-Zhe.Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions. Journal of Applied Mathematics and Computing . 2011
  • 2Kong, Lingchen,Sun, Jie,Xiu, Naihua.A regularized smoothing Newton method for symmetric cone complementarity problems. SIAM Journal on Optimization . 2008
  • 3Chua, Chek Beng,Yi, Peng.A continuation method for nonlinear complementarity problems over symmetric cones. SIAM Journal on Optimization . 2010
  • 4Cottle RW,Pang JS,Stone RE.The Linear Complementarity Problems. Journal of Women s Health . 1992
  • 5柯小伍,韩继业.一类新的信赖域算法的全局收敛性[J].应用数学学报,1995,18(4):608-615. 被引量:31
  • 6Faraut J,Koranyi A.Analysis on Symmetric cones. . 1994
  • 7张运胜,高雷阜.对称锥互补问题的一个惩罚NR函数的水平有界性[J].应用泛函分析学报,2013,15(4):337-341. 被引量:1
  • 8修乃华,韩继业.对称锥互补问题[J].数学进展,2007,36(1):1-12. 被引量:7
  • 9李改弟.一个自动确定信赖域半径的信赖域方法[J].工程数学学报,2006,23(5):843-848. 被引量:28
  • 10Liang Fang,Guoping He,Yunhong Hu.A new smoothing Newton-type method for second-order cone programming problems[J]. Applied Mathematics and Computation . 2009 (3)

二级参考文献40

  • 1修乃华,韩继业.对称锥互补问题[J].数学进展,2007,36(1):1-12. 被引量:7
  • 2Grippo L, Lampariello F, Lucidi S. A nommonotone line search tech- nique for Newton' s method. SIAM J Numer Anal, 1986; 23: 707-716.
  • 3Grippo L, Lampariello F, Lucidi S. A truncated Newton method with nonmonotone line search for unconstrained optimization . J Optim Theory Anal, 1989 ;60:401-419.
  • 4Panier E R, Tits A L. Avoiding the Maratos effect by means of a non- monotone line search I: general constrained problems. SIAM J Num- er Anal, 1991; 28:1183-1195.
  • 5Deng N Y, Xiao Y, Zhou F J. A nonmonotonic trust region algo- rithm. J Optim Theory Appl, 1993; 75:259-285.
  • 6Deng N Y,JOTA,1993年,76卷,259页
  • 7Powell M J D. A new algorithm for unconstrained optimization, In: J B Rosen, O L Mangassarian and K Ritter, eds., Nonlinear Programming[C]// New York: Academic press, 1970:31-66
  • 8Sartenaer A. Automatic determination of an initial trust region in nonlinear programming[J]. SIAM J Sci Comput, 1997,18:1788-1803
  • 9Fan Jinyan, Yuan Y. A new trust region algorithm with trust region radius converging to zero, Proceedings of the 5th International Conference on Optimization: Techniques and Applications[C]// Dec.2001, Hong Kong
  • 10Zhang X S, Zhang J L, Liao L.-Z. An adaptive trust region method and its convergence[J], Science in China(Series A), 2002,45:620-631

共引文献65

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部