CSDP
From MaRDI portal
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
- Special issue: Third international conference on integration of artificial intelligence, and operations research techniques in constraint programming for combinatorial optimization problems (CPAIOR 2006), Cork, Ireland, May 31--June 2, 2006.Selected papers.
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- On filter-successive linearization methods for nonlinear semidefinite programming
- Applications of semidefinite programming
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- SDPSymmetryReduction.jl
- Hypatia.jl
- SDPLIB
- Sdpsol
- Sostools
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- An independent benchmarking of SDP and SOCP solvers
- Cardinality constrained minimum cut problems: complexity and algorithms.
- SDPHA
- LFTB
- Similarity and other spectral relations for symmetric cones
- SDPA
- MAX-2-SAT
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- SeDuMi
- VSDP
- SDPT3
- CVXOPT
- SparsePOP
- SDPpack
- PENNON
- GloptiPoly
- DSDP5
- YALMIP
- Benchmarks for Optimization Software
- SPOOLES
- QSDP
- SDPLR
- COL
- SFSDP
- ConicBundle
- PENSDP
- 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
- LMI toolbox
- ACCPM
- The Nesterov-Todd direction and its relation to weighted analytic centers
- Flagmatic
- SpeeDP
- 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
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization
- SDPARA
- SDP_S
- SBmethod
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization
- MaxCliqueDyn
- Outward rotations
- AtMostNValue
- ptsplib
- AllDifferent
- 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
- VMTL
- Jambox
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- Biq Mac
- 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
- SCANeR
- 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
- A non-linear arithmetic procedure for control-command software verification
- Spectral bounds for graph partitioning with prescribed partition sizes
- Improving upper bounds for the clique number by non-valid inequalities
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- RON
- 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
- LOLIB
- BiqMac
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Exploiting semidefinite relaxations in constraint programming
This page was built for software: CSDP
