Exploiting special structure in semidefinite programming: a survey of theory and applications
From MaRDI portal
Publication:1044129
DOI10.1016/J.EJOR.2009.01.025zbMATH Open1177.90315OpenAlexW2084148362MaRDI QIDQ1044129FDOQ1044129
Authors: E. de Klerk 
Publication date: 10 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.025
Recommendations
- Exploiting structured sparsity in large scale semidefinite programming problems
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Semidefinite Programming
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Applications of semidefinite programming
Cites Work
- QAPLIB - a quadratic assignment problem library
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- The Evolution of the Minimum Degree Ordering Algorithm
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Title not available (Why is that?)
- Semidefinite Programming
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- On the Shannon capacity of a graph
- Exploiting group symmetry in truss topology optimization
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Title not available (Why is that?)
- Semidefinite optimization
- Sums of squares, moment matrices and optimization over polynomials
- Title not available (Why is that?)
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Toeplitz and circulant matrices: a review.
- Positive definite completions of partial Hermitian matrices
- Title not available (Why is that?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Algorithmic Aspects of Vertex Elimination on Graphs
- Covariance selection for nonchordal graphs via chordal embedding
- The sandwich theorem
- Semidefinite programming relaxations for the quadratic assignment problem
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- A comparison of the Delsarte and Lovász bounds
- Computing the Minimum Fill-In is NP-Complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strengthened semidefinite programming bounds for codes
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Recent advances in the solution of quadratic assignment problems
- New upper bounds for kissing numbers from semidefinite programming
- Title not available (Why is that?)
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- Efficient decomposition of separable algebras.
- Semidefinite programs and association schemes
- Title not available (Why is that?)
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Symmetry in semidefinite programs
Cited In (27)
- A dynamic inequality generation scheme for polynomial programming
- A multilevel analysis of the Lasserre hierarchy
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- Strong practical stability and stabilization of uncertain discrete linear repetitive processes
- Exploiting structured sparsity in large scale semidefinite programming problems
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Low-rank exploitation in semidefinite programming for control
- Group symmetry in interior-point methods for semidefinite program
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Finding largest small polygons with gloptipoly
- A new library of structured semidefinite programming instances
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- On the estimation of the equilibrium points of uncertain nonlinear systems
- Exploiting Algebraic Structure in Sum of Squares Programs
- Fundamental domains for symmetric optimization: construction and search
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Loraine – an interior-point solver for low-rank semidefinite programming
- Dimension reduction for semidefinite programs via Jordan algebras
- Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Invariant Semidefinite Programs
Uses Software
This page was built for publication: Exploiting special structure in semidefinite programming: a survey of theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044129)
