A decomposition algorithm for KYP-SDPs
From MaRDI portal
Recommendations
- Discussion on: ``A decomposition algorithm for KYP-SDPs
- A cutting plane method for solving KYP-SDPs
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- On the New Barrier Function and Specialized Algorithms for a Class of Semidefinite Programs
- Low-rank exploitation in semidefinite programming for control
Cites work
- scientific article; zbMATH DE number 53598 (Why is no real title available?)
- scientific article; zbMATH DE number 2084780 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- A Structure Exploiting Preprocessor for Semidefinite Programs Derived From the Kalman-Yakubovich-Popov Lemma
- A cutting plane method for solving KYP-SDPs
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Linear Matrix Inequalities in System and Control Theory
- Multiple objective optimal control of linear systems: the quadratic norm case
- Newton's method for convex programming and Tschebyscheff approximation
- On the Kalman-Yakubovich-Popov lemma
- Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
- Specialized fast algorithms for IQC feasibility and optimization problems.
- System analysis via integral quadratic constraints
- The Cutting-Plane Method for Solving Convex Programs
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(2)
This page was built for publication: A decomposition algorithm for KYP-SDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937316)
