Exploiting special structure in semidefinite programming: a survey of theory and applications
From MaRDI portal
Publication:1044129
DOI10.1016/j.ejor.2009.01.025zbMath1177.90315OpenAlexW2084148362MaRDI QIDQ1044129
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
Related Items
Sufficient optimality conditions hold for almost all nonlinear semidefinite programs, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, Finding largest small polygons with gloptipoly, Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, Dimension reduction for semidefinite programs via Jordan algebras, New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph, The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices, Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems, A multilevel analysis of the Lasserre hierarchy, Strong practical stability and stabilization of uncertain discrete linear repetitive processes, An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming, On the estimation of the equilibrium points of uncertain nonlinear systems, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Invariant Semidefinite Programs, Fundamental Domains for Symmetric Optimization: Construction and Search, Semidefinite programming and eigenvalue bounds for the graph partition problem, Univariate parameterization for global optimization of mixed-integer polynomial problems, A dynamic inequality generation scheme for polynomial programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Positive definite completions of partial Hermitian matrices
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Symmetry in semidefinite programs
- Exploiting group symmetry in truss topology optimization
- The sandwich theorem
- QAPLIB - a quadratic assignment problem library
- Semidefinite programming relaxations for the quadratic assignment problem
- Recent advances in the solution of quadratic assignment problems
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Efficient decomposition of separable algebras.
- Group symmetry in interior-point methods for semidefinite program
- Symmetry groups, semidefinite programs, and sums of squares
- Semidefinite programs and association schemes
- Global Optimization with Polynomials and the Problem of Moments
- Semidefinite optimization
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- The Evolution of the Minimum Degree Ordering Algorithm
- A comparison of the Delsarte and Lovász bounds
- Computing the Minimum Fill-In is NP-Complete
- Algorithmic Aspects of Vertex Elimination on Graphs
- On the Shannon capacity of a graph
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Covariance selection for nonchordal graphs via chordal embedding
