KYPD

KYPD: a solver for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma Semidefinite programs derived from the Kalman-Yakubovich-Popov lemma are quite common in control and signal processing applications. The programs are often of high dimension making them hard or impossible to solve with general-purpose solvers. KYPD is a customized solver for KYP-SDPs that utilizes the inherent structure of the optimization problem thus improving efficiency significantly. (Source: http://plato.asu.edu)

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 7 articles )

Showing results 1 to 7 of 7.
Sorted by year (citations)

  1. Abou Jaoude, Dany; Palframan, Mark C.; Farhood, Mazen: An oracle for the discrete-time integral quadratic constraint problem (2019)
  2. Falkeborn, Rikard; Hansson, Anders: A decomposition algorithm for KYP-SDPs (2012)
  3. Johansson, Janne Harju; Hansson, Anders: An inexact interior-point method for system analysis (2010)
  4. Wallin, Ragnar; Hansson, Anders; Johansson, Janne Harju: A structure exploiting preprocessor for semidefinite programs derived from the Kalman-Yakubovich-Popov lemma (2009)
  5. Wallin, Ragnar; Kao, Chung-Yao; Hansson, Anders: A cutting plane method for solving KYP-SDPs (2008)
  6. Kao, Chung-Yao; Megretski, Alexandre: On the new barrier function and specialized algorithms for a class of semidefinite programs (2007)
  7. Vandenberghe, Lieven; Balakrishnan, V. Ragu; Wallin, Ragnar; Hansson, Anders; Roh, Tae: Interior-point algorithms for semidefinite programming problems derived from the KYP lemma (2005)