Polyhedral and semidefinite programming methods in combinatorial optimization
From MaRDI portal
Publication:611309
zbMath1207.90005MaRDI QIDQ611309
Publication date: 14 December 2010
Published in: Fields Institute Monographs (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Interior-point methods (90C51) Combinatorial optimization (90C27) Linear inequalities of matrices (15A39) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (25)
Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs ⋮ Certifying numerical estimates of spectral gaps ⋮ A bound on the Carathéodory number ⋮ Facial reduction algorithms for conic optimization problems ⋮ Facial Reduction and Partial Polyhedrality ⋮ Irreducible infeasible subsystems of semidefinite systems ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Semidefinite Approximation of Closed Convex Set ⋮ Guaranteed clustering and biclustering via semidefinite programming ⋮ Convexity of the image of a quadratic map via the relative entropy distance ⋮ On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Lift-and-project ranks of the set covering polytope of circulant matrices ⋮ Noisy Euclidean distance matrix completion with a single missing node ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Sum-of-squares hierarchies for binary polynomial optimization ⋮ Error Bounds and Singularity Degree in Semidefinite Programming ⋮ Coordinate Shadows of Semidefinite and Euclidean Distance Matrices
Uses Software
This page was built for publication: Polyhedral and semidefinite programming methods in combinatorial optimization
