Algorithm 875: DSDP5--software for semidefinite programming. DSDP implements the dual-scaling algorithm for semidefinite programming. The source code for this interior-point algorithm, written entirely in ANSI C, is freely available under an open source license. The solver can be used as a subroutine library, as a function within the Matlab environment, or as an executable that reads and writes to data files. Initiated in 1997, DSDP has developed into an efficient and robust general-purpose solver for semidefinite programming. Its features include a convergence proof with polynomially bounded worst-case complexity, primal and dual feasible solutions when they exist, certificates of infeasibility when solutions do not exist, initial points that can be feasible or infeasible, relatively low memory requirements for an interior-point method, sparse and low-rank data structures, extensibility that allows applications to customize the solver and improve its performance, a subroutine library that enables it to be linked to larger applications, scalable performance for large problems on parallel architectures, and a well-documented interface and examples of its use. The package has been used in many applications and tested for efficiency, robustness, and ease of use. (Source: http://dl.acm.org/)

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 30 articles , 1 standard article )

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

1 2 next

  1. Jiang, Xin; Vandenberghe, Lieven: Bregman primal-dual first-order method and application to sparse semidefinite programming (2022)
  2. Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A Newton-bracketing method for a simple conic optimization problem (2021)
  3. Goddet, Etienne; Retière, Nicolas; Stojanović, Vojislav; Dieudonné, Anca; Genoulaz, Jérôme; Guichon, Jean-Michel: Maximizing the algebraic connectivity of meshed electrical pathways used as current return network (2019)
  4. Gally, Tristan; Pfetsch, Marc E.; Ulbrich, Stefan: A framework for solving mixed-integer semidefinite programs (2018)
  5. Liu, H. B.; Wang, D. Q.: Stability and stabilisation of a class of networked dynamic systems (2018)
  6. Cifuentes, Diego; Parrilo, Pablo A.: Sampling algebraic varieties for sum of squares programs (2017)
  7. Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
  8. Diamond, Steven; Boyd, Stephen: Matrix-free convex optimization modeling (2016)
  9. Bugarin, Florian; Bartoli, Adrien; Henrion, Didier; Lasserre, Jean-Bernard; Orteu, Jean-José; Sentenac, Thierry: Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (2015)
  10. Bertin, Rémi; Hunold, Sascha; Legrand, Arnaud; Touati, Corinne: Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization (2014) ioport
  11. Hansson, Anders; Vandenberghe, Lieven: Sampling method for semidefinite programmes with non-negative Popov function constraints (2014)
  12. Gualandi, Stefano; Maffioli, Francesco; Magni, Claudio: A branch-and-price approach to (k)-clustering minimum biclique completion problem (2013)
  13. Mittelmann, Hans D.: The state-of-the-art in conic optimization software (2012)
  14. Yamashita, Makoto; Fujisawa, Katsuki; Fukuda, Mituhiro; Nakata, Kazuhide; Nakata, Maho: Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix (2012)
  15. Bao, Xiaowei; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (2011)
  16. Falkeborn, Rikard; Löfberg, Johan; Hansson, Anders: Low-rank exploitation in semidefinite programming for control (2011)
  17. Grippo, Luigi; Palagi, Laura; Piccialli, Veronica: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem (2011)
  18. Monniaux, David; Corbineau, Pierre: On the generation of Positivstellensatz witnesses in degenerate cases (2011)
  19. Andersen, Martin S.; Dahl, Joachim; Vandenberghe, Lieven: Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (2010)
  20. Atamtürk, Alper; Narayanan, Vishnu: Conic mixed-integer rounding cuts (2010)

1 2 next