-

 

 

 




Optimization Online





 

The Lyapunov rank of an improper cone

Michael Orlitzky (mjo***at***umbc.edu)

Abstract: Let K be a closed convex cone with dual K^* in a finite-dimensional real inner-product space V. The complementarity set of K is C(K) = { (x, s) in K K^* | = 0 }. We say that a linear transformation L : V -> V is Lyapunov-like on K if = 0 for all (x, s) in C(K). The dimension of the space of all such transformations is called the Lyapunov rank of K. This number was introduced and studied by Rudolf et al. for proper cones because of its connection to conic programming and complementarity problems. The assumption that K is proper turns out to be nonessential. We first develop the basic theory for cones that are merely closed and convex. We then devise a way to compute the Lyapunov rank of any closed convex cone and show that the Lyapunov-like transformations on a closed convex cone are related to the Lie algebra of its automorphism group. Next we extend some results for proper polyhedral cones. Finally, we devise algorithms to compute both the space of all Lyapunov-like transformations and the Lyapunov rank of a polyhedral closed convex cone.

Keywords: Lyapunov rank, Lyapunov-like transformation, conic programming, Lie algebra, automorphism group

Category 1: Complementarity and Variational Inequalities

Category 2: Linear, Cone and Semidefinite Programming

Citation: Optimization Methods and Software (accepted 2016-06-12). http://www.tandfonline.com/doi/full/10.1080/10556788.2016.1202246

Download:

Entry Submitted: 10/01/2015
Entry Accepted: 10/01/2015
Entry Last Modified: 07/08/2016

Modify/Update this entry


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society