Random search of stable member in a matrix polytope

Given a matrix polytope we consider the existence problem of a stable member in it. We suggest an algorithm in which part of uncertainty parameters is chosen randomly. Applications to affine families and 3×3 interval families are considered. A necessary and sufficient condition for the existence of...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational and applied mathematics Vol. 308; pp. 59 - 68
Main Authors Yılmaz, Şerife, Büyükköroğlu, Taner, Dzhafarov, Vakif
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.12.2016
Subjects
Algorithms
Bialternate product
Computation
Intervals
Mathematical analysis
Mathematical models
Matrix polytope
Polytopes
Random search
Searching
Stable matrix
Uncertainty
93D20
15A24
Bialternate product
Matrix polytope
15A15
93D30
Stable matrix
Random search
Online AccessGet full text

Cover

More Information
Summary:Given a matrix polytope we consider the existence problem of a stable member in it. We suggest an algorithm in which part of uncertainty parameters is chosen randomly. Applications to affine families and 3×3 interval families are considered. A necessary and sufficient condition for the existence of a stable member is given for general interval families with nonnegative off-diagonal intervals.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2016.05.020