arrow
返回

The Q method for second order cone programming

delete2008-05-01
delete8
PRE
AI
Y
Yu Xia *
F
Farid Alizadeh
DOI:10.1016/j.cor.2006.08.009delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We develop the Q method for the second order cone programming problem. The algorithm is the adaptation of the Q method for semidefinite programming originally developed by Alizadeh, Haeberly and Overton [A new primal-dual interior point method for semidefinite programming. In: Proceedings of the fifth SIAM conference on applications of linear algebra, Snowbird, Utah, 1994.] and [Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM Journal on Optimization 1998;8(3):746-68 [electronic].]. We take advantage of the special algebraic structure associated with second order cone programs to formulate the Q method. Furthermore we discuss the convergence properties of the algorithm. Finally, some numerical results are presented. (c) 2006 Elsevier Ltd. All fights reserved.
Keyword:
second order cone programming
infeasible interior point method
the Q method
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

暂无机构信息
引用论文

引用论文

Evaluation of a High School Peer Group Intervention for At-Risk Youth
err2005-06-01
err0
PREAI
errHyunsan Cho; Denise Dion Hallfors; Victoria Sánchez
err分享
err收藏
没有更多内容