Title :
Branch and bound computation of the minimum norm of a linear fractional transformation over a structured set
Author :
M´closkey, Robert ; Packard, Andy ; Sipila, Jaime
Author_Institution :
Dept. of Mech. Aerosp. & Nucl. Eng., California Univ., Los Angeles, CA, USA
fDate :
2/1/2000 12:00:00 AM
Abstract :
The minimum norm of a linear fractional transformation (LFT) over a structured set is computed using a branch and bound algorithm. This is a global optimization problem caused by the possibility of local minima. Several computationally efficient lower bounds for the minimum norm of the LFT are developed, and it is demonstrated that the success of the optimization, as measured by time-to-converge, largely depends on the quality of these bounds
Keywords :
convergence of numerical methods; iterative methods; optimisation; transforms; branch and bound; convergence; convex optimization; fixed structure synthesis; iterative method; linear fractional transformation; lower bounds; minimum norm; structured set; Aerospace engineering; Control system analysis; Control system synthesis; Control systems; Linear systems; Mechanical engineering; NASA; Robust control; Standards publication; Upper bound;
Journal_Title :
Automatic Control, IEEE Transactions on
