Exploiting special structure in semidefinite programming: a survey of theory and applications
type: Item
instance of: scholarly article
title: Exploiting special structure in semidefinite programming: a survey of theory and applications
zbMATH Open document ID: 1177.90315
author: E. de Klerk
published in: European Journal of Operational Research
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 5645171
zbMATH Keywords: semidefinite programming
zbMATH Keywords: chordal sparsity
zbMATH Keywords: algebraic symmetry
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: COL
describes a project that uses: QAPLIB
describes a project that uses: CHOMPACK
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.01.025
OpenAlex ID: W2084148362
cites work: Recent advances in the solution of quadratic assignment problems
cites work: New upper bounds for kissing numbers from semidefinite programming
cites work: Exploiting group symmetry in truss topology optimization
cites work: Q5527032
cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
cites work: QAPLIB - a quadratic assignment problem library
cites work: Q4426037
cites work: Covariance selection for nonchordal graphs via chordal embedding
cites work: Q4119093
cites work: Efficient decomposition of separable algebras.
cites work: Symmetry groups, semidefinite programs, and sums of squares
cites work: The Evolution of the Minimum Degree Ordering Algorithm
cites work: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
cites work: Q3137758
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Semidefinite programs and association schemes
cites work: Q3425498
cites work: Positive definite completions of partial Hermitian matrices
cites work: Group symmetry in interior-point methods for semidefinite program
cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn
cites work: Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
cites work: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
cites work: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
cites work: Q4197641
cites work: The sandwich theorem
cites work: Global optimization with polynomials and the problem of moments
cites work: Q4400638
cites work: Q3601990
cites work: Strengthened semidefinite programming bounds for codes
cites work: On the Shannon capacity of a graph
cites work: A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
cites work: Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
cites work: Q3967358
cites work: Q4324980
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: A comparison of the Delsarte and Lovász bounds
cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
cites work: Q4126536
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming
cites work: Semidefinite optimization
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: Symmetry in semidefinite programs
cites work: Semidefinite Programming
cites work: Q4758117
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Semidefinite programming relaxations for the quadratic assignment problem
DOI: 10.1016/J.EJOR.2009.01.025
description: scientific article; zbMATH DE number 5645171