LFTB: an efficient algorithm to bound linear fractional transformations

DOI10.1007/S11081-005-6795-ZMaRDI QIDQ2575247zbMATH OpenOpenAlexFDO

Authors Fernando D'Amato, M. 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

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Recommendations

• scientific article; zbMATH DE number 1424226
• Semidefinite programming for uncertain linear equations in static analysis of structures
• Applications of semidefinite programming
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma

Cites work

• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• A note on the calculation of step-lengths in interior-point methods for semidefinite programming
• Computational complexity of μ calculation
• Matrix computations.
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization
• Robustness in the presence of mixed parametric uncertainty and unmodeled dynamics
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Semidefinite Programming
• Semidefinite optimization
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

Cited in

(2)

• LFTB
• LNS with Co-Transformation Competes with Floating-Point

Describes a project that uses

Uses Software

• Mu Analysis and Synthesis Toolbox
• LMI toolbox
• COL
• SDPT3

This page was built for publication: LFTB: an efficient algorithm to bound linear fractional transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575247)