Application of facial reduction to H ∞ state feedback control problem
From MaRDI portal
Publication:5742517
DOI10.1080/00207179.2017.1351625zbMath1414.93094arXiv1606.03529OpenAlexW2786355381MaRDI QIDQ5742517
Publication date: 15 May 2019
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.03529
Semidefinite programming (90C22) Feedback control (93B52) (H^infty)-control (93B36) System structure simplification (93B11)
Related Items (3)
Characterization of the dual problem of linear matrix inequality for H-infinity output feedback control problem via facial reduction ⋮ Reduction of SISO H-infinity output feedback control problem ⋮ Perturbation analysis of singular semidefinite programs and its applications to control problems
Uses Software
Cites Work
- Unnamed Item
- Facial reduction algorithms for conic optimization problems
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- All controllers for the general \({\mathcal H}_ \infty\) control problem: LMI existence conditions and state space formulas
- An exact duality theory for semidefinite programming and its complexity implications
- An independent benchmarking of SDP and SOCP solvers
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Approximation Algorithms and Semidefinite Programming
- The Singular $H_\infty $ Control Problem with Dynamic Measurement Feedback
- $H_\infty $-Control by State-Feedback for Plants with Zeros on the Imaginary Axis
- $H_\infty $-Optimization without Assumptions on Finite or Infinite Zeros
- Strong Duality for Semidefinite Programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- A paradox in bosonic energy computations via semidefinite programming relaxations
- Semidefinite programming duality and linear time-invariant systems
- Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
This page was built for publication: Application of facial reduction to H ∞ state feedback control problem
