Geodesic
Dvadsať rokov moderných metód vnútorného bodu
Pokroky matematiky, fyziky a astronomie, Tome 49 (2004) no. 3, pp. 234-244
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 90C05
Mots-clés : linear programming; interior point method 
@article{PMFA_2004_49_3_a6,
     author = {Halick\'a, Margar\'eta},
     title = {Dvadsa\v{t} rokov modern\'ych met\'od vn\'utorn\'eho bodu},
     journal = {Pokroky matematiky, fyziky a astronomie},
     pages = {234--244},
     year = {2004},
     volume = {49},
     number = {3},
     zbl = {1265.90209},
     language = {sk},
     url = {http://geodesic.mathdoc.fr/item/PMFA_2004_49_3_a6/}
}
TY  - JOUR
AU  - Halická, Margaréta
TI  - Dvadsať rokov moderných metód vnútorného bodu
JO  - Pokroky matematiky, fyziky a astronomie
PY  - 2004
SP  - 234
EP  - 244
VL  - 49
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/PMFA_2004_49_3_a6/
LA  - sk
ID  - PMFA_2004_49_3_a6
ER  - 
%0 Journal Article
%A Halická, Margaréta
%T Dvadsať rokov moderných metód vnútorného bodu
%J Pokroky matematiky, fyziky a astronomie
%D 2004
%P 234-244
%V 49
%N 3
%U http://geodesic.mathdoc.fr/item/PMFA_2004_49_3_a6/
%G sk
%F PMFA_2004_49_3_a6
Halická, Margaréta. Dvadsať rokov moderných metód vnútorného bodu. Pokroky matematiky, fyziky a astronomie, Tome 49 (2004) no. 3, pp. 234-244. http://geodesic.mathdoc.fr/item/PMFA_2004_49_3_a6/

[1] Dikin, I.: An iterative solution of problems of linear and quadratic programming. Doklady AN SSSR 174 (1967), 747–751. | MR

[2] Fiacco, A., Mc-Cormick, G.: Nonlinear Programming: Sequential unconstrained minimization techniques. John Wiley and Sons, Inc., New York 1968. | MR

[3] Frisch, K. R.: The logarithmic potential method of convex programming. University Institute of Economics, Memorandum, Oslo, Norway 1955.

[4] Gill, P., Murray, W., Saunders, M., Tomlin, J., Wright, M.: On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Math. Programming 36 (1986), 183–209. | DOI | MR | Zbl

[5] Huard, P.: Resolution of mathematical programming with nonlinear constraints by the method of centers. In Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam 1967. | MR

[6] Interior-Point Archive. URL: http://www.mcs.anl.gov/otc/InteriorPoint

[7] Karmarkar, N.: A new polynomialtime algorithm for linear programming. Combinatorica 4 (1984), 373–395. | DOI | MR

[8] Khachian, L. G.: A polynomial algorithm in linear programming. Doklady AN SSSR 244 (1979), 1093–1096. | MR

[9] Klee, V., Minty, G.: How good is the simplex algorithm?. In: O. Shisha, ed., “Inequalities-III”. Academic Press, New York 1972. | MR | Zbl

[10] Lawler, E. L.: Velký matematický sputnik roku 1979. PMFA 27 (1982), 39–47. | MR

[11] Lovász, L.: Je nový algoritmus lineárního programování lepší nebo horší než simplexová metóda?. PMFA 26 (1981), 193–202.

[12] Nesterov, Y. E., Nemirovsky, A. S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications, Philadelphia, USA, 1994. | MR

[13] Optimization Online. URL: http://www.optimization-online.org | Zbl

[14] Vanderbei, R. J.: Linear Programming. Foundations and Extensions. Kluwer Academic Publishers, Boston/London/Dortrecht 1997. Elektronicky prístupné na http://www.princeton.edu/ rvdb/LPbook/index.html | MR

[15] Wright, M. H.: The interior-point revolution in constrained optimization. In: R. DeLeone, A. Murli, P. M. Pardalos, G. Toraldo: High-Performance Algorithms and Software in Nonlinear Optimization, 359–381, Kluwer Academic Publishers 1998. | MR | Zbl