Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
From MaRDI portal
Publication:258393
DOI10.3934/dcdsb.2015.20.2383zbMath1332.93291arXiv1408.5119OpenAlexW2126658944MaRDI QIDQ258393
Publication date: 10 March 2016
Published in: Discrete and Continuous Dynamical Systems. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.5119
convex optimizationpolynomial optimizationHandelman's theoremLyapunov stability analysisPolya's theorem
Semidefinite programming (90C22) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Robust stability (93D09)
Related Items (9)
Lyapunov function computation for autonomous linear stochastic differential equations using sum-of-squares programming ⋮ Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems ⋮ Sum of squares approach for nonlinear \(\operatorname{H}_\infty\) control ⋮ A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function ⋮ Computation and verification of contraction metrics for exponentially stable equilibria ⋮ Global optimization of polynomials over real algebraic sets ⋮ System specific triangulations for the construction of CPA Lyapunov functions ⋮ Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems ⋮ Review on computational methods for Lyapunov functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Existence of piecewise linear Lyapunov functions in arbitrary dimensions
- Certificates of positivity in the Bernstein basis
- Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents
- Representing polynomials by positive linear functions on compact convex polyhedra
- The \(K\)-moment problem for compact semi-algebraic sets
- Partial cylindrical algebraic decomposition for quantifier elimination
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Uniform denominators in Hilbert's seventeenth problem
- An effective version of Pólya's theorem on positive definite forms
- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Revised CPA method to compute Lyapunov functions for nonlinear systems
- Pólya's theorem with zeros
- On an extension of Pólya's Positivstellensatz
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions
- An existence result for polynomial solutions of parameter-dependent lmis
- Establishing stability and instability of matrix hypercubes
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Über die Zerlegung strikte definiter Formen in Quadrate
- Global Optimization with Polynomials and the Problem of Moments
- A quantitative Pólya's Theorem with corner zeros
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Positive Forms and Stability of Linear Time-Delay Systems
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- A linear matrix inequality approach to H∞ control
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Polynomials that are positive on an interval
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- LMI-based computation of optimal quadratic Lyapunov functions for odd polynomial systems
- A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
- QEPCAD B
- An Interior-Point Method for Semidefinite Programming
- Affine parameter-dependent Lyapunov functions and real parametric uncertainty
- Semidefinite Optimization and Convex Algebraic Geometry
- Analysis of Polynomial Systems With Time Delays via the Sum of Squares Decomposition
- An LMI condition for the robust stability of uncertain continuous-time linear systems
- Polynomially parameter-dependent Lyapunov functions for robust stability of polytopic systems: an LMI approach
- Parameter-Dependent LMIs in Robust Analysis: Characterization of Homogeneous Polynomially Parameter-Dependent Solutions Via LMI Relaxations
- A Converse Sum of Squares Lyapunov Result With a Degree Bound
- Solving Large-Scale Robust Stability Problems by Exploiting the Parallel Structure of Polya's Theorem
- On the absence of uniform denominators in Hilbert’s 17th problem
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
This page was built for publication: Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
