Reduction of symmetric semidefinite programs using the regular -representation
From MaRDI portal
Publication:868475
DOI10.1007/S10107-006-0039-7zbMATH Open1200.90136OpenAlexW1965094948WikidataQ56874373 ScholiaQ56874373MaRDI QIDQ868475FDOQ868475
Authors: E. de Klerk, Dmitrii V. Pasechnik, Alexander Schrijver 
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
Recommendations
- Symmetry in semidefinite programs
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Symmetry groups, semidefinite programs, and sums of squares
- Exploiting symmetry in copositive programs via semidefinite hierarchies
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- CSDP, A C library for semidefinite programming
- Title not available (Why is that?)
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Strengthened semidefinite programming bounds for codes
- Title not available (Why is that?)
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- The crossing number of K5,n
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- On a problem of P. Turan concerning graphs
Cited In (54)
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- A branch-and-cut approach to the crossing number problem
- A dynamic inequality generation scheme for polynomial programming
- Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\)
- Book drawings of complete bipartite graphs
- Upper bounds on algebraic connectivity via convex optimization
- Group symmetry and covariance regularization
- On the decay of crossing numbers of sparse graphs
- The crossing number of \(K_{1,m,n}\)
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- Perturbation analysis for matrix joint block diagonalization
- The Crossing Number of Graphs: Theory and Computation
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting group symmetry in truss topology optimization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- The crossing number of the cone of a graph
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Remarks on a conjecture of Barát and Tóth
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Closing in on Hill's conjecture
- On the tightness of SDP relaxations of QCQPs
- Drawing complete multipartite graphs on the plane with restrictions on crossings
- Symmetric sums of squares over \(k\)-subset hypercubes
- Copositive optimization -- recent developments and applications
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Simultaneous singular value decomposition
- The rectilinear local crossing number of \(K_{n}\)
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Strengthened semidefinite programming bounds for codes
- A note on the stability number of an orthogonality graph
- The optimal drawings of \(K_{5,n}\)
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Reduction of truss topology optimization
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- The crossing number of the cone of a graph
- On the Turing model complexity of interior point methods for semidefinite programming
- On crossing numbers of geometric proximity graphs
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Symmetry in semidefinite programs
- Using symmetry to optimize over the Sherali-Adams relaxation
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Introduction to semidefinite, conic and polynomial optimization
- A comprehensive analysis of polyhedral lift-and-project methods
- Mathematical properties of the regular \(^*\)-representation of matrix \(*\)-algebras with applications to semidefinite programming
- The 2-page crossing number of \(K_{n}\)
- Invariant Semidefinite Programs
- New bounds for truthful scheduling on two unrelated selfish machines
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- A survey of graphs with known or bounded crossing numbers
Uses Software
This page was built for publication: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868475)
