Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
From MaRDI portal
Publication:868475
DOI10.1007/S10107-006-0039-7zbMath1200.90136OpenAlexW1965094948WikidataQ56874373 ScholiaQ56874373MaRDI QIDQ868475
Etienne de Klerk, Dimitrii V. Pasechnik
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0039-7
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (52)
The rectilinear local crossing number of \(K_{n}\) ⋮ The Crossing Number of the Cone of a Graph ⋮ On the tightness of SDP relaxations of QCQPs ⋮ Copositive programming motivated bounds on the stability and the chromatic numbers ⋮ Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem ⋮ Upper bounds on algebraic connectivity via convex optimization ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ A note on the stability number of an orthogonality graph ⋮ The 2-page crossing number of \(K_{n}\) ⋮ Semidefinite programming relaxations for graph coloring and maximal clique problems ⋮ Strengthened semidefinite programming bounds for codes ⋮ Remarks on a conjecture of Barát and Tóth ⋮ A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming ⋮ An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization ⋮ The Crossing Number of the Cone of a Graph ⋮ Copositive optimization -- recent developments and applications ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ On crossing numbers of geometric proximity graphs ⋮ Simultaneous singular value decomposition ⋮ Symmetric sums of squares over \(k\)-subset hypercubes ⋮ Group symmetry and covariance regularization ⋮ Book drawings of complete bipartite graphs ⋮ The optimal drawings of \(K_{5,n}\) ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ Using symmetry to optimize over the Sherali-Adams relaxation ⋮ Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz ⋮ Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling ⋮ An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming ⋮ A branch-and-cut approach to the crossing number problem ⋮ Symmetry in semidefinite programs ⋮ Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) ⋮ Unnamed Item ⋮ Perturbation analysis for matrix joint block diagonalization ⋮ Reduction of truss topology optimization ⋮ Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming ⋮ A Comprehensive Analysis of Polyhedral Lift-and-Project Methods ⋮ The crossing number of \(K_{1,m,n}\) ⋮ Introduction to Semidefinite, Conic and Polynomial Optimization ⋮ Invariant Semidefinite Programs ⋮ A survey of graphs with known or bounded crossing numbers ⋮ New bounds for truthful scheduling on two unrelated selfish machines ⋮ On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming ⋮ On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs ⋮ The Crossing Number of Graphs: Theory and Computation ⋮ Closing in on Hill's Conjecture ⋮ Exploiting group symmetry in truss topology optimization ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory ⋮ Exploiting symmetry in copositive programs via semidefinite hierarchies ⋮ Univariate parameterization for global optimization of mixed-integer polynomial problems ⋮ A dynamic inequality generation scheme for polynomial programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strengthened semidefinite programming bounds for codes
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- CSDP, A C library for semidefinite programming
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- The crossing number of K5,n
- On a problem of P. Turan concerning graphs
This page was built for publication: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
