Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs

Related Items

Handling symmetries in mixed-integer semidefinite programs, A note on the SDP relaxation of the minimum cut problem

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Fast projection onto the simplex and the \(l_1\) ball
Clustering of high throughput gene expression data
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
A facial reduction algorithm for finding sparse SOS representations
A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
The MIN-cut and vertex separator problem
Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
A framework for solving VLSI graph layout problems
Copositive and semidefinite relaxations of the quadratic assignment problem
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Symmetry in semidefinite programs
Exploiting special structure in semidefinite programming: a survey of theory and applications
Regularizing the abstract convex program
QAPLIB - a quadratic assignment problem library
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
Semidefinite programming relaxations for the quadratic assignment problem
On the Slater condition for the SDP relaxations of nonconvex sets
Graph bisection revisited
ADMM for the SDP relaxation of the QAP
Group symmetry in interior-point methods for semidefinite program
Symmetry groups, semidefinite programs, and sums of squares
Semidefinite programming relaxations for the graph partitioning problem
A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
Dimension reduction for semidefinite programs via Jordan algebras
Deriving solution value bounds from the ADMM
Semidefinite programming and eigenvalue bounds for the graph partition problem
Relaxations of Combinatorial Problems Via Association Schemes
Invariant Semidefinite Programs
An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
On Solving the Quadratic Shortest Path Problem
Generalized Nested Dissection
A comparison of the Delsarte and Lovász bounds
Applications of a Planar Separator Theorem
Geometric Separators for Finite-Element Meshes
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Error Bounds for Linear Matrix Inequalities
Facial Reduction and Partial Polyhedrality
A note on strict complementarity for the doubly non-negative cone
A spectral approach to bandwidth and separator problems in graphs
SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
Pre- and Post-Processing Sum-of-Squares Programs in Practice
A Copositive Programming Approach to Graph Partitioning
Error Bounds and Singularity Degree in Semidefinite Programming
Algorithms and Computation
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem