Sampling method for semidefinite programmes with non-negative Popov function constraints

DOI10.1080/00207179.2013.833366zbMATH Open1357.93030OpenAlexW2023646621MaRDI QIDQ5265682FDOQ5265682

Authors:

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

Recommendations

• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• Applications of semidefinite programming
• Dual J-spectral factorization
• Robust Control via Sequential Semidefinite Programming
• Constrained polynomial optimization problems with noncommuting variables

zbMATH Keywords

semidefinite programminglinear matrix inequalityKalman-Yakubovich-Popov lemmasampling methodPopov function constraint

Mathematics Subject Classification ID

Semidefinite programming (90C22) Operator-theoretic methods (93B28)

Cites Work

• CSDP, A C library for semidefinite programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Solving semidefinite-quadratic-linear programs using SDPT3
• Linear Matrix Inequalities in System and Control Theory
• System analysis via integral quadratic constraints
• An LMI condition for the robust stability of uncertain continuous-time linear systems
• On Stability of Discrete-Time LTI Systems With Varying Time Delays
• Specialized fast algorithms for IQC feasibility and optimization problems.
• Semidefinite programming duality and linear time-invariant systems
• An LMI condition for robust stability of polynomial matrix polytopes
• Linear matrix inequalities in robustness analysis with multipliers
• Positivity and linear matrix inequalities
• Optimization Problems over Positive Pseudopolynomial Matrices
• Title not available (Why is that?)
• Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
• Positive polynomials and robust stabilization with fixed-order controllers
• Numerical computation of a coprime factorization of a transfer function matrix
• A subspace algorithm for the identification of discrete time frequency domain power spectra
• Computation of matrix fraction descriptions of linear time-invariant systems
• Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
• Convex optimization problems involving finite autocorrelation sequences
• A cutting plane method for solving KYP-SDPs
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
• Positive trigonometric polynomials and signal processing applications
• Dualize it: software for automatic primal and dual conversions of conic programs
• Low-rank exploitation in semidefinite programming for control

Cited In (4)

• Semi-definite programming and quantum information
• Title not available (Why is that?)
• Semidefinite representations of gauge functions for structured low-rank matrix decomposition
• An oracle for the discrete-time integral quadratic constraint problem

Uses Software

• SDPT3
• DSDP5
• Mu Analysis and Synthesis Toolbox

This page was built for publication: Sampling method for semidefinite programmes with non-negative Popov function constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265682)