Cited in
(only showing first 100 items - show all)- Optimization and highly informative graph invariants
- A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
- Cardinality constrained minimum cut problems: complexity and algorithms.
- Solving Natural Conic Formulations with Hypatia.jl
- On the maximum density of fixed strongly connected subtournaments
- Relaxation methods for navigation satellites set optimization
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- Latest Developments in the SDPA Family for Solving Large-Scale SDPs
- Global solution of non-convex quadratically constrained quadratic programs
- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Distance metric learning by minimal distance maximization
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming in Finite Precision
- A non-linear arithmetic procedure for control-command software verification
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
- Automating Verification of Cooperation, Control, and Design in Traffic Applications
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Outer approximation with conic certificates for mixed-integer convex problems
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Smaller SDP for SOS decomposition
- 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.
- A convex relaxation bound for subgraph isomorphism
- Primal-dual affine-scaling algorithms fail for semidefinite programming
- On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices
- A robust algorithm for semidefinite programming
- Towards Automatic Convergence Verification of Self-stabilizing Algorithms
- 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
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Preprocessing sparse semidefinite programs via matrix completion
- A hybrid constraint programming and semidefinite programming approach for the stable set problem
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- A parallel interior point decomposition algorithm for block angular semidefinite programs
- Algorithm 875
- Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Linear matrix inequalities in control systems with uncertainty
- On verified numerical computations in convex programming
- A class of spectral bounds for max \(k\)-cut
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- Hypatia.jl
- SDPSymmetryReduction.jl
- On the Lovász theta function and some variants
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- A sums-of-squares extension of policy iterations
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- An exact semidefinite programming approach for the max-mean dispersion problem
- Maxi-Min discriminant analysis via online learning
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- A team algorithm for robust stability analysis and control design of certain time-varying linear systems using piecewise quadratic Lyapunov functions
- Visualizing network communities with a semi-definite programming method
- Engineering branch-and-cut algorithms for the equicut problem
- A second-order cone cutting surface method: Complexity and application
- Sums of squares in Macaulay2
- On Convex Functions and the Finite Element Method
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Semidefinite programming for discrete optimization and matrix completion problems
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- On filter-successive linearization methods for nonlinear semidefinite programming
- New Turán densities for 3-graphs
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- SDPLIB
- Sdpsol
- Sostools
- SDPHA
- LFTB
- MAX-2-SAT
- SDPA
- SeDuMi
- SDPT3
- CVXOPT
- VSDP
- GloptiPoly
- DSDP5
- PENNON
- SDPpack
- Benchmarks for Optimization Software
- SparsePOP
- COL
- QSDP
- SDPLR
- SFSDP
- YALMIP
- SPOOLES
- ConicBundle
- PENSDP
- LMI toolbox
- ACCPM
- Flagmatic
- SpeeDP
- SDPARA
- SBmethod
This page was built for software: CSDP
