In the last years many results in the area of semidefinite programming were obtained for invariant (finite dimensional, or infinite dimensional) semidefinite programs - SDPs which have symmetry. This was done for a variety of problems and applications. The purpose of this handbook chapter is to give the reader the necessary background for dealing with semidefinite programs which have symmetry. Here the basic theory is given and it is illustrated in applications from coding theory, combinatorics, geometry, and polynomial optimization
In this paper a symmetric primal-dual transformation for positive semidefinite programming is propos...
We discuss the use of semidefinite programming for combinatorial optimization problems. The main top...
Copositive programming is a relative young field which has evolved into a highly active research are...
In the last years many results in the area of semidefinite programming were obtained for invariant (...
Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP). In partic...
htmlabstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite pr...
AbstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite progra...
In semidefinite programming one minimizes a linear function subject to the constraint that an affine...
AbstractWe investigate the representation of multivariate symmetric polynomials as sum of squares, a...
We propose a new method for simplifying semidefinite programs (SDP) inspired by symmetry reduction. ...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
Semidefinite programming (SDP) is an extension of linear programming, with vector variables replaced...
In this paper a symmetric primal-dual transformation for positive semidefinite programming is propos...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
Une nouvelle borne supérieure sur le cardinal des codes de sous-espaces d'un espace vectoriel fini e...
In this paper a symmetric primal-dual transformation for positive semidefinite programming is propos...
We discuss the use of semidefinite programming for combinatorial optimization problems. The main top...
Copositive programming is a relative young field which has evolved into a highly active research are...
In the last years many results in the area of semidefinite programming were obtained for invariant (...
Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP). In partic...
htmlabstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite pr...
AbstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite progra...
In semidefinite programming one minimizes a linear function subject to the constraint that an affine...
AbstractWe investigate the representation of multivariate symmetric polynomials as sum of squares, a...
We propose a new method for simplifying semidefinite programs (SDP) inspired by symmetry reduction. ...
An integer linear program (ILP) is symmetric if its variables can be permuted without changing the s...
Semidefinite programming (SDP) is an extension of linear programming, with vector variables replaced...
In this paper a symmetric primal-dual transformation for positive semidefinite programming is propos...
We consider the solution of nonlinear programs with nonlinear semidefiniteness constraints....
Une nouvelle borne supérieure sur le cardinal des codes de sous-espaces d'un espace vectoriel fini e...
In this paper a symmetric primal-dual transformation for positive semidefinite programming is propos...
We discuss the use of semidefinite programming for combinatorial optimization problems. The main top...
Copositive programming is a relative young field which has evolved into a highly active research are...