This chapter provides the reader with the necessary background for dealing with semidefinite programs which have symmetry. The basic theory is given and it is illustrated in applications from coding theory, combinatorics, geometry, and polynomial optimization
We survey how semidefinite programming can be used for finding good approximative solutions to hard ...
Copositive programming is a relative young field which has evolved into a highly active research are...
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the...
In the last years many results in the area of semidefinite programming were obtained for invariant (...
htmlabstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite pr...
Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP). In partic...
AbstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite progra...
AbstractWe investigate the representation of multivariate symmetric polynomials as sum of squares, a...
In semidefinite programming one minimizes a linear function subject to the constraint that an affine...
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 20...
Une nouvelle borne supérieure sur le cardinal des codes de sous-espaces d'un espace vectoriel fini e...
Automated invariant generation is a fundamental challenge in program analysis and verification, goin...
We discuss the use of semidefinite programming for combinatorial optimization problems. The main top...
We consider the classical problem of invariant generation for programs with polynomial assignments a...
We survey how semidefinite programming can be used for finding good approximative solutions to hard...
We survey how semidefinite programming can be used for finding good approximative solutions to hard ...
Copositive programming is a relative young field which has evolved into a highly active research are...
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the...
In the last years many results in the area of semidefinite programming were obtained for invariant (...
htmlabstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite pr...
Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP). In partic...
AbstractThis paper is a tutorial in a general and explicit procedure to simplify semidefinite progra...
AbstractWe investigate the representation of multivariate symmetric polynomials as sum of squares, a...
In semidefinite programming one minimizes a linear function subject to the constraint that an affine...
These lecture notes where presented as a course of the CIMPA summer school in Manila, July 20-30, 20...
Une nouvelle borne supérieure sur le cardinal des codes de sous-espaces d'un espace vectoriel fini e...
Automated invariant generation is a fundamental challenge in program analysis and verification, goin...
We discuss the use of semidefinite programming for combinatorial optimization problems. The main top...
We consider the classical problem of invariant generation for programs with polynomial assignments a...
We survey how semidefinite programming can be used for finding good approximative solutions to hard...
We survey how semidefinite programming can be used for finding good approximative solutions to hard ...
Copositive programming is a relative young field which has evolved into a highly active research are...
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the...
DOI
Add to ORKG