Abstract
If K is a closed convex cone and if L is a linear operator having , then L is a positive operator on K and L preserves inequality with respect to K. The set of all positive operators on K is denoted by . If is the dual of K, then its complementarity set isSuch a set arises as optimality conditions in convex optimization, and a linear operator L is Lyapunov-like on K if for all . Lyapunov-like operators help us find elements of C(K), and the more linearly independent operators we can find, the better. The set of all Lyapunov-like operators on K forms a vector space and its dimension is denoted by . The number is the Lyapunov rank of K, and it has been studied for many important cones. The set is itself a cone, and it is natural to ask if can be computed, possibly in terms of itself. The problem appears difficult in general. We address the case where K is both proper and polyhedral, and show that in that case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
