A decomposition algorithm for KYP-SDPs

zbMath1264.93032MaRDI QIDQ1937316

Yanyan Li

Publication date: 28 February 2013

Published in: European Journal of Control (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-56211

zbMATH Keywords

Lagrangian relaxationdecompositionsemidefinite programmingKalman-Yakobovic-Popov lemmalinear matrix inequalitiy

Mathematics Subject Classification ID

Semidefinite programming (90C22) System structure simplification (93B11)

Uses Software

• SeDuMi
• YALMIP
• KYPD
• Algorithm 432
• QDES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Newton's method for convex programming and Tschebyscheff approximation
• On the Kalman-Yakubovich-Popov lemma
• Specialized fast algorithms for IQC feasibility and optimization problems.
• A cutting plane method for solving KYP-SDPs
• The Cutting-Plane Method for Solving Convex Programs
• Linear Matrix Inequalities in System and Control Theory
• System analysis via integral quadratic constraints
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
• Multiple objective optimal control of linear systems: the quadratic norm case
• Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
• Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A decomposition algorithm for KYP-SDPs