Pages that link to "Item:Q4681655"
From MaRDI portal
The following pages link to Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma (Q4681655):
Displaying 15 items.
- On the convergence of iterative learning control (Q518329) (← links)
- Universal duality in conic convex optimization (Q868444) (← links)
- A robust numerical method for the \(\gamma\)-iteration in \(H_{\infty}\) control (Q998193) (← links)
- A decomposition algorithm for KYP-SDPs (Q1937316) (← links)
- Discussion on: ``A decomposition algorithm for KYP-SDPs'' (Q1937317) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- An oracle for the discrete-time integral quadratic constraint problem (Q2280816) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- LFTB: an efficient algorithm to bound linear fractional transformations (Q2575247) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Mixed norm <i>H</i><sub>2</sub>/<i>H</i><sub>∞</sub> and entropy covariance control: a convex optimisation approach (Q5069035) (← links)
- Closed-form solutions of singular KYP lemma: strongly passive systems, and fast lossless trajectories (Q5113283) (← links)
- Memory-Efficient Structured Convex Optimization via Extreme Point Sampling (Q5154636) (← links)
- Application of facial reduction to <i>H</i> <sub>∞</sub> state feedback control problem (Q5742517) (← links)
- Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← links)
