Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma

DOI10.1007/10997703_12zbMath1070.90083OpenAlexW123338590MaRDI QIDQ4681655

No author found.

Publication date: 24 June 2005

Published in: Positive Polynomials in Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/10997703_12

zbMATH Keywords

semidefinite programmingprimal-dual interior-point methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51) Robust stability (93D09)

Related Items

Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Mixed norm H₂/H_∞ and entropy covariance control: a convex optimisation approach, Universal duality in conic convex optimization, Closed-form solutions of singular KYP lemma: strongly passive systems, and fast lossless trajectories, A cutting plane method for solving KYP-SDPs, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Memory-Efficient Structured Convex Optimization via Extreme Point Sampling, On the convergence of iterative learning control, Application of facial reduction to H _∞ state feedback control problem, An oracle for the discrete-time integral quadratic constraint problem, A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control

Uses Software

• Sdpsol
• SeDuMi
• SDPpack
• KYPD
• LMI toolbox