Results overview: Found 4 records in 0.03 seconds.
Articles, 4 records found
Articles 4 records found  
1.
17 p, 563.6 KB Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity / Stoer, Josef ; Wechs, Martin
In this paper we study the behavior of infeasible-interior-point-paths for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle et al. (R. W. Cottle, J. -S. [...]
1998
Mathematical Programming, vol. 83 n. 3 (1998) p. 407-423  
 UAB restricted access
2.
22 p, 782.7 KB Predictor-corrector algorithm for solving P_* (k)-matrix LCP from arbitrary positive starting points / Potra, Florian A. ; Rongqin, Sheng
A new predictor-corrector algorithm is proposed for solving P_*(k)-matrix linear complementarity problems. If the problem is solvable, then the algorithm converges from an arbitrary positive starting point (x^0, s^0). [...]
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 223-244  
 UAB restricted access
3.
27 p, 1.5 MB Criss-cross methods : A fresh view on pivot algorithms / Fukuda, Komei ; Terlaky, Tamás
Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. [...]
1997
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 369-395  
 UAB restricted access
4.
10 p, 444.6 KB Pseudomonotone variational inequality problems : Existence of solutions / Crouzeix, Jean-Pierre
Necessary and sufficient conditions for the set of solutions of a pseudomonotone variational inequality problem to be nonempty and compact are given. .
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 305-314  
 UAB restricted access

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.