Achievable potential reductions in the method of Kojima et al. in the case of linear programming
RAIRO - Operations Research - Recherche Opérationnelle (1994)
- Volume: 28, Issue: 2, page 123-133
- ISSN: 0399-0559
Access Full Article
top
How to cite
topRoos, C., and Vial, J.-Ph.. "Achievable potential reductions in the method of Kojima et al. in the case of linear programming." RAIRO - Operations Research - Recherche Opérationnelle 28.2 (1994): 123-133. <http://eudml.org/doc/105078>.
@article{Roos1994,
author = {Roos, C., Vial, J.-Ph.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {linear complementarity; primal-dual interior point method; potential reduction; duality gap},
language = {eng},
number = {2},
pages = {123-133},
publisher = {EDP-Sciences},
title = {Achievable potential reductions in the method of Kojima et al. in the case of linear programming},
url = {http://eudml.org/doc/105078},
volume = {28},
year = {1994},
}
TY - JOUR
AU - Roos, C.
AU - Vial, J.-Ph.
TI - Achievable potential reductions in the method of Kojima et al. in the case of linear programming
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1994
PB - EDP-Sciences
VL - 28
IS - 2
SP - 123
EP - 133
LA - eng
KW - linear complementarity; primal-dual interior point method; potential reduction; duality gap
UR - http://eudml.org/doc/105078
ER -
References
top- 1. N. KARMARKAR, A New Polynomial-Time Algorithm for Linear Programming, Combinatorica, 4, 1984, pp. 373-395. Zbl0557.90065MR779900
- 2. M. KOJIMA, S. MIZUNO, A. YOSHISE, An O (√nL) Potential Reduction Algorithm for Linear Complementary Problems Zbl0738.90077
- 3. Y. YE, A Class of Projective Transformations for Linear Programming, SIAM Journal on Computing, 19, 1990, pp. 457-466. MR1041540
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.