期刊文献+

Two new predictor-corrector algorithms for second-order cone programming 被引量:1

Two new predictor-corrector algorithms for second-order cone programming
下载PDF
导出
摘要 Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton (AHO) directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O(rln(εo/ε)) is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective. Based on the ideas of infeasible interior-point methods and predictor-corrector algorithms, two interior-point predictor-corrector algorithms for the second-order cone programming (SOCP) are presented. The two algorithms use the Newton direction and the Euler direction as the predictor directions, respectively. The corrector directions belong to the category of the Alizadeh-Haeberly-Overton (AHO) directions. These algorithms are suitable to the cases of feasible and infeasible interior iterative points. A simpler neighborhood of the central path for the SOCP is proposed, which is the pivotal difference from other interior-point predictor-corrector algorithms. Under some assumptions, the algorithms possess the global, linear, and quadratic convergence. The complexity bound O(rln(εo/ε)) is obtained, where r denotes the number of the second-order cones in the SOCP problem. The numerical results show that the proposed algorithms are effective.
出处 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI 2011年第4期521-532,共12页 应用数学和力学(英文版)
基金 supported by the National Natural Science Foundation of China (Nos. 71061002 and 11071158) the Natural Science Foundation of Guangxi Province of China (Nos. 0832052 and 2010GXNSFB013047)
关键词 second-order cone programming infeasible interior-point algorithm predictor-corrector algorithm global convergence complexity analysis second-order cone programming, infeasible interior-point algorithm, predictor-corrector algorithm, global convergence, complexity analysis
  • 相关文献

参考文献1

二级参考文献1

共引文献10

同被引文献14

  • 1Alizadeh F, Goldfarb D. Second-order cone programming [J]. Mathematical Programming: Se- ries B, 2003, 95: 3-51. 被引量:1
  • 2Sun D, Sun J. Strong semismoothness of the Fischer-Burmeister SDC and SOC complemen- tarity functions [J]. Mathematical Programming: Series A, 2005, 103: 575-581. 被引量:1
  • 3Zarantonello E H. Projections on Convex Sets in Hilbert Space and Spectral Theory [M]. New York: Academic Press, 1971. 被引量:1
  • 4Chen X D, Sun D, Sun J. Complementarity functions and numerical experiments on some s- moothing Newton methods for second-order-cone complementarity problems [J]. Computational Optimization and Applications, 2003, 25: 39-56. 被引量:1
  • 5Chi X N, Liu S Y. Analysis of a non-interior continuation method for second-order cone pro- gramming [J]. Journal of Applied Mathematics and Computing, 2008, 27: 47-61. 被引量:1
  • 6Chen J S, Chen X, Tseng P. Analysis of nonsmooth vector-valued functions associated with second-order cones [J]. Mathematical Programming: Series B, 2004, 101: 95-117. 被引量:1
  • 7Fukushima M, Luo Z'Q, Tseng P. Smootling functions for second-order-cone complementarity problems [J]. SIAM Journal on Optimization, 2001, 12(2): 436-460. 被引量:1
  • 8Qi L, Sun D, Zhou G. A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities [J]. Mathematical Programming: Series A, 2000, 87: 1-35. 被引量:1
  • 9Fang L, He G P, Hu Y H. A new smoothing Newton-type method for second-order cone pro- gramming problems [J]. Applied Mathematics and Computation, 2009, 215: 1020-1029. 被引量:1
  • 10Zeng Y F, Jian J B, Tang C M. A new smoothing method based on nonsmooth FB function for second-order cone programming [C]// Advaneed Materials Research, Materials Science and Information Technology II, 2012, 532-533: 1000-1005. 被引量:1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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