CSDP
From MaRDI portal
swMATH169MaRDI QIDQ12937FDOQ12937
Author name not available (Why is that?)
Official website: https://projects.coin-or.org/Csdp
Cited In (only showing first 100 items - show all)
- Sums of squares in Macaulay2
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Minimizing the sum of many rational functions
- Three-point bounds for energy minimization
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Computational enhancements in low-rank semidefinite programming
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Approximating optimization problems over convex functions
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Semidefinite programming for discrete optimization and matrix completion problems
- New Turán densities for 3-graphs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Robust \(\mathcal H_2\) performance analysis and synthesis of linear polytopic discrete-time periodic systems via LMIs
- Hypergraphs do jump
- On 3-hypergraphs with forbidden 4-vertex configurations
- Applications of semidefinite programming
- Supervised dimensionality reduction via sequential semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- PENNON: A code for convex nonlinear and semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- SDPLIB 1.2, a library of semidefinite programming test problems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- An independent benchmarking of SDP and SOCP solvers
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Interior-point method for nuclear norm approximation with application to system identification
- Solving large-scale least squares semidefinite programming by alternating direction methods
- Sdpsol
- SeDuMi
- SDPT3
- VSDP
- GloptiPoly
- DSDP5
- Benchmarks for Optimization Software
- COL
- QSDP
- SDPLR
- SFSDP
- YALMIP
- SPOOLES
- ConicBundle
- PENSDP
- LMI toolbox
- ACCPM
- Flagmatic
- SpeeDP
- SDPARA
- SBmethod
- SDP_S
- MaxCliqueDyn
- Outward rotations
- AllDifferent
- AtMostNValue
- ptsplib
- Jambox
- Biq Mac
- VMTL
- SCANeR
- RON
- BiqMac
- LOLIB
- CalCS
- CBLIB
- Decision tree for optimization software
- SOSOPT
- MADAM
- CONLIN
- Separation and relaxation for cones of quadratic forms
- DWD
- GpoSolver
- PARTY
- QETLAB
- BBMCW
- BOB
- EIQP IIQP
- MIQCR-CB
- Sp
- BiqCrunch
- SDPB
- Basc
- IQCP/MIQCP
- SOS.m2
- DensityChecker
- ExactDensityBounder
- DoubleFloats.jl
- alfonso
- DDS
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones
- MathOptInterface.jl
- A Solution to the 2/3 Conjecture
- Copositivity cuts for improving SDP bounds on the clique number
- On Convex Functions and the Finite Element Method
- Disciplined convex programming
- Algorithm 925, parallel solver for semidefinite programming problem having sparse Schur complement matrix
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- A robust algorithm for semidefinite programming
- Engineering branch-and-cut algorithms for the equicut problem
- Towards Automatic Convergence Verification of Self-stabilizing Algorithms
This page was built for software: CSDP
