  


An algorithmic characterization of Pmatricity
Ibtihel Ben Gharbia (ibtihel.bengharbiainria.fr) Abstract: It is shown that a matrix $M$ is a Pmatrix if and only if, whatever is the vector $q$, the Newtonmin algorithm does not cycle between two points when it is used to solve the linear complementarity problem $0\leq x\perp (Mx+q)\geq0$. Keywords: linear complementarity problem, semismooth Newton method, Newtonmin algorithm, NMmatrix, Pmatrix Category 1: Complementarity and Variational Inequalities Citation: Inria research report RR8004 Download: [PDF] Entry Submitted: 06/29/2012 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  