Pages that link to "Item:Q4504795"
From MaRDI portal
The following pages link to CSDP, A C library for semidefinite programming (Q4504795):
Displaying 50 items.
- CSDP (Q12937) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Minimizing the sum of many rational functions (Q266410) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (Q304240) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Welfare-maximizing correlated equilibria using Kantorovich polynomials with sparsity (Q367164) (← links)
- Stochastic nuclear outages semidefinite relaxations (Q373211) (← links)
- Semidefinite relaxations for non-convex quadratic mixed-integer programming (Q378112) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Monochromatic triangles in three-coloured graphs (Q463289) (← links)
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks (Q490355) (← links)
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Noise reduction method for nonlinear signal based on maximum variance unfolding and its application to fault diagnosis (Q617244) (← links)
- Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones (Q621748) (← links)
- Distance metric learning by minimal distance maximization (Q622006) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- Relaxation methods for navigation satellites set optimization (Q828566) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- Supervised dimensionality reduction via sequential semidefinite programming (Q947992) (← links)
- Approximating optimization problems over convex functions (Q957934) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code (Q1003633) (← links)
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps (Q1011505) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← 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)
- 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)
