Equivalence between different formulations of the linear complementarity problem

Optimization Methods and Software

Volumn 7, Issue 3-4, 1997, Pages 265-290

  Anitescu, Mihai ^a   Lesaja, Goran ^a   Potra, Florian A ^a  

^a UNIVERSITY OF IOWA   (United States)

Author keywords

Equivalence; Infeasible interior point algorithm; Linear complementarity problem; P* matrices; Polynomiality; Quadratic convergence

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; EQUIVALENCE CLASSES; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

INTERIOR POINT ALGORITHMS; LINEAR COMPLEMENTARITY PROBLEM (LCP);

MATHEMATICAL PROGRAMMING;

EID: 0030707014     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556789708805657     Document Type: Article

References (1)

1. *(κ)-Geometric LCP. Reports on Computational Mathematics, Department of Mathematics, The University of Iowa, Iowa City, IA 52242, USA. To appear in Applied Mathematics and Software.