contributor author | Nicola, Jeremy | |
contributor author | Jaulin, Luc | |
date accessioned | 2017-05-09T01:14:27Z | |
date available | 2017-05-09T01:14:27Z | |
date issued | 2015 | |
identifier issn | 2332-9017 | |
identifier other | RISK_1_3_031004.pdf | |
identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/156879 | |
description abstract | Linear matrix inequalities (LMIs) comprise a large class of convex constraints. Boxes, ellipsoids, and linear constraints can be represented by LMIs. The intersection of LMIs are also classified as LMIs. Interiorpoint methods are able to minimize or maximize any linear criterion of LMIs with complexity, which is polynomial regarding to the number of variables. As a consequence, as shown in this paper, it is possible to build optimal contractors for sets represented by LMIs. When solving a set of nonlinear constraints, one may extract from all constraints that are LMIs in order to build a single optimal LMI contractor. A combination of all contractors obtained for other nonLMI constraints can thus be performed up to the fixed point. The resulting propogation is shown to be more efficient than other conventional contractorbased approaches. | |
publisher | The American Society of Mechanical Engineers (ASME) | |
title | Contractors and Linear Matrix Inequalities | |
type | Journal Paper | |
journal volume | 1 | |
journal issue | 3 | |
journal title | ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering | |
identifier doi | 10.1115/1.4030781 | |
journal fristpage | 31004 | |
journal lastpage | 31004 | |
tree | ASCE-ASME Journal of Risk and Uncertainty in Engineering Systems, Part B: Mechanical Engineering:;2015:;volume( 001 ):;issue: 003 | |
contenttype | Fulltext | |