Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
From MaRDI portal
Publication:5281748
DOI10.1109/TAC.2005.863494zbMath1366.93180OpenAlexW2140357316MaRDI QIDQ5281748
Jean-Bernard Lasserre, Didier Henrion
Publication date: 27 July 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2005.863494
Related Items
On calculation of norms of 2D-systems, Globally optimal estimates for geometric reconstruction problems, Some Recent Developments in Spectrahedral Computation, A recursive algorithm of exactness verification of relaxations for robust SDPs, Minimizer Extraction in Polynomial Optimization Is Robust, Solving polynomial least squares problems via semidefinite programming relaxations, Dual form reduction in the atomic optimization method, Robust stability of time-varying polytopic systems via parameter-dependent homogeneous Lyapunov functions, Robust stability, ℋ2 analysis and stabilisation of discrete-time Markov jump linear systems with uncertain probability matrix, On Controlling the Transient Response of Linear Time Invariant Systems with Fixed Structure Controllers, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, On the Kalman-Yakubovich-Popov lemma and the multidimensional models, Problems of computing norms of 2D systems, Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates, An augmented system approach to static output-feedback stabilization with ℋ︁∞performance for continuous-time plants, Sum of squares generalizations for conic sets, Atomic optimization. II. Multidimensional problems and polynomial matrix inequalities, A new approximation hierarchy for polynomial conic optimization, Real algebraic geometry with a view toward Koopman operator methods. Abstracts from the workshop held March 12--17, 2023, New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023, Positive trigonometric polynomials for strong stability of difference equations, A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming, Approximation hierarchies for copositive cone over symmetric cone and their comparison, Exact SDP relaxations for classes of nonlinear semidefinite programming problems, Atomic optimization. I: Search space transformation and one-dimensional problems, On the synthesis of linear \(H_\infty\) filters for polynomial systems, On the structure of generalized plant convexifying static \(H_\infty\) control problems, Estimating the domain of attraction for non-polynomial systems via LMI optimizations, Semidefinite relaxations for semi-infinite polynomial programming, 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, The positive real lemma and construction of all realizations of generalized positive rational functions, Parameter-varying state feedback control for discrete-time polytopic systems, 2D system analysis via dual problems and polynomial matrix inequalities, Analog circuit design by nonconvex polynomial optimization: Two design examples, Exact conic programming relaxations for a class of convex polynomial cone programs, Robust stabilisation of polynomial systems with uncertain parameters, Bilinear matrix inequality approaches to robust guaranteed cost control for uncertain discrete‐time delay system, Coherent quantum LQG control, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion, Parametrized matrix inequalities in analysis of linear dynamic systems, H∞andH2stabilisers via static output feedback based on coordinate transformations with free variables, Computing lower rank approximations of matrix polynomials, A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones, A convex optimization model for finding non-negative polynomials, Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems, A Matrix Positivstellensatz with Lifting Polynomials, Robust ℋ︁2 static output feedback design starting from a parameter-dependent state feedback controller for time-invariant discrete-time polytopic systems, GpoSolver: a Matlab/C++ toolbox for global polynomial optimization, Fuzzy guaranteed cost controller for trajectory tracking in nonlinear systems, Static output feedback stabilization of uncertain rational nonlinear systems with input saturation, A Semidefinite Hierarchy for Containment of Spectrahedra, Rank-constrained fundamental matrix estimation by polynomial global optimization versus the eight-point algorithm
