SCIP-SDP is a solver for mixed-integer semidefinite programs (SDPs). It implements a SDP-based branch-and-cut approach. The SDP-relaxations are solved using interior-point SDP-solvers like DSDP, Mosek or SDPA. The SCIP-SDP-Package is a plug-in for the branch-and-cut framework SCIP. The goal of SCIP-SDP is to provide a solver for general mixed-integer SPDs. Thus, it provides data handling procedures, presolve routines, primal heuristics, a dual fixing method, and an linear approximation procedure for MISDPs. SCIP-SDP can also be parallelized with ParaSCIP. This software is currently developed at TU Darmstadt.

References in zbMATH (referenced in 14 articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Lubin, Miles; Vielma, Juan Pablo; Zadik, Ilias: Mixed-integer convex representability (2022)
  2. Maity, Dipankar; Hartman, David; Baras, John S.: Sensor scheduling for linear systems: A covariance tracking approach (2022)
  3. Kobayashi, Ken; Takano, Yuichi; Nakata, Kazuhide: Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (2021)
  4. Bertsimas, Dimitris; Lamperski, Jourdain; Pauphilet, Jean: Certifiably optimal sparse inverse covariance estimation (2020)
  5. Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
  6. Kobayashi, Ken; Takano, Yuich: A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (2020)
  7. Gally, Tristan M.: Computational mixed-integer semidefinite programming (2019)
  8. Kellner, Kai; Pfetsch, Marc E.; Theobald, Thorsten: Irreducible infeasible subsystems of semidefinite systems (2019)
  9. Nugroho, Sebastian A.; Taha, Ahmad F.; Gatsis, Nikolaos; Summers, Tyler H.; Krishnan, Ram: Algorithms for joint sensor and control nodes selection in dynamic networks (2019)
  10. Gally, Tristan; Pfetsch, Marc E.; Ulbrich, Stefan: A framework for solving mixed-integer semidefinite programs (2018)
  11. Lubin, Miles; Yamangil, Emre; Bent, Russell; Vielma, Juan Pablo: Polyhedral approximation in mixed-integer convex optimization (2018)
  12. Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
  13. Friberg, Henrik A.: CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization (2016)
  14. Wang, Peng; Shen, Chunhua; van den Hengel, Anton; Torr, Philip H. S.: Efficient semidefinite branch-and-cut for MAP-MRF inference (2016)