Strict Constraint Feasibility in Analysis and Design of Uncertain Systems
Author(s) -
Luis G. Crespo,
Daniel P. Giesy,
Sean Kenny
Publication year - 2006
Publication title -
12th aiaa/issmo multidisciplinary analysis and optimization conference
Language(s) - English
Resource type - Conference proceedings
DOI - 10.2514/6.2006-7035
Subject(s) - mathematical optimization , robustness (evolution) , bounded function , parametric statistics , verifiable secret sharing , computer science , norm (philosophy) , parameter space , mathematics , set (abstract data type) , mathematical analysis , biochemistry , chemistry , statistics , political science , law , gene , programming language
This paper proposes a methodology for the analysis and design optimization of models subject to parametric uncertainty, where hard inequality constraints are present. Hard constraints are those that must be satisfied for all parameter realizations prescribed by the uncertainty model. Emphasis is given to uncertainty models prescribed by norm-bounded perturbations from a nominal parameter value, i.e., hyper-spheres, and by sets of independently bounded uncertain variables, i.e., hyper-rectangles. These models make it possible to consider sets of parameters having comparable as well as dissimilar levels of uncertainty. Two alternative formulations for hyper-rectangular sets are proposed, one based on a transformation of variables and another based on an infinity norm approach. The suite of tools developed enable us to determine if the satisfaction of hard constraints is feasible by identifying critical combinations of uncertain parameters. Since this practice is performed without sampling or partitioning the parameter space, the resulting assessments of robustness are analytically verifiable. Strategies that enable the comparison of the robustness of competing design alternatives, the approximation of the robust design space, and the systematic search for designs with improved robustness characteristics are also proposed. Since the problem formulation is generic and the solution methods only require standard optimization algorithms for their implementation, the tools developed are applicable to a broad range of problems in several disciplines.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom