Cited in
(39)- Stability and stabilisation of a class of networked dynamic systems
- A framework for solving mixed-integer semidefinite programs
- Minimizing the sum of many rational functions
- Maximizing the algebraic connectivity of meshed electrical pathways used as current return network
- Sampling algebraic varieties for sum of squares programs
- Optimal experiment design in a filtering context with application to sampled network data
- Sampling method for semidefinite programmes with non-negative Popov function constraints
- Algorithm 875
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Encoding dissimilarity data for statistical model building
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Matrix-free convex optimization modeling
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance
- A branch‐and‐price approach to k‐clustering minimum biclique completion problem
- Sum of squares method for sensor network localization
- Low-rank exploitation in semidefinite programming for control
- CSDP
- SDPHA
- SDPA
- CHOMPACK
- COL
- SMCP
- SFSDP
- PENSDP
- Diet
- STRUL
- ABIP
- Interior-point method for nuclear norm approximation with application to system identification
- Conic mixed-integer rounding cuts
- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach
- A Minimax Theorem with Applications to Machine Learning, Signal Processing, and Finance
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
- Bregman primal-dual first-order method and application to sparse semidefinite programming
- A Newton-bracketing method for a simple conic optimization problem
- The state-of-the-art in conic optimization software
- On the Generation of Positivstellensatz Witnesses in Degenerate Cases
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- Generating cutting planes for mixed integer programming problems in a parallel computing environment
This page was built for software: DSDP5
