![]() ![]() Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. Lustig, I.J., Marsten, R.E., Shanno, D.F.: On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. Luh, H., Tsaih, R.: An efficient search direction for linear programming problems. Lasserre, J.B.: Global optimization with polynomials and the problem of moments. ![]() Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. (ed.) Progress in Mathematical Programming: Interior-Point and Related Methods, pp. Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. Khachiyan, L.G.: A polynomial algorithm in linear programming. In: ORSA/TIMS Joint National Meeting, Boston (1985) Karmarkar, N., Ramakrishnan, R.: Further developments in the new polynomial-time algorithm for linear programming. Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, New York, pp 302–311 (1984) Jarre, F., Wechs, M.: Extending Mehrotra’s corrector for linear programs. Illés, T., Terlaky, T.: Pivot versus interior point methods: Pros and cons. Huard, P.: Resolution of mathematical programming with nonlinear constraints by the method of centers. Güler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Gonzaga, C.C.: Path-following methods for linear programming. Gonzaga, C.C.: Search directions for interior linear-programming methods. Gondzio, J.: Interior point methods 25 years later. Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. (eds.) Handbooks in Operations Research and Management Science, vol. In: Nemhauser, G.L., Rinnooy Kan, A.H.G., Todd, M.J. Goldfarb, D., Todd, M.J.: Chapter II linear programming. Gill, P.E., Murray, W., Saunders, M.A., Tomlin, J.A., Wright, M.H.: On the projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method. Gay, D.M.: Electronic mail distribution of linear programming test problems. 21(1), 99–115 (2008)įang, S., Puthenpura, S.: Linear Optimization and Extensions: Theory and Algorithms. 15(3), 725–738 (1986)Įl Ghami, M., Ivanov, I.D., Roos, C., Steihaug, T.: A polynomial-time algorithm for LO based on generalized logarithmic barrier functions. 13(1), 31–45 (1984)ĭyer, M.E.: On a multidimensional search technique and its application to the Euclidean one-centre problem. ![]() ACM 30(5), 403–407 (1987)ĭyer, M.E.: Linear time algorithms for two- and three-variable linear programs. 152(1), 315–342 (1991)ĭongarra, J.J., Grosse, E.: Distribution of mathematical software via electronic mail. Nauk SSSR 174(4), 747–748 (1967)ĭomich, P.D., Boggs, P.T., Rogers, J.E., Witzgall, C.: Optimizing over three-dimensional subspaces in an interior-point method for linear programming. 12(5), 1099–1116 (2018)ĭikin, I.I.: Iterative solution of problems of linear and quadratic programming. ![]() 11(1–4), 397–430 (1999)ĭarvay, Z., Takács, P.R.: New method for determining search directions for interior-point algorithms in linear optimization. 41(3), 277–305 (2008)Ĭzyzyk, J., Mehrotra, S., Wagner, M., Wright, S.J.: PCx: an interior-point code for linear programming. 27(13), 1303–1324 (2000)Ĭolombo, M., Gondzio, J.: Further development of multiple centrality correctors for interior point methods. Algorithms 43(1), 279–288 (2006)Ĭavichia, M.C., Arenales, M.N.: Piecewise linear programming via interior points. 1(3), 159–171 (1989)īouafia, M., Benterki, D., Yassine, A.: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term. Athena Scientific, Belmont (1997)īoggs, P.T., Domich, P.D., Donaldson, J.R., Witzgall, C.: Algorithmic enhancements to the method of centers for linear programming problems. Wiley, Hoboken (2010)īertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. I affine and projective scaling trajectories. 36(2), 174–182 (1986)īayer, D.A., Lagarias, J.C.: The nonlinear geometry of linear programming. 170(2), 562–590 (2016)īarnes, E.R.: A variation on Karmarkars algorithm for solving linear programming problems. 44(1–3), 297–335 (1989)Īsadi, A., Roos, C.: Infeasible interior-point methods for linear optimization based on large neighborhood. Adler, I., Resende, M.G.C., Veiga, G., Karmarkar, N.: An implementation of Karmarkar’s algorithm for linear programming. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |