Numerical block diagonalization of matrix - algebras with application to semidefinite programming
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 newpre-processing technique for SDP insta...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Journal Article |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/94308 http://hdl.handle.net/10220/7620 |
Summary: | 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 newpre-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. |
---|