Pages that link to "Item:Q847851"

The following pages link to Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851):

Displaying 40 items.

• A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
• Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems (Q296969) (← links)
• On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
• Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry (Q431008) (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) (← links)
• Semidefinite approximations for quadratic programs over orthogonal matrices (Q609564) (← links)
• A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming (Q623727) (← links)
• The MIN-cut and vertex separator problem (Q683339) (← links)
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) (← links)
• Faster, but weaker, relaxations for quadratically constrained quadratic programs (Q742292) (← links)
• Symmetry in semidefinite programs (Q958029) (← links)
• Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
• A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) (← links)
• Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
• ADMM for the SDP relaxation of the QAP (Q1741118) (← links)
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
• On semidefinite programming relaxations of maximum \(k\)-section (Q1925786) (← links)
• A new exact discrete linear reformulation of the quadratic assignment problem (Q1926740) (← links)
• On the tightness of SDP relaxations of QCQPs (Q2133408) (← links)
• Perturbation analysis for matrix joint block diagonalization (Q2273874) (← links)
• Alternative SDP and SOCP approximations for polynomial optimization (Q2287850) (← links)
• Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• Simultaneous singular value decomposition (Q2431173) (← links)
• Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
• Minimum energy configurations on a toric lattice as a quadratic assignment problem (Q2673239) (← links)
• Relaxations of Combinatorial Problems Via Association Schemes (Q2802525) (← links)
• Copositive Programming (Q2802526) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
• Symmetry in Mathematical Programming (Q2897300) (← links)
• An Algebraic Approach to Nonorthogonal General Joint Block Diagonalization (Q2957679) (← links)
• On New Classes of Nonnegative Symmetric Tensors (Q2968174) (← links)
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming (Q3009764) (← links)
• Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
• The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems (Q5084675) (← links)
• Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations (Q6039571) (← links)
• Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)