Semidefinite Approximations of the Polynomial Abscissa

DOI10.1137/15M1033198zbMath1351.90127arXiv1507.08463MaRDI QIDQ2813314

Roxana Hess, Tiên Sȯn Phạm, Jean-Bernard Lasserre, Didier Henrion

Publication date: 23 June 2016

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.08463

zbMATH Keywords

semidefinite programmingpolynomial approximationsnonconvex nonsmooth optimizationlinear systems controlsemialgebraic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Approximation by polynomials (41A10) Real polynomials: location of zeros (26C10)

Related Items (2)

A faster interior-point method for sum-of-squares optimization ⋮ Sum-of-Squares Optimization without Semidefinite Programming

Uses Software

• YALMIP
• Mosek
• Polynomial Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Variational analysis of the abscissa mapping for polynomials via the Gauss-Lucas theorem
• Ellipsoidal approximation of the stability domain of a polynomial
• Stabilization via Nonsmooth, Nonconvex Optimization
• Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
• Mathematical analysis II. Transl. from the 4th Russian edition by Roger Cooke

This page was built for publication: Semidefinite Approximations of the Polynomial Abscissa