CSDP, A C library for semidefinite programming
From MaRDI portal
Publication:4504795
DOI10.1080/10556789908805765zbMath0973.90524OpenAlexW1999613943MaRDI QIDQ4504795
Publication date: 5 December 2001
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805765
Semidefinite programming (90C22) Interior-point methods (90C51) Packaged methods for numerical algorithms (65Y15)
Related Items (only showing first 100 items - show all)
Learning Dynamical Systems with Side Information ⋮ On tripartite common graphs ⋮ Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints ⋮ Solving Natural Conic Formulations with Hypatia.jl ⋮ Fast implementation for semidefinite programs with positive matrix completion ⋮ Finding graph embeddings by incremental low-rank semidefinite programming ⋮ Three-point bounds for energy minimization ⋮ MathOptInterface: A Data Structure for Mathematical Optimization Problems ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ Feynman integrals from positivity constraints ⋮ Performance enhancements for a generic conic interior point algorithm ⋮ Semi-Infinite Programming using High-Degree Polynomial Interpolants and Semidefinite Programming ⋮ The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices ⋮ Solving Turán's tetrahedron problem for the ℓ2$\ell _2$‐norm ⋮ Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming ⋮ Using general triangle inequalities within quadratic convex reformulation method ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Sum-of-Squares Optimization without Semidefinite Programming ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ A new branch-and-bound algorithm for standard quadratic programming problems ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Semidefinite Programming and Ramsey Numbers ⋮ New upper bounds for kissing numbers from semidefinite programming ⋮ Semidefinite relaxation for linear programs with equilibrium constraints ⋮ Towards Component Based Design of Hybrid Systems: Safety and Stability ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Real World Verification ⋮ Flag algebras ⋮ Identifying redundant linear constraints in systems of linear matrix inequality constraints ⋮ A robust algorithm for semidefinite programming ⋮ Unnamed Item ⋮ Moment methods in energy minimization: New bounds for Riesz minimal energy problems ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Computational enhancements in low-rank semidefinite programming ⋮ Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones ⋮ SDPLIB 1.2, a library of semidefinite programming test problems ⋮ Sampling method for semidefinite programmes with non-negative Popov function constraints ⋮ Minimizing the sum of many rational functions ⋮ Numerical Study of Semidefinite Bounds for the k-cluster Problem ⋮ A problem of Erdős and Sós on 3-graphs ⋮ Relaxation methods for navigation satellites set optimization ⋮ A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access ⋮ Linear Programming Relaxations of Quadratically Constrained Quadratic Programs ⋮ A second-order cone cutting surface method: Complexity and application ⋮ On the inducibility of oriented graphs on four vertices ⋮ Exact quadratic convex reformulations of mixed-integer quadratically constrained problems ⋮ Computing sum of squares decompositions with rational coefficients ⋮ Maximum number of almost similar triangles in the plane ⋮ Conic mixed-integer rounding cuts ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ On verified numerical computations in convex programming ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Copositivity cuts for improving SDP bounds on the clique number ⋮ Implementation of a primal-dual method for SDP on a shared memory parallel architecture ⋮ Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster ⋮ DC Programming Approaches for BMI and QMI Feasibility Problems ⋮ Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation ⋮ On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods ⋮ Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity ⋮ Linear matrix inequalities in control systems with uncertainty ⋮ Stochastic nuclear outages semidefinite relaxations ⋮ A sums-of-squares extension of policy iterations ⋮ Semidefinite relaxations for non-convex quadratic mixed-integer programming ⋮ An exact semidefinite programming approach for the max-mean dispersion problem ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ A class of spectral bounds for max \(k\)-cut ⋮ Hybrid Tools for Hybrid Systems – Proving Stability and Safety at Once ⋮ Sums of squares in Macaulay2 ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ Noise reduction method for nonlinear signal based on maximum variance unfolding and its application to fault diagnosis ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones ⋮ Distance metric learning by minimal distance maximization ⋮ An efficient compact quadratic convex reformulation for general integer quadratic programs ⋮ Comparison of Quadratic Convex Reformulations to Solve the Quadratic Assignment Problem ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ An exact algorithm for graph partitioning ⋮ Separation and relaxation for cones of quadratic forms ⋮ Maxi-Min discriminant analysis via online learning ⋮ Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme ⋮ Abstract interpretation meets convex optimization ⋮ On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs ⋮ A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem ⋮ Monochromatic triangles in three-coloured graphs ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ 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 ⋮ Extending the QCR method to general mixed-integer programs ⋮ On the maximum density of fixed strongly connected subtournaments ⋮ \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM ⋮ A convex relaxation bound for subgraph isomorphism ⋮ Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks ⋮ Sums of squares based approximation algorithms for MAX-SAT ⋮ Supervised dimensionality reduction via sequential semidefinite programming ⋮ Return-mapping algorithms for associative isotropic hardening plasticity using conic optimization ⋮ Balancing weight-balanced trees ⋮ Visualizing network communities with a semi-definite programming method
Uses Software
Cites Work
This page was built for publication: CSDP, A C library for semidefinite programming
