LFTB: an efficient algorithm to bound linear fractional transformations

DOI10.1007/S11081-005-6795-ZzbMATH Open1093.90036OpenAlexW2064078067MaRDI QIDQ2575247FDOQ2575247

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

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

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Cites Work

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

Cited In (2)

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

Uses Software

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

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)