An oracle for the discrete-time integral quadratic constraint problem

DOI10.1016/J.AUTOMATICA.2019.05.023MaRDI QIDQ2280816zbMATH OpenOpenAlexWikidataFDO

Authors Dany Abou Jaoude, Mark C. Palframan, Mazen Farhood

Publication date 19 December 2019

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.automatica.2019.05.023

zbMATH Keywords

analytic center cutting plane methoddiscrete-time controlextended symplectic matrix pencilintegral quadratic constraintsKalman-Yakubovich-Popov lemmarobustness analysis

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Discrete-time control/observation systems (93C55)

Recommendations

• Specialized fast algorithms for IQC feasibility and optimization problems.
• IQC analysis and synthesis via nonsmooth optimization
• Robust stability analysis for discrete-time system -- an integral quadratic constraints approach
• Robust stability and performance analysis based on integral quadratic constraints
• A cutting plane algorithm for robustness analysis of periodically time-varying systems

Cites work

• A cutting plane algorithm for convex programming that uses analytic centers
• A cutting plane method for solving KYP-SDPs
• A Potential Reduction Algorithm Allowing Column Generation
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
• Complexity analysis of the analytic center cutting plane method that uses multiple cuts
• Geometric algorithms and combinatorial optimization.
• scientific article; zbMATH DE number 1001726 (Why is no real title available?)
• scientific article; zbMATH DE number 53598 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
• IQC-based robustness analysis of discrete-time linear time-varying systems
• Multiple cuts in the analytic center cutting plane method
• On computing the stabilizing solution of the discrete-time Riccati equation
• On the Kalman-Yakubovich-Popov lemma
• On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
• Robustness analysis of uncertain discrete-time systems with dissipation inequalities and integral quadratic constraints
• Sampling method for semidefinite programmes with non-negative Popov function constraints
• Semidefinite Programming
• Shallow, deep and very deep cuts in the analytic center cutting plane method.
• Specialized fast algorithms for IQC feasibility and optimization problems.
• System analysis via integral quadratic constraints

Describes a project that uses

Uses Software

• YALMIP
• KYPD
• QDES

This page was built for publication: An oracle for the discrete-time integral quadratic constraint problem

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