Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
From MaRDI portal
Publication:5281748
Recommendations
- Optimal Control for Polynomial Systems Using Matrix Sum of Squares Relaxations
- Convergent relaxations of polynomial optimization problems with noncommuting variables
- On the linear static output feedback problem: the annihilating polynomial approach
- Convex relaxations for \(\mathcal{L}_2\)-gain analysis of piecewise affine/polynomial systems
- Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
- Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis
- A cone complementarity linearization algorithm for static output-feedback and related problems
- A successive convex optimization method for bilinear matrix inequality problems and its application to static output‐feedback control
- Polynomial Input-Output Stability for Linear Systems
- Optimal Control of Polynomial Hybrid Systems via Convex Relaxations
Cited in
(55)- Some recent developments in spectrahedral computation
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- An augmented system approach to static output-feedback stabilization with ℋ︁∞performance for continuous-time plants
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- Sum of squares generalizations for conic sets
- On controlling the transient response of linear time invariant systems with fixed structure controllers
- A new approximation hierarchy for polynomial conic optimization
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
- Estimating the domain of attraction for non-polynomial systems via LMI optimizations
- Coherent quantum LQG control
- Robust \(\mathcal H_{2}\) static output feedback design starting from a parameter-dependent state feedback controller for time-invariant discrete-time polytopic systems
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- A convex optimization model for finding non-negative polynomials
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Static output feedback stabilization of uncertain rational nonlinear systems with input saturation
- A recursive algorithm of exactness verification of relaxations for robust SDPs
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Exploiting sparsity in SDP relaxation of polynomial optimization problems
- Convergent conic linear programming relaxations for cone convex polynomial programs
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- Robust stability, ℋ2 analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix
- Minimizer Extraction in Polynomial Optimization Is Robust
- Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities
- Globally optimal estimates for geometric reconstruction problems
- Parametrized matrix inequalities in analysis of linear dynamic systems
- Dual form reduction in the atomic optimization method
- The positive real lemma and construction of all realizations of generalized positive rational functions
- On the Kalman-Yakubovich-Popov lemma and the multidimensional models
- Atomic optimization. I: Search space transformation and one-dimensional problems
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- On calculation of norms of 2D-systems
- Robust stabilisation of polynomial systems with uncertain parameters
- \(H_\infty\) and \(H_2\) stabilisers via static output feedback based on coordinate transformations with free variables
- Robust stability of time-varying polytopic systems via parameter-dependent homogeneous Lyapunov functions
- A matrix Positivstellensatz with lifting polynomials
- Analog circuit design by nonconvex polynomial optimization: two design examples
- Parameter-varying state feedback control for discrete-time polytopic systems
- Positive trigonometric polynomials for strong stability of difference equations
- Computing lower rank approximations of matrix polynomials
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Bilinear matrix inequality approaches to robust guaranteed cost control for uncertain discrete-time delay system
- On the structure of generalized plant convexifying static \(H_\infty\) control problems
- 2D system analysis via dual problems and polynomial matrix inequalities
- Fuzzy guaranteed cost controller for trajectory tracking in nonlinear systems
- A semidefinite hierarchy for containment of spectrahedra
- Solving polynomial least squares problems via semidefinite programming relaxations
- On the synthesis of linear \(H_\infty\) filters for polynomial systems
- Semidefinite relaxations for semi-infinite polynomial programming
- Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
- Exact conic programming relaxations for a class of convex polynomial cone programs
- On the linear static output feedback problem: the annihilating polynomial approach
- Problems of computing norms of 2D systems
- Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023
- Computation of stable convex combinations of a set of matrices through LMIs with application in \(\mathcal{H}_\infty\) control of switched linear systems
- Approximation hierarchies for copositive cone over symmetric cone and their comparison
This page was built for publication: Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281748)
