CSDP
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.
Keywords for this software
References in zbMATH (referenced in 200 articles , 2 standard articles )
Showing results 1 to 20 of 200.
Sorted by year (- Polyak, B. T.; Khlebnikov, M. V.; Shcherbakov, P. S.: Linear matrix inequalities in control systems with uncertainty (2021)
- Anjos, Miguel F.; Neto, José: A class of spectral bounds for max (k)-cut (2020)
- Bennett, Patrick; Dudek, Andrzej; Lidický, Bernard; Pikhurko, Oleg: Minimizing the number of 5-cycles in graphs with given edge-density (2020)
- Bruno, Hugo; Barros, Guilherme; Menezes, Ivan F. M.; Martha, Luiz Fernando: Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (2020)
- Cifuentes, Diego; Kahle, Thomas; Parrilo, Pablo: Sums of squares in Macaulay2 (2020)
- Coey, Chris; Lubin, Miles; Vielma, Juan Pablo: Outer approximation with conic certificates for mixed-integer convex problems (2020)
- de Laat, David: Moment methods in energy minimization: new bounds for Riesz minimal energy problems (2020)
- Drury, Stephen: The triangle graph (T_6) is not SPN (2020)
- Pei, Zhi; Wan, Mingzhong; Wang, Ziteng: A new approximation algorithm for unrelated parallel machine scheduling with release dates (2020)
- Rapoport, L. B.; Tormagov, T. A.: Relaxation methods for navigation satellites set optimization (2020)
- Waldspurger, Irène; Waters, Alden: Rank optimality for the Burer-Monteiro factorization (2020)
- Walteros, Jose L.; Buchanan, Austin: Why is maximum clique often easy in practice? (2020)
- Anjos, Miguel F.; Neto, José: Spectral bounds for graph partitioning with prescribed partition sizes (2019)
- Buchheim, Christoph; Montenegro, Maribel; Wiegele, Angelika: SDP-based branch-and-bound for non-convex quadratic integer optimization (2019)
- Coregliano, Leonardo N.; Parente, Roberto F.; Sato, Cristiane M.: On the maximum density of fixed strongly connected subtournaments (2019)
- Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
- Grzesik, Andrzej; Hu, Ping; Volec, Jan: Minimum number of edges that occur in odd cycles (2019)
- Kumagai, Atsuya: Spectral dimensionality reduction for Bregman information (2019)
- Liuzzi, G.; Locatelli, M.; Piccialli, Veronica: A new branch-and-bound algorithm for standard quadratic programming problems (2019)
- Neto, José; Ben-Ameur, Walid: On fractional cut covers (2019)