Resultats globals: 3 registres trobats en 0.02 segons.
Articles, 3 registres trobats
Articles 3 registres trobats  
1.
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  
 Accés restringit a la UAB
2.
31 p, 1.3 MB Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems / Jansen, Benjamin ; Roos, Kees ; Terlaky, Tamás ; Yoshise, Akiko
This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu's scaled Lipschitz condition, but is also applicable to mappings that are not monotone. [...]
1997
Mathematical Programming, vol. 78 n. 3 (1997) p. 315-345  
 Accés restringit a la UAB
3.
14 p, 528.4 KB Improved complexity using higher-order correctors for primal-dual Dikin affine scaling / Jansen, Benjamin ; Roos, C. ; Terlaky, Tamás ; Ye, Y.
In this paper we show that the primal-dual Dikin affine scaling algorithm for linear programming of Jansen, Roos and Terlaky enhances an asymptotical O(V~nL) complexity by using corrector steps. We also show that the result remains valid when the method is applied to positive semi-definite linear complementarity problems.
1997
Mathematical Programming, vol. 76 n. 1 (1997) p. 117-130  
 Accés restringit a la UAB

Vegeu també: autors amb noms similars
3 Terlaky, Tamás
Us interessa rebre alertes sobre nous resultats d'aquesta cerca?
Definiu una alerta personal via correu electrònic o subscribiu-vos al canal RSS.