Sciweavers

8 search results - page 1 / 2
» Strong duality in Lasserre's hierarchy for polynomial optimi...
Sort
View
CORR
2011
Springer
176views Education» more  CORR 2011»
12 years 10 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre
CORR
2011
Springer
173views Education» more  CORR 2011»
12 years 10 months ago
Exploiting symmetries in SDP-relaxations for polynomial optimization
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
Cordian Riener, Thorsten Theobald, Lina Jansson An...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 6 months ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...
SIAMCO
2008
96views more  SIAMCO 2008»
13 years 3 months ago
Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control constraints and cost are all described by...
Jean B. Lasserre, Didier Henrion, Christophe Prieu...
CORR
2008
Springer
125views Education» more  CORR 2008»
13 years 3 months ago
Semidefinite programming for N-Player Games
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
Rida Laraki, Jean B. Lasserre