| Title:
|
Dvadsať rokov moderných metód vnútorného bodu (Slovak) |
| Title:
|
Twenty years of modern methods of inner point (English) |
| Author:
|
Halická, Margaréta |
| Language:
|
Slovak |
| Journal:
|
Pokroky matematiky, fyziky a astronomie |
| ISSN:
|
0032-2423 |
| Volume:
|
49 |
| Issue:
|
3 |
| Year:
|
2004 |
| Pages:
|
234-244 |
| . |
| Category:
|
math |
| . |
| Keyword:
|
linear programming |
| Keyword:
|
interior point method |
| MSC:
|
90C05 |
| idZBL:
|
Zbl 1265.90209 |
| . |
| Date available:
|
2010-12-11T20:39:00Z |
| Last updated:
|
2015-11-29 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/141233 |
| . |
| Reference:
|
[1] Dikin, I.: An iterative solution of problems of linear and quadratic programming.Doklady AN SSSR 174 (1967), 747–751. MR 0221850 |
| Reference:
|
[2] Fiacco, A., Mc-Cormick, G.: Nonlinear Programming: Sequential unconstrained minimization techniques.John Wiley and Sons, Inc., New York 1968. MR 0243831 |
| Reference:
|
[3] Frisch, K. R.: The logarithmic potential method of convex programming.University Institute of Economics, Memorandum, Oslo, Norway 1955. |
| Reference:
|
[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. Zbl 0624.90062, MR 0866988, 10.1007/BF02592025 |
| Reference:
|
[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 0216865 |
| Reference:
|
[6] : Interior-Point Archive.URL: http://www.mcs.anl.gov/otc/InteriorPoint |
| Reference:
|
[7] Karmarkar, N.: A new polynomialtime algorithm for linear programming.Combinatorica 4 (1984), 373–395. MR 0779900, 10.1007/BF02579150 |
| Reference:
|
[8] Khachian, L. G.: A polynomial algorithm in linear programming.Doklady AN SSSR 244 (1979), 1093–1096. MR 0522052 |
| Reference:
|
[9] Klee, V., Minty, G.: How good is the simplex algorithm?.In: O. Shisha, ed., “Inequalities-III”. Academic Press, New York 1972. Zbl 0297.90047, MR 0332165 |
| Reference:
|
[10] Lawler, E. L.: Velký matematický sputnik roku 1979.PMFA 27 (1982), 39–47. MR 0503698 |
| Reference:
|
[11] Lovász, L.: Je nový algoritmus lineárního programování lepší nebo horší než simplexová metóda?.PMFA 26 (1981), 193–202. |
| Reference:
|
[12] Nesterov, Y. E., Nemirovsky, A. S.: Interior Point Polynomial Algorithms in Convex Programming.SIAM Publications, Philadelphia, USA, 1994. MR 1258086 |
| Reference:
|
[13] : Optimization Online.URL: http://www.optimization-online.org Zbl 1153.93531 |
| Reference:
|
[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 1845638 |
| Reference:
|
[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. Zbl 0944.65065, MR 1789725 |
| . |
