An improved bound for the Lyapunov rank of a proper cone
An improved bound for the Lyapunov rank of a proper cone
复制标题
真锥李亚普诺夫等级的改进界限
DOI:
10.1007/s11590-015-0903-6
复制
发表时间:
2016
影响因子:
1.6
通讯作者:
M. Seetharama Gowda
中科院分区:
文献类型:
--
作者:
Michael Orlitzky;M. Seetharama Gowda
Given a proper coneinwith its dual, the complementarity set ofis $$C\left( K\right) := \left\{ \left( \mathbf {x},\mathbf {s}\right) : \mathbf {x} \in K, \mathbf {s} \in K^{*}, \left\langle \mathbf {x},\mathbf {s} \right\rangle = 0 \right\} $$. A matrixonis said to beLyapunov-likeoniffor all. The set of all such matrices forms a vector space whose dimensionis called theLyapunov rankof. This number is useful in conic optimization and complementarity theory, as it relates to the number of linearly-independent bilinear relations needed to express the complementarity set. This article is a continuation of the study initiated in Rudolf et al. (Math Program Ser B 129:5–31, 2011) and further pursued in Gowda and Tao (Math Program 147:155–170, 2014). By answering several questions posed in Gowda and Tao (Math Program 147:155–170, 2014), we show thatis bounded above by, thereby improving the previously known bound of. We also show that when, the complementarity setcan be expressed in terms oflinearly-independent Lyapunov-like matrices.