期刊
MATHEMATICAL PROGRAMMING
卷 129, 期 1, 页码 91-111出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-011-0461-3
关键词
Semidefinite programming; Algebraic symmetry; Pre-processing; Interior point methods
Semidefinite programming (SDP) is one of the most active areas in mathematical programming, due to varied applications and the availability of interior point algorithms. In this paper we propose a new pre-processing technique for SDP instances that exhibit algebraic symmetry. We present computational results to show that the solution times of certain SDP instances may be greatly reduced via the new approach.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据