CSDP, A C Library for Semidefinite Programming. This is the project page for the CSDP project of COIN-OR. CSDP is a library of routines that implements a predictor corrector variant of the semidefinite programming algorithm of Helmberg, Rendl, Vanderbei, and Wolkowicz. The main advantages of this code are that it is written to be used as a callable subroutine, it is written in C for efficiency, the code runs in parallel on shared memory multi-processor systems, and it makes effective use of sparsity in the constraint matrices. CSDP has been compiled on many different systems. The code should work on any system with an ANSI C Compiler and BLAS/LAPACK libraries.

References in zbMATH (referenced in 189 articles , 2 standard articles )

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

1 2 3 ... 8 9 10 next

  1. de Laat, David: Moment methods in energy minimization: new bounds for Riesz minimal energy problems (2020)
  2. Pei, Zhi; Wan, Mingzhong; Wang, Ziteng: A new approximation algorithm for unrelated parallel machine scheduling with release dates (2020)
  3. Anjos, Miguel F.; Neto, José: Spectral bounds for graph partitioning with prescribed partition sizes (2019)
  4. Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
  5. Coregliano, Leonardo N.; Parente, Roberto F.; Sato, Cristiane M.: On the maximum density of fixed strongly connected subtournaments (2019)
  6. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  7. Grzesik, Andrzej; Hu, Ping; Volec, Jan: Minimum number of edges that occur in odd cycles (2019)
  8. Liuzzi, G.; Locatelli, M.; Piccialli, Veronica: A new branch-and-bound algorithm for standard quadratic programming problems (2019)
  9. Neto, José; Ben-Ameur, Walid: On fractional cut covers (2019)
  10. Papp, Dávid; Yildiz, Sercan: Sum-of-squares optimization without semidefinite programming (2019)
  11. Behrends, Sönke; Hübner, Ruth; Schöbel, Anita: Norm bounds and underestimators for unconstrained polynomial integer minimization (2018)
  12. Roux, Pierre; Iguernlala, Mohamed; Conchon, Sylvain: A non-linear arithmetic procedure for control-command software verification (2018)
  13. Roux, Pierre; Voronin, Yuen-Lam; Sankaranarayanan, Sriram: Validating numerical semidefinite programming solvers for polynomial invariants (2018)
  14. Adjé, Assalé; Garoche, Pierre-Loïc; Magron, Victor: A sums-of-squares extension of policy iterations (2017)
  15. Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
  16. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  17. Galli, Laura; Letchford, Adam N.: On the Lovász theta function and some variants (2017)
  18. Garraffa, Michele; Della Croce, Federico; Salassa, Fabio: An exact semidefinite programming approach for the max-mean dispersion problem (2017)
  19. Gethner, Ellen; Hogben, Leslie; Lidický, Bernard; Pfender, Florian; Ruiz, Amanda; Young, Michael: On crossing numbers of complete tripartite and balanced complete multipartite graphs (2017)
  20. Papp, Dávid: Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming (2017)

1 2 3 ... 8 9 10 next