Sampling method for semidefinite programmes with non-negative Popov function constraints
From MaRDI portal
Publication:5265682
DOI10.1080/00207179.2013.833366zbMath1357.93030OpenAlexW2023646621MaRDI QIDQ5265682
No author found.
Publication date: 28 July 2015
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-104286
semidefinite programminglinear matrix inequalityKalman-Yakubovich-Popov lemmasampling methodPopov function constraint
Related Items
An oracle for the discrete-time integral quadratic constraint problem ⋮ Semidefinite Representations of Gauge Functions for Structured Low-Rank Matrix Decomposition
Uses Software
Cites Work
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Linear matrix inequalities in robustness analysis with multipliers
- Numerical computation of a coprime factorization of a transfer function matrix
- A subspace algorithm for the identification of discrete time frequency domain power spectra
- Convex optimization problems involving finite autocorrelation sequences
- Specialized fast algorithms for IQC feasibility and optimization problems.
- A cutting plane method for solving KYP-SDPs
- Positivity and linear matrix inequalities
- Low-rank exploitation in semidefinite programming for control
- Dualize it: software for automatic primal and dual conversions of conic programs
- Computation of matrix fraction descriptions of linear time-invariant systems
- Linear Matrix Inequalities in System and Control Theory
- System analysis via integral quadratic constraints
- Optimization Problems over Positive Pseudopolynomial Matrices
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
- Positive polynomials and robust stabilization with fixed-order controllers
- Semidefinite programming duality and linear time-invariant systems
- An LMI condition for the robust stability of uncertain continuous-time linear systems
- On Stability of Discrete-Time LTI Systems With Varying Time Delays
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
- Positive trigonometric polynomials and signal processing applications
- An LMI condition for robust stability of polynomial matrix polytopes
