2992. Mixed-Integer Semidefinite Programming: Alternative cutting planes and a new primal heuristic
Invited abstract in session WC-49: Aspects of Conic Optimization, stream Conic and polynomial optimization.
Wednesday, 12:30-14:00Room: Parkinson B10
Authors (first author is the speaker)
| 1. | Jan Kronqvist
|
| Mathematics, KTH Royal Institute of Technology | |
| 2. | Johanna Skåntorp
|
| Mathematics, KTH Royal Institute of Technology |
Abstract
Here we focus on Mixed-Integer Semidefinite Programming (MISDP), and specifically solving MISDP by outer approximation techniques. We present an alternative interpretation of some known types of cutting planes, and some new techniques to derive cuts with more desirable properties. We also present a new primal heuristic that also builds on an outer approximation concept that can both find feasible solutions and produce cutting planes for the main algorithm.
Keywords
- Programming, Mixed-Integer
- Programming, Semidefinite
Status: accepted
Back to the list of papers