CSDP, A C library for semidefinite programming
From MaRDI portal
Recommendations
- SDPLIB 1.2, a library of semidefinite programming test problems
- A new library of structured semidefinite programming instances
- SDPA PROJECT : SOLVING LARGE-SCALE SEMIDEFINITE PROGRAMS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- scientific article; zbMATH DE number 1047682
- Semidefinite programming
- Semidefinite programming
- Semidefinite Programming
- Algorithm 875
- Solving semidefinite-quadratic-linear programs using SDPT3
Cites work
Cited in
(only showing first 100 items - show all)- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- CSDP
- An independent benchmarking of SDP and SOCP solvers
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On the maximum density of fixed strongly connected subtournaments
- Visualizing network communities with a semi-definite programming method
- On the Lovász theta function and some variants
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- An exact algorithm for graph partitioning
- Separation and relaxation for cones of quadratic forms
- Maxi-Min discriminant analysis via online learning
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- Convex optimization under combinatorial sparsity constraints
- On the inducibility of oriented graphs on four vertices
- Maximum number of almost similar triangles in the plane
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- A class of spectral bounds for max \(k\)-cut
- Sums of squares in Macaulay2
- Outer approximation with conic certificates for mixed-integer convex problems
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Stable local dimensionality reduction approaches
- Spectral dimensionality reduction for Bregman information
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- Minimum number of edges that occur in odd cycles
- On fractional cut covers
- Spectral bounds for graph partitioning with prescribed partition sizes
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Computing sum of squares decompositions with rational coefficients
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- A sums-of-squares extension of policy iterations
- An exact semidefinite programming approach for the max-mean dispersion problem
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
- Extension of classical MDS to treat dissimilarities not satisfying axioms of distance
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Exploiting semidefinite relaxations in constraint programming
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Semidefinite programming relaxations and algebraic optimization in control
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Copositivity cuts for improving SDP bounds on the clique number
- Linear matrix inequalities in control systems with uncertainty
- Minimizing the sum of many rational functions
- The state-of-the-art in conic optimization software
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Global approaches for facility layout and VLSI floorplanning
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- A coordinate ascent method for solving semidefinite relaxations of non-convex quadratic integer programs
- Exact solution methods for the k-item quadratic knapsack problem
- Engineering branch-and-cut algorithms for the equicut problem
- Global stability analysis of nonlinear sampled-data systems using convex methods
- Numerical study of semidefinite bounds for the k-cluster problem
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- Linear programming relaxations of quadratically constrained quadratic programs
- Hybrid tools for hybrid systems -- proving stability and safety at once
- Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
- Balancing weight-balanced trees
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- Hypergraphs do jump
- SDPTools: a high precision SDP solver in \texttt{Maple}
- DC Programming Approaches for BMI and QMI Feasibility Problems
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Optimization Schemes For Wireless Sensor Network Localization
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- Fast implementation for semidefinite programs with positive matrix completion
- Finding graph embeddings by incremental low-rank semidefinite programming
- Algorithm 875
- New upper bounds for kissing numbers from semidefinite programming
- Towards Component Based Design of Hybrid Systems: Safety and Stability
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity
- Stochastic nuclear outages semidefinite relaxations
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Abstract interpretation meets convex optimization
- scientific article; zbMATH DE number 1489802 (Why is no real title available?)
- CSDP 2.3 user's guide
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Sum-of-squares optimization without semidefinite programming
- Monochromatic triangles in three-coloured graphs
- A new branch-and-bound algorithm for standard quadratic programming problems
- Global solution of non-convex quadratically constrained quadratic programs
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Semidefinite relaxation for linear programs with equilibrium constraints
- Solving Natural Conic Formulations with Hypatia.jl
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- The triangle graph T₆ is not SPN
- Why is maximum clique often easy in practice?
- Semidefinite programming and Ramsey numbers
- Real World Verification
This page was built for publication: CSDP, A C library for semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4504795)
