  


Lyapunov rank of polyhedral positive operators
Michael Orlitzky(michaelorlitzky.com) Abstract:
If K is a closed convex cone and if L is a linear operator having L(K) a subset of K, 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 pi(K). If J is the dual of K, then its complementarity set is
C(K) := {(x,s) in (K,J)  Keywords: lyapunov rank, bilinearity rank, positive operators, completelypositive cone, copositive cone Category 1: Linear, Cone and Semidefinite Programming Category 2: Complementarity and Variational Inequalities Category 3: Convex and Nonsmooth Optimization (Convex Optimization ) Citation: Download: [PDF] Entry Submitted: 03/12/2017 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  