LFTB: an efficient algorithm to bound linear fractional transformations
From MaRDI portal
Publication:2575247
DOI10.1007/s11081-005-6795-zzbMath1093.90036OpenAlexW2064078067MaRDI QIDQ2575247
Fernando D'Amato, Mario A. Rotea
Publication date: 8 December 2005
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-005-6795-z
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix computations.
- Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics
- Semidefinite optimization
- Computational complexity of μ calculation
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- A note on the calculation of step-lengths in interior-point methods for semidefinite programming