The following pages link to CSDP (Q12937):
Displaying 50 items.
- Applications of semidefinite programming (Q1294557) (← links)
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming (Q1349146) (← links)
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs (Q1411639) (← links)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results (Q1411643) (← links)
- An independent benchmarking of SDP and SOCP solvers (Q1411647) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- On the maximum density of fixed strongly connected subtournaments (Q1733920) (← links)
- Visualizing network communities with a semi-definite programming method (Q1750020) (← links)
- On the Lovász theta function and some variants (Q1751239) (← links)
- The Nesterov-Todd direction and its relation to weighted analytic centers (Q1879036) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Maxi-Min discriminant analysis via online learning (Q1942698) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization (Q1988893) (← links)
- Convex optimization under combinatorial sparsity constraints (Q2102824) (← links)
- On the inducibility of oriented graphs on four vertices (Q2138968) (← links)
- Maximum number of almost similar triangles in the plane (Q2144458) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Sums of squares in Macaulay2 (Q2184805) (← links)
- Outer approximation with conic certificates for mixed-integer convex problems (Q2195682) (← links)
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM (Q2231040) (← links)
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation (Q2251137) (← links)
- Stable local dimensionality reduction approaches (Q2270841) (← links)
- Spectral dimensionality reduction for Bregman information (Q2279965) (← links)
- A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- On fractional cut covers (Q2312658) (← links)
- A non-linear arithmetic procedure for control-command software verification (Q2324228) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Improving upper bounds for the clique number by non-valid inequalities (Q2340341) (← links)
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm (Q2354819) (← links)
- Computing sum of squares decompositions with rational coefficients (Q2378506) (← links)
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture (Q2385546) (← links)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- An exact semidefinite programming approach for the max-mean dispersion problem (Q2410030) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Extension of classical MDS to treat dissimilarities not satisfying axioms of distance (Q2452289) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- Semidefinite programming relaxations and algebraic optimization in control (Q2512289) (← links)
