Reduction of symmetric semidefinite programs using the regular -representation
From MaRDI portal
Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
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
Cites work
- CSDP, A C library for semidefinite programming
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- Group symmetry in interior-point methods for semidefinite program
- scientific article; zbMATH DE number 3680516 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3305202 (Why is no real title available?)
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On a problem of P. Turan concerning graphs
- Strengthened semidefinite programming bounds for codes
- Symmetry groups, semidefinite programs, and sums of squares
- The crossing number of K5,n
Cited in
(57)- On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
- Exploiting group symmetry in truss topology optimization
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Symmetric sums of squares over \(k\)-subset hypercubes
- Group symmetry and covariance regularization
- Mathematical properties of the regular \(^*\)-representation of matrix \(*\)-algebras with applications to semidefinite programming
- On the tightness of SDP relaxations of QCQPs
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Perturbation analysis for matrix joint block diagonalization
- New bounds for truthful scheduling on two unrelated selfish machines
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- The rectilinear local crossing number of \(K_{n}\)
- The 2-page crossing number of \(K_{n}\)
- Simultaneous singular value decomposition
- Book drawings of complete bipartite graphs
- A dynamic inequality generation scheme for polynomial programming
- A note on the stability number of an orthogonality graph
- A comprehensive analysis of polyhedral lift-and-project methods
- Introduction to semidefinite, conic and polynomial optimization
- Invariant Semidefinite Programs
- On the Turing model complexity of interior point methods for semidefinite programming
- Asymptotically settling Zarankiewicz's conjecture in finite time, for each m
- An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization
- The crossing number of the cone of a graph
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Reduction of truss topology optimization
- On the decay of crossing numbers of sparse graphs
- Expressing combinatorial problems by systems of polynomial equations and Hilbert's Nullstellensatz
- The Crossing Number of Graphs: Theory and Computation
- Remarks on a conjecture of Barát and Tóth
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- The crossing number of the cone of a graph
- 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
- A survey of graphs with known or bounded crossing numbers
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Closing in on Hill's conjecture
- 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
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- On crossing numbers of geometric proximity graphs
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations
- Semidefinite programming and linear equations vs. homomorphism problems
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- An NPDo approach for principal joint block diagonalization
- 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
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Strengthened semidefinite programming bounds for codes
- A branch-and-cut approach to the crossing number problem
- Symmetry in semidefinite programs
- The crossing number of \(K_{1,m,n}\)
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)
