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 155 articles , 2 standard articles )
Showing results 1 to 20 of 155.
Sorted by year (- Arima, Naohiko; Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A robust Lagrangian-DNN method for a class of quadratic optimization problems (2017)
- Adasme, Pablo; Lisser, Abdel: A computational study for bilevel quadratic programs using semidefinite relaxations (2016)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (2016)
- Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard: Minimizing the sum of many rational functions (2016)
- Dong, Hongbo: Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (2016)
- Glebov, Roman; Král’, Daniel; Volec, Jan: A problem of Erd\Hosand Sós on 3-graphs (2016)
- Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (2016)
- Krislock, Nathan; Malick, Jér^ome; Roupin, Frédéric: Computational results of a semidefinite branch-and-bound algorithm for $k$-cluster (2016)
- 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)
- Dai, Liyun; Xia, Bican: Smaller SDP for SOS decomposition (2015)
- Locatelli, Marco: Improving upper bounds for the clique number by non-valid inequalities (2015)
- Pessoa, Artur Alves; Poss, Michael: Robust network design with uncertain outsourcing cost (2015)
- Adasme, Pablo; Lisser, Abdel: Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (2014)
- Balogh, József; Hu, Ping; Lidický, Bernard; Liu, Hong: Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (2014)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie: A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (2014)
- Fages, Jean-Guillaume; Lapègue, Tanguy: Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (2014)
- Galli, Laura; Letchford, Adam N.: A compact variant of the QCR method for quadratically constrained quadratic $0-1$ programs (2014)
- Kumagai, Atsuya: Extension of classical MDS to treat dissimilarities not satisfying axioms of distance (2014)
- Peet, Matthew M.; Seuret, Alexandre: Global stability analysis of nonlinear sampled-data systems using convex methods (2014)
- Anjos, Miguel F.; Ghaddar, Bissan; Hupp, Lena; Liers, Frauke; Wiegele, Angelika: Solving $k$-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method (2013)