Exploiting special structure in semidefinite programming: a survey of theory and applications
From MaRDI portal
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
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3543912 (Why is no real title available?)
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1182568 (Why is no real title available?)
- scientific article; zbMATH DE number 1981748 (Why is no real title available?)
- scientific article; zbMATH DE number 3014797 (Why is no real title available?)
- scientific article; zbMATH DE number 3239575 (Why is no real title available?)
- A comparison of the Delsarte and Lovász bounds
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Algorithmic Aspects of Vertex Elimination on Graphs
- Computing the Minimum Fill-In is NP-Complete
- Covariance selection for nonchordal graphs via chordal embedding
- Efficient decomposition of separable algebras.
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- Exploiting group symmetry in truss topology optimization
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Global optimization with polynomials and the problem of moments
- Group symmetry in interior-point methods for semidefinite program
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for kissing numbers from semidefinite programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- On Semidefinite Programming Relaxations of the Traveling Salesman Problem
- On the Shannon capacity of a graph
- Positive definite completions of partial Hermitian matrices
- QAPLIB - a quadratic assignment problem library
- Recent advances in the solution of quadratic assignment problems
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- Semidefinite optimization
- Semidefinite programming relaxations for the quadratic assignment problem
- Semidefinite programs and association schemes
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Strengthened semidefinite programming bounds for codes
- Sums of squares, moment matrices and optimization over polynomials
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in semidefinite programs
- The Evolution of the Minimum Degree Ordering Algorithm
- The sandwich theorem
- Toeplitz and circulant matrices: a review.
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(27)- The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
- Invariant Semidefinite Programs
- Strong practical stability and stabilization of uncertain discrete linear repetitive processes
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs
- On the estimation of the equilibrium points of uncertain nonlinear systems
- Low-rank exploitation in semidefinite programming for control
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- An iterative scheme for valid polynomial inequality generation in binary polynomial programming
- Dimension reduction for semidefinite programs via Jordan algebras
- Finding largest small polygons with gloptipoly
- Group symmetry in interior-point methods for semidefinite program
- Spectral representations of vertex transitive graphs, Archimedean solids and finite Coxeter groups
- Exploiting structured sparsity in large scale semidefinite programming problems
- Exploiting Algebraic Structure in Sum of Squares Programs
- Fundamental domains for symmetric optimization: construction and search
- Sufficient optimality conditions hold for almost all nonlinear semidefinite programs
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph
- A multilevel analysis of the Lasserre hierarchy
- Univariate parameterization for global optimization of mixed-integer polynomial problems
- A dynamic inequality generation scheme for polynomial programming
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Loraine – an interior-point solver for low-rank semidefinite programming
- A new library of structured semidefinite programming instances
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)