Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
From MaRDI portal
(Redirected from Publication:258393)
Abstract: In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation Linear Techniques, Blossoming and Groebner basis methods, our main focus is on algorithms defined by Polya's theorem, Bernstein's theorem and Handelman's theorem. We first formulate polynomial optimization problems as verifying the feasibility of semi-algebraic sets. Then, we discuss how Polya's algorithm, Bernstein's algorithm and Handelman's algorithm reduce the intractable problem of feasibility of semi-algebraic sets to linear and/or semi-definite programming. We apply these algorithms to different problems in robust stability analysis and stability of nonlinear dynamical systems. As one contribution of this paper, we apply Polya's algorithm to the problem of H_infinity control of systems with parametric uncertainty. Numerical examples are provided to compare the accuracy of these algorithms with other polynomial optimization algorithms in the literature.
Recommendations
- Sums of squares, moment matrices and optimization over polynomials
- Stability and stabilization of polynomial dynamical systems using Bernstein polynomials
- Optimization of Polynomial Functions
- Robust \(H_{\infty}\) static output feedback controller design for parameter dependent polynomial systems: An iterative sums of squares approach
- Characterizing the solution set of polynomial systems in terms of homogeneous forms: an LMI approach
Cites work
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 1157649 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- A Converse Sum of Squares Lyapunov Result With a Degree Bound
- A Convex Approach to Robust Stability for Linear Systems with Uncertain Scalar Parameters
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A linear matrix inequality approach to H∞ control
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- A quantitative Pólya's Theorem with corner zeros
- Affine parameter-dependent Lyapunov functions and real parametric uncertainty
- An Interior-Point Method for Semidefinite Programming
- An LMI condition for the robust stability of uncertain continuous-time linear systems
- An effective version of Pólya's theorem on positive definite forms
- An existence result for polynomial solutions of parameter-dependent lmis
- Analysis of Polynomial Systems With Time Delays via the Sum of Squares Decomposition
- Certificates for nonnegativity of polynomials with zeros on compact semialgebraic sets
- Certificates of positivity in the Bernstein basis
- Computation of polytopic invariants for polynomial dynamical systems using linear programming
- Establishing stability and instability of matrix hypercubes
- Existence of piecewise linear Lyapunov functions in arbitrary dimensions
- Global optimization with polynomials and the problem of moments
- Impossibility of extending Pólya's theorem to ``forms with arbitrary real exponents
- LMI-based computation of optimal quadratic Lyapunov functions for odd polynomial systems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On an extension of Pólya's Positivstellensatz
- On the absence of uniform denominators in Hilbert’s 17th problem
- Parameter-Dependent LMIs in Robust Analysis: Characterization of Homogeneous Polynomially Parameter-Dependent Solutions Via LMI Relaxations
- Partial cylindrical algebraic decomposition for quantifier elimination
- Polynomially parameter-dependent Lyapunov functions for robust stability of polytopic systems: an LMI approach
- Polynomials that are positive on an interval
- Positive Forms and Stability of Linear Time-Delay Systems
- Positivity and sums of squares: a guide to recent results
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Pólya's theorem with zeros
- QEPCAD B
- Reachability analysis of polynomial systems using linear programming relaxations
- Representing polynomials by positive linear functions on compact convex polyhedra
- Revised CPA method to compute Lyapunov functions for nonlinear systems
- Semidefinite Optimization and Convex Algebraic Geometry
- Solving Large-Scale Robust Stability Problems by Exploiting the Parallel Structure of Polya's Theorem
- Solving semidefinite-quadratic-linear programs using SDPT3
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions
- Sums of squares, moment matrices and optimization over polynomials
- The K-moment problem for compact semi-algebraic sets
- Uniform denominators in Hilbert's seventeenth problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Über die Zerlegung strikte definiter Formen in Quadrate
Cited in
(15)- Review on computational methods for Lyapunov functions
- Co-design of aperiodic sampled-data min-jumping rules for linear impulsive, switched impulsive and sampled-data systems
- A globally asymptotically stable polynomial vector field with rational coefficients and no local polynomial Lyapunov function
- Global optimization of polynomials over real algebraic sets
- Stability Region Analysis Using Polynomial and Composite Polynomial Lyapunov Functions and Sum-of-Squares Programming
- Computation and verification of contraction metrics for exponentially stable equilibria
- Lyapunov function computation for autonomous linear stochastic differential equations using sum-of-squares programming
- System specific triangulations for the construction of CPA Lyapunov functions
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- Dwell-time stability and stabilization conditions for linear positive impulsive and switched systems
- scientific article; zbMATH DE number 412070 (Why is no real title available?)
- Safe nonlinear control design for input constrained polynomial systems using sum-of-squares programming
- Control Applications of Sum of Squares Programming
- Sum of squares approach for nonlinear \(\operatorname{H}_\infty\) control
- Optimal Control for Polynomial Systems Using Matrix Sum of Squares Relaxations
This page was built for publication: Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q258393)
