Discussion on: ``A decomposition algorithm for KYP-SDPs

DOI10.1016/S0947-3580(12)70947-0zbMath1258.93041MaRDI QIDQ1937317

Yasuaki Oishi

Publication date: 28 February 2013

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

Full work available at URL: https://doi.org/10.1016/s0947-3580(12)70947-0

zbMATH Keywords

semidefinite programming problem; KYP lemma; algorithm for KYP-SDPs

Mathematics Subject Classification ID

90C22: Semidefinite programming

93B11: System structure simplification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems
• Positive polynomials in control.
• Homogeneous polynomial forms for robustness analysis of uncertain systems
• Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
• Poincaré wave equations as Fourier transforms of Galilei wave equations
• Consensus and Cooperation in Networked Multi-Agent Systems
• Constrained Consensus and Optimization in Multi-Agent Networks
• Convergence Speed in Distributed Consensus and Averaging
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity