Publications

Books

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

Publications in Refereed Journals

2014

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2013

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2012

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2011

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2010

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2009

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex Go to document
    @Article{Hadigheh2006a, Title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      Author = {A. Ghaffari Hadigheh and T. Terlaky},
      Journal = {Journal of Industrial and Management Optimization},
      Year = {2006},
      Number = {1},
      Pages = {1--18},
      Volume = {2},
      Url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex Go to document
    @Article{Hadigheh2005, Title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {Optimization},
      Year = {2005},
      Number = {1},
      Pages = {59--79},
      Volume = {54},
      Url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @Article{hare2010efficient, Title = {Efficient preprocessing for VLSI optimization problems},
      Author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      Journal = {Computational Optimization and Applications},
      Year = {2010},
      Number = {3},
      Pages = {475--493},
      Volume = {45},
      Publisher = {Springer}
    }
  • B. He, E. de Klerk, C. Roos, and T. Terlaky, "Method of Approximate Centers for Semi–Definite Programming," Optimization Methods and Software, vol. 7, pp. 291-309, 1997. bibtex
    @Article{He1997, Title = {Method of Approximate Centers for Semi--Definite Programming},
      Author = {He, B. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1997},
      Pages = {291--309},
      Volume = {7}
    }
  • D. den Hertog, O. Güler, C. Roos, T. Terlaky, and T. Tsuchiya, "Degeneracy in Interior Point Methods," Annales of Operations Research, vol. 46, pp. 107-138, 1993. bibtex
    @Article{Hertog1993a, Title = {Degeneracy in Interior Point Methods},
      Author = {den Hertog, D. and G\"uler, O. and Roos, C. and Terlaky, T. and Tsuchiya, T.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {107 -- 138},
      Volume = {46}
    }
  • D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, "A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems," Mathematical Programming, vol. 69, pp. 75-88, 1995. bibtex
    @Article{Hertog1995a, Title = {A Sufficient Condition for Self–Concordance with Application to Some Classes of Structured Convex Programming Problems},
      Author = {den Hertog, D. and Jarre, F. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1995},
      Pages = {75 -- 88},
      Volume = {69}
    }
  • D. den Hertog, J. Kaliski, C. Roos, and T. Terlaky, "A Logarithmic Barrier Cutting Plane Method for Convex Programming," Annals of Operations Research, vol. 58, pp. 69-98, 1995. bibtex
    @Article{Hertog1995, Title = {A Logarithmic Barrier Cutting Plane Method for Convex Programming},
      Author = {den Hertog, D. and Kaliski, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1995},
      Pages = {69 -- 98},
      Volume = {58}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "Inverse Barrier Methods for Linear Programming," Revue RAIRO – Operations Research, vol. 28, pp. 135-163, 1994. bibtex
    @Article{Hertog1994, Title = {Inverse Barrier Methods for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Revue RAIRO – Operations Research},
      Year = {1994},
      Pages = {135 -- 163},
      Volume = {28}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method," Linear Algebra and Its Applications, vol. 187, pp. 1-14, 1993. bibtex
    @Article{Hertog1993, Title = {The Linear Comlementarity Problem, Sufficient Matrices and the Criss–Cross Method},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1993},
      Pages = {1 -- 14},
      Volume = {187}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems," SIAM Journal on Optimization, vol. 2, iss. 1, pp. 55-70, 1992. bibtex
    @Article{Hertog1992, Title = {A Large–Step Analytic Center Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1992},
      Number = {1},
      Pages = {55 -- 70},
      Volume = {2}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems," Journal of Optimization Theory and Applications, vol. 73, iss. 1, pp. 1-25, 1992. bibtex
    @Article{Hertog1992a, Title = {On the Classical Logarithmic Barrier Function Method for a Class of Smooth Convex Programming Problems},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1992},
      Number = {1},
      Pages = {1 -- 25},
      Volume = {73}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Build–Up Variant of the Path–Following Method for LP," Operations Research Letters, vol. 12, pp. 181-186, 1992. bibtex
    @Article{Hertog1992b, Title = {A Build–Up Variant of the Path–Following Method for LP},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1992},
      Pages = {181 -- 186},
      Volume = {12}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "On the Monotonicity of the Dual Objective Along Barrier Path," COAL Bulletin, vol. 20, pp. 2-8, 1992. bibtex
    @Article{Hertog1992c, Title = {On the Monotonicity of the Dual Objective Along Barrier Path},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {COAL Bulletin},
      Year = {1992},
      Pages = {2 -- 8},
      Volume = {20}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming," Linear Algebra and Its Applications, vol. 68, pp. 43-68, 1991. bibtex
    @Article{Hertog1991, Title = {A Potential Reduction Variant of Renegar’s Short–Step Path–Following Method for Linear Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {43 -- 68},
      Volume = {68}
    }
  • D. den Hertog, C. Roos, and T. Terlaky, "A Polynomial Method of Weighted Centers for Convex Quadratic Programming," Journal of Information and Optimization Sciences, vol. 12, pp. 187-205, 1991. bibtex
    @Article{Hertog1991a, Title = {A Polynomial Method of Weighted Centers for Convex Quadratic Programming},
      Author = {den Hertog, D and Roos, C. and Terlaky, T.},
      Journal = {Journal of Information and Optimization Sciences},
      Year = {1991},
      Pages = {187 -- 205},
      Volume = {12}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Invariance Preserving Discretization of Dynamical Systems," SIAM Journal on Control and Optimization (Submitted), 2014. bibtex
    @Article{2014, Title = {Invariance Preserving Discretization of Dynamical Systems},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {SIAM Journal on Control and Optimization (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • Z. Horvth, Y. Song, and T. Terlaky, "Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.," Discrete and Continuous Dynamical Systems (Submitted), 2014. bibtex
    @Article{Horvth2014, Title = {Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron.},
      Author = {Horvth, Z. and Song, Y. and Terlaky, T.},
      Journal = {Discrete and Continuous Dynamical Systems (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @Article{Illes2010a, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Number = {3},
      Pages = {329--342},
      Volume = {47},
      Publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @Article{illes2010polynomial, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {Pages--1},
      Volume = {5}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex Go to document
    @Article{Illes2000, Title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      Author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2000},
      Number = {2},
      Pages = {320-340},
      Volume = {11},
      Doi = {10.1137/S1052623498336590},
      Keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • T. Illés, J. Mayer, and T. Terlaky, "Pseudoconvex Optimization for a Special Problem of Paint Industry," European Journal of Operational Research, vol. 79, pp. 537-548, 1994. bibtex
    @Article{Illes1994, Title = {Pseudoconvex Optimization for a Special Problem of Paint Industry},
      Author = {Ill\'es, T. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1994},
      Pages = {537 -- 548},
      Volume = {79}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex Go to document
    @Article{Illes2010, Title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      Author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      Journal = {Journal of Global Optimization},
      Year = {2010},
      Note = {10.1007/s10898-008-9348-0},
      Pages = {329-342},
      Volume = {47},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0925-5001},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex Go to document
    @Article{Illes2009, Title = {EP Theorem for Dual Linear Complementarity Problems},
      Author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2009},
      Note = {10.1007/s10957-008-9440-0},
      Pages = {233-238},
      Volume = {140},
      Affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex Go to document
    @Article{Illes2010b, Title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      Author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2010},
      Number = {1},
      Pages = {1--12},
      Volume = {5},
      ISSN = {1718-3235},
      Keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • T. Illes, A. Szirmai, and T. Terlaky, "The finite criss-cross method for hyperbolic programming," European Journal of Operational Research, vol. 114, iss. 1, pp. 198-214, 1999. bibtex Go to document
    @Article{Illes1999, Title = {The finite criss-cross method for hyperbolic programming},
      Author = {Illes, Tibor and Szirmai, Akos and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {1999},
      Number = {1},
      Pages = {198-214},
      Volume = {114},
      Url = {http://econpapers.repec.org/RePEc:eee:ejores:v:114:y:1999:i:1:p:198-214}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex Go to document
    @Article{Illes2002, Title = {Pivot versus interior point methods: Pros and cons},
      Author = {Illes, Tibor and Terlaky, Tamas},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Month = {July},
      Number = {2},
      Pages = {170-190},
      Volume = {140},
      Abstract = {No abstract is available for this item.},
      Url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }
  • B. Jan-sen, C. Roos, T. Terlaky, and J. Vial, "Long–Step Primal–Dual Target–Following Algorithms for Linear Programming," Mathematical Methods of Operations Research, vol. 44, pp. 11-30, 1996. bibtex
    @Article{Jan-sen1996, Title = {Long--Step Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jan\-sen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Mathematical Methods of Operations Research},
      Year = {1996},
      Pages = {11--30},
      Volume = {44}
    }
  • B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, "Sensitivity Analysis in Linear Programming: Just be Careful!," European Journal of Operational Research, vol. 101, pp. 15-28, 1997. bibtex
    @Article{Jansen1997d, Title = {Sensitivity Analysis in Linear Programming: Just be Careful!},
      Author = {Jansen, B. and Jong, J.J. de and Roos, C. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1997},
      Pages = {15--28},
      Volume = {101}
    }
  • B. Jansen and C. Roos, "Interior Point Methods, a Decade After Karmarkar — a Survey With Application to the Smallest Eigenvalue Problem," Statistica Neerlandica, vol. 50, pp. 146-170, 1996. bibtex
    @Article{Jansen1996b, Title = {Interior Point Methods, a Decade After Karmarkar -- a Survey With Application to the Smallest Eigenvalue Problem},
      Author = {Jansen, B. and Roos, C.},
      Journal = {Statistica Neerlandica},
      Year = {1996},
      Pages = {146--170},
      Volume = {50}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems," SIAM Journal on Optimization, vol. 7, iss. 1, pp. 126-140, 1997. bibtex
    @Article{Jansen1997, Title = {A Family of Polynomial Affine Scaling Algorithms for Positive Semidefinite Linear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {SIAM Journal on Optimization},
      Year = {1997},
      Number = {1},
      Pages = {126--140},
      Volume = {7}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming," Mathematics of Operations Research, vol. 21, pp. 341-353, 1996. bibtex
    @Article{Jansen1996, Title = {A Polynomial Dikin–Type Primal–Dual Algorithm for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Mathematics of Operations Research},
      Year = {1996},
      Pages = {341 -- 353},
      Volume = {21}
    }
  • B. Jansen, C. Roos, and T. Terlaky, "The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path," Optimization, vol. 29, pp. 225-233, 1993. bibtex
    @Article{Jansen1993, Title = {The Theory of Linear Programming: Skew Symmetric Self–Dual Problems and the Central Path},
      Author = {Jansen, B. and Roos, C. and Terlaky, T.},
      Journal = {Optimization},
      Year = {1993},
      Pages = {225 -- 233},
      Volume = {29}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Target–Following Algorithms for Linear Programming," Annals of Operations Research, vol. 62, pp. 197-231, 1996. bibtex
    @Article{Jansen1996c, Title = {Primal--Dual Target--Following Algorithms for Linear Programming},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Annals of Operations Research},
      Year = {1996},
      Pages = {197--231},
      Volume = {62}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Vial, "Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method," Journal of Optimization Theory and Applications, vol. 83, pp. 1-26, 1994. bibtex
    @Article{Jansen1994, Title = {Primal–Dual Algorithms for Linear Programming Based on the Logarithmic Barrier Method},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {1994},
      Pages = {1 -- 26},
      Volume = {83}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "A Potential Reduction Approach to the Frequency Assignment Problem," Discrete Applied Mathematics, vol. 78, pp. 252-282, 1997. bibtex
    @Article{Jansen1997b, Title = {A Potential Reduction Approach to the Frequency Assignment Problem},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Discrete Applied Mathematics},
      Year = {1997},
      Pages = {252--282},
      Volume = {78}
    }
  • B. Jansen, C. Roos, T. Terlaky, and J. Warners, "Potential Reduction Algorithms for Structured Combinatorial Optimization Problems," Operations Research Letters, vol. 21, iss. 2, pp. 55-65, 1997. bibtex
    @Article{Jansen1997c, Title = {Potential Reduction Algorithms for Structured Combinatorial Optimization Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Warners, J.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {2},
      Pages = {55--65},
      Volume = {21}
    }
  • B. Jansen, C. Roos, T. Terlaky, and Y. Ye, "Improved Complexity Using Higher-Order Correctors for Primal–Dual Dikin Affine Scaling," Mathematical Programming, vol. 76, iss. 1, pp. 117-130, 1996. bibtex
    @Article{Jansen1996a, Title = {Improved Complexity Using Higher-Order Correctors for Primal--Dual Dikin Affine Scaling},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Ye, Y.},
      Journal = {Mathematical Programming},
      Year = {1996},
      Number = {1},
      Pages = {117--130},
      Volume = {76}
    }
  • B. Jansen, C. Roos, T. Terlaky, and A. Yoshise, "Polynomiality of Primal–Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems," Mathematical Programming, vol. 78, pp. 315-345, 1997. bibtex
    @Article{Jansen1997a, Title = {Polynomiality of Primal--Dual Affine Scaling Algorithms for Nonlinear Complementarity Problems},
      Author = {Jansen, B. and Roos, C. and Terlaky, T. and Yoshise, A.},
      Journal = {Mathematical Programming},
      Year = {1997},
      Pages = {315--345},
      Volume = {78}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex Go to document
    @Article{Jiao2009, Title = {A confidence voting process for ranking problems based on support vector machines},
      Author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      Journal = {Annals of Operations Research},
      Year = {2009},
      Note = {10.1007/s10479-008-0410-6},
      Pages = {23-38},
      Volume = {166},
      Affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }
  • J. Kaliski, D. Haglin, C. Roos, and T. Terlaky, "Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming," International Transactions in Operations Research, vol. 4, iss. 4, pp. 285-303, 1997. bibtex
    @Article{Kaliski1997, Title = {Logarithmic Barrier Decomposition Methods for Semi-Infinite Programming},
      Author = {Kaliski, J. and Haglin, D. and Roos, C. and Terlaky, T.},
      Journal = {International Transactions in Operations Research},
      Year = {1997},
      Number = {4},
      Pages = {285--303},
      Volume = {4}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A Geometric Programming Approach to the Channel Capacity Problem," Engineering Optimization, vol. 19, pp. 115-130, 1992. bibtex
    @Article{Klafszky1992a, Title = {A Geometric Programming Approach to the Channel Capacity Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1992},
      Pages = {115 -- 130},
      Volume = {19}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "A New Convergent Algorithm for the Continuous Modular Design Problem," The Arabian Journal for Science and Engineering, vol. 15, pp. 687-694, 1990. bibtex
    @Article{Klafszky1990, Title = {A New Convergent Algorithm for the Continuous Modular Design Problem},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {The Arabian Journal for Science and Engineering},
      Year = {1990},
      Pages = {687 -- 694},
      Volume = {15}
    }
  • E. Klafszky, J. Mayer, and T. Terlaky, "Linearly Constrained Estimation by Mathematical Programming," European Journal of Operational Research, vol. 42, iss. 3, pp. 254-267, 1989. bibtex
    @Article{Klafszky1989b, Title = {Linearly Constrained Estimation by Mathematical Programming},
      Author = {Klafszky, E. and Mayer, J. and Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1989},
      Number = {3},
      Pages = {254 -- 267},
      Volume = {42}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for Quadratic Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 24, pp. 127-139, 1992. bibtex
    @Article{Klafszky1992, Title = {Some Generalizations of the Criss–Cross Method for Quadratic Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1992},
      Pages = {127 -- 139},
      Volume = {24}
    }
  • E. Klafszky and T. Terlaky, "On the Ellipsoid Method," Radovi Mathematicki, vol. 8, pp. 269-280, 1992. bibtex
    @Article{Klafszky1992b, Title = {On the Ellipsoid Method},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Radovi Mathematicki},
      Year = {1992},
      Note = {This paper appeared in print in 1999},
      Pages = {269--280},
      Volume = {8}
    }
  • E. Klafszky and T. Terlaky, "The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra," Linear Algebra and Its Applications, vol. 151, pp. 97-118, 1991. bibtex
    @Article{Klafszky1991, Title = {The Role of Pivoting in Proving Some Fundamental Theorems of Linear Algebra},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Linear Algebra and Its Applications},
      Year = {1991},
      Pages = {97 -- 118},
      Volume = {151}
    }
  • E. Klafszky and T. Terlaky, "Variants of the Hungarian Method for Linear Programming," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 20, iss. 1, pp. 79-91, 1989. bibtex
    @Article{Klafszky1989, Title = {Variants of the Hungarian Method for Linear Programming},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1989},
      Number = {1},
      Pages = {79 -- 91},
      Volume = {20}
    }
  • E. Klafszky and T. Terlaky, "Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids," Combinatorica, vol. 2, pp. 189-198, 1989. bibtex
    @Article{Klafszky1989a, Title = {Some Generalizations of the Criss–Cross Method for the Linear Complementarity Problem of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Combinatorica},
      Year = {1989},
      Pages = {189 -- 198},
      Volume = {2}
    }
  • E. Klafszky and T. Terlaky, "Remarks on the Feasibility Problems of Oriented Matroids," Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae Sectio Computatorica, vol. VII, pp. 155-157, 1987. bibtex
    @Article{Klafszky1987, Title = {Remarks on the Feasibility Problems of Oriented Matroids},
      Author = {Klafszky, E. and Terlaky, T.},
      Journal = {Annales Universitatis Scientiarum Budapestinensis de Rolando E\"otv\"os Nominatae Sectio Computatorica},
      Year = {1987},
      Pages = {155 -- 157},
      Volume = {VII}
    }
  • E. de Klerk, T. Illés, A. de Jong, C. Roos, T. Terlaky, J. Valkó, and J. E. Hoogenboom, "Optimization of Nuclear Reactor Reloading Patterns," Annals of Operations Research, vol. 69, pp. 65-84, 1997. bibtex
    @Article{Klerk1997, Title = {Optimization of Nuclear Reactor Reloading Patterns},
      Author = {de Klerk, E. and Ill\'es, T. and de Jong, A. and Roos, C. and Terlaky, T. and Valk\'o, J. and Hoogenboom, J.E.},
      Journal = {Annals of Operations Research},
      Year = {1997},
      Pages = {65--84},
      Volume = {69}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @Book{Klerk2004, Title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      Author = {de Klerk, E and Roos, C. and Terlaky, T.},
      Publisher = {Aula Publishing},
      Year = {2004},
      Address = {Budapest, Hungary}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 335-360, 1999. bibtex
    @Article{Klerk1999, Title = {Primal-Dual Potential Reduction Methods for Semidefinite Programming Using Affine-Scaling Directions},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {A special issue devoted to the HPOPT-I workshop held in Delft, 19-20 September 1996.},
      Number = {3},
      Pages = {335--360},
      Volume = {29}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "Polynomial Primal–Dual Affine Scaling Algorithms in Semidefinite Programming," Journal of Combinatorial Optimization, vol. 2, pp. 51-69, 1998. bibtex
    @Article{Klerk1998, Title = {Polynomial Primal--Dual Affine Scaling Algorithms in Semidefinite Programming},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Journal of Combinatorial Optimization},
      Year = {1998},
      Pages = {51--69},
      Volume = {2}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, "A Nonconvex Weighted Potential Function for Polynomial Target Following Methods," Annals of Operations Research, vol. 81, pp. 3-14, 1998. bibtex
    @Article{Klerk1998a, Title = {A Nonconvex Weighted Potential Function for Polynomial Target Following Methods},
      Author = {de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {1998},
      Pages = {3--14},
      Volume = {81}
    }
  • E. de~Klerk, C. Roos, and T. Terlaky, "Initialization in Semidefinite Programming Via a Self–Dual, Skew-Symmetric Embedding," Operations Research Letters, vol. 20, iss. 5, pp. 213-221, 1997. bibtex
    @Article{Klerk1997a, Title = {Initialization in Semidefinite Programming Via a Self--Dual, Skew-Symmetric Embedding},
      Author = {de~Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Number = {5},
      Pages = {213--221},
      Volume = {20}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex Go to document
    @Article{Klerk2000, Title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      Author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2000},
      Month = {April},
      Pages = {870--888},
      Volume = {11},
      Acmid = {589015},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623499352632},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      Numpages = {19},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex Go to document
    @Article{Koltai2000257, Title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      Author = {Tam\'as Koltai and Tam\'as Terlaky},
      Journal = {International Journal of Production Economics},
      Year = {2000},
      Number = {3},
      Pages = {257 - 274},
      Volume = {65},
      Doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      ISSN = {0925-5273},
      Keywords = {Linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @Article{koulaei2010complexity, Title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      Author = {Koulaei, Mohammad H and Terlaky, Tamas},
      Journal = {Optimization Methods \& Software},
      Year = {2010},
      Number = {3},
      Pages = {467--485},
      Volume = {25},
      Publisher = {Taylor \& Francis}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex Go to document
    @Article{KumarAnand2008, Title = {Optimizing Teardrop, an MRI sampling trajectory},
      Author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2008},
      Month = {August},
      Pages = {575--592},
      Volume = {23},
      Acmid = {1451568},
      Address = {Bristol, PA, USA},
      ISSN = {1055-6788},
      Issue = {4},
      Keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      Numpages = {18},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex Go to document
    @Article{Lee2001, Title = {A new approach to optimizing energy systems},
      Author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      Journal = {Computer Methods in Applied Mechanics and Engineering},
      Year = {2001},
      Number = {40-41},
      Pages = {5297 - 5310},
      Volume = {190},
      Doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      ISSN = {0045-7825},
      Keywords = {Combined cycle},
      Url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," MOPTA Proceedings, 2013. bibtex
    @Article{li2012duality, Title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      Author = {Li, Dan and Terlaky, Tam{\'a}s},
      Journal = {MOPTA Proceedings},
      Year = {2013}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @Article{li2010new, Title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      Author = {Li, Yang and Terlaky, Tam{\'a}s},
      Journal = {SIAM Journal on Optimization},
      Year = {2010},
      Number = {6},
      Pages = {2853--2875},
      Volume = {20},
      Publisher = {SIAM}
    }
  • Z. Luo, C. Roos, and T. Terlaky, "Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming," Applied Numerical Mathematics, vol. 29, iss. 3, pp. 379-394, 1999. bibtex Go to document
    @Article{Luo1999379, Title = {Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming},
      Author = {Zhi-Quan Luo and C. Roos and T. Terlaky},
      Journal = {Applied Numerical Mathematics},
      Year = {1999},
      Note = {Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques},
      Number = {3},
      Pages = {379 - 394},
      Volume = {29},
      Doi = {DOI: 10.1016/S0168-9274(98)00103-2},
      ISSN = {0168-9274},
      Keywords = {Semi-infinite linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYD-3W0G73X-8/2/ea482225e7e974eadc20a872bc1b8304}
    }
  • H. van Maaren and T. Terlaky, "Inverse Barriers and CES-Functions in Linear Programming," Operations Research Letters, vol. 20, pp. 15-20, 1997. bibtex
    @Article{Maaren1997, Title = {Inverse Barriers and CES-Functions in Linear Programming},
      Author = {van Maaren, H. and Terlaky, T.},
      Journal = {Operations Research Letters},
      Year = {1997},
      Pages = {15--20},
      Volume = {20}
    }
  • M. Mut and T. Terlaky, "The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight," Mathematical Programming (Submitted), 2014. bibtex
    @Article{Mut2014, Title = {The iteration-complexity upper bound for the Mizuno-Todd-Ye predictor-corrector algorithm is tight},
      Author = {Mut, M. and Terlaky, T.},
      Journal = {Mathematical Programming (Submitted)},
      Year = {2014},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @Article{mut2013analogue, Title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @Article{mut2013tight, Title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Year = {2013}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @Article{mut2012volumetric, Title = {On the volumetric path},
      Author = {Mut, Murat and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2012},
      Number = {4},
      Pages = {687--693},
      Volume = {6},
      Publisher = {Springer}
    }
  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @Article{Ndambuki2003, Title = {An Efficient Optimization Method in Groundwater Resource Management},
      Author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      Journal = {Water South Africa},
      Year = {2003},
      Number = {4},
      Pages = {359--364},
      Volume = {29}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex Go to document
    @Article{Nematollahi2008, Title = {A simpler and tighter redundant Klee–Minty construction},
      Author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-007-0068-z},
      Pages = {403-414},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {1862-4472},
      Issue = {3},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex Go to document
    @Article{Nematollahi2008414, Title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      Author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {4},
      Pages = {414 - 418},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2008.02.004},
      ISSN = {0167-6377},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Nemirovski, C. Roos, and T. Terlaky, "On maximization of quadratic form over intersection of ellipsoids with common center," Mathematical Programming, vol. 86, pp. 463-473, 1999. bibtex Go to document
    @Article{Nemirovski1999, Title = {On maximization of quadratic form over intersection of ellipsoids with common center},
      Author = {Nemirovski, A. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050100},
      Pages = {463-473},
      Volume = {86},
      Affiliation = {Faculty of Industrial Engineering and Management, Technion – Israel Institute of Technology, e-mail: nemirovs@ie.technion.ac.il IL},
      ISSN = {0025-5610},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050100}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @Article{oskoorouchi2011interior, Title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      Author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      Journal = {Operations research},
      Year = {2011},
      Number = {5},
      Pages = {1184--1197},
      Volume = {59},
      Publisher = {INFORMS}
    }
  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex Go to document
    @Article{Polik2007, Title = {A Survey of the S-Lemma},
      Author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      Journal = {SIAM Rev.},
      Year = {2007},
      Month = {July},
      Pages = {371--418},
      Volume = {49},
      Acmid = {1655210},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/S003614450444614X},
      ISSN = {0036-1445},
      Issue = {3},
      Keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      Numpages = {48},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @Book{Peng2002, Title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Publisher = {Princeton University Press},
      Year = {2002}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex Go to document
    @Article{Peng2002a, Title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      Author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      Journal = {SIAM Journal on Optimization},
      Year = {2002},
      Number = {1},
      Pages = {179-203},
      Volume = {13},
      Keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      Publisher = {SIAM},
      Url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex Go to document
    @Article{Peng2002b, Title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      Author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2002},
      Number = {2},
      Pages = {234 - 256},
      Volume = {143},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex Go to document
    @Article{Peng2002d, Title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      Author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2002},
      Note = {10.1007/s101070200296},
      Pages = {129-171},
      Volume = {93},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex Go to document
    @Article{Peng2001, Title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {J. Optim. Theory Appl.},
      Year = {2001},
      Month = {May},
      Pages = {327--343},
      Volume = {109},
      Acmid = {380598},
      Address = {New York, NY, USA},
      Doi = {10.1023/A:1017514422146},
      ISSN = {0022-3239},
      Issue = {2},
      Keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      Numpages = {17},
      Publisher = {Plenum Press},
      Url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex Go to document
    @Article{Peng2000, Title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      Author = {Peng, J. and Roos, C. and Terlaky, T.},
      Journal = {Annals of Operations Research},
      Year = {2000},
      Note = {10.1023/A:1019280614748},
      Pages = {23-39},
      Volume = {99},
      ISSN = {0254-5330},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1019280614748}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex Go to document
    @Article{Peng2002c, Title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      Author = {Peng, Jiming and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2002},
      Number = {6},
      Pages = {1077 -- 1104},
      Volume = {17},
      Url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex Go to document
    @Article{Peng2005, Title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      Author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      Journal = {SIAM J. on Optimization},
      Year = {2005},
      Month = {April},
      Pages = {1105--1127},
      Volume = {15},
      Acmid = {1081209},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/040603991},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      Numpages = {23},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • O. Peshko, T. N. Davidson, J. Modersitzki, D. J. Moseley, and T. Terlaky, "A novel marker enhancement lter (MEF) for uoroscopic images," ICCR Proceedings (Submitted), 2013. bibtex
    @Article{2013, Title = {A novel marker enhancement lter (MEF) for uoroscopic images},
      Author = {Peshko, O. and Davidson, T.N. and Modersitzki, J. and Moseley, D.J. and Terlaky, T.},
      Journal = {ICCR Proceedings (Submitted)},
      Year = {2013},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • A. J. Quist, E. de Klerk, C. Roos, and T. Terlaky, "Copositive Relaxation for General Quadratic Programming," Optimization Methods and Software, vol. 9, pp. 185-208, 1998. bibtex
    @Article{Quist1998, Title = {Copositive Relaxation for General Quadratic Programming},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T.},
      Journal = {Optimization Methods and Software},
      Year = {1998},
      Pages = {185--208},
      Volume = {9}
    }
  • A. J. Quist, E. de Klerk, C. Roos, T. Terlaky, R. van Geemert, J. E. Hoogenboom, and T. Illés, "Application of Nonlinear Optimization to Reactor Core Fuel Reloading," Annals of Nuclear Energy, vol. 26, pp. 423-448, 1999. bibtex
    @Article{Quist1999, Title = {Application of Nonlinear Optimization to Reactor Core Fuel Reloading},
      Author = {Quist, A.J. and de Klerk, E. and Roos, C. and Terlaky, T. and van Geemert, R. and Hoogenboom, J.E. and Ill\'es, T.},
      Journal = {Annals of Nuclear Energy},
      Year = {1999},
      Pages = {423--448},
      Volume = {26}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex Go to document
    @Article{Quist2001, Title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      Author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      Journal = {Optimization and Engineering},
      Year = {2001},
      Note = {10.1023/A:1015354615402},
      Pages = {251-276},
      Volume = {2},
      ISSN = {1389-4420},
      Issue = {3},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/A:1015354615402}
    }
  • A. J. Quist, R. Van Geemert, J. E. Hoogenboom, T. Illes†, E. Klerk, C. Roos, and T. Terlaky, "Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics," Engineering Optimization, vol. 32, iss. 2, pp. 143-176, 1999. bibtex Go to document
    @Article{Quist1999a, Title = {Finding Optimal Nuclear Reactor Core Reload Patterns Using Nonlinear Optimization and Search Heuristics},
      Author = {Quist, A. J. and Van Geemert, R. and Hoogenboom, J. E. and Illes†, T. and Klerk, E.De and Roos, C. and Terlaky, T.},
      Journal = {Engineering Optimization},
      Year = {1999},
      Number = {2},
      Pages = {143--176},
      Volume = {32},
      Url = {http://www.informaworld.com/10.1080/03052159908941295}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications." Springer, 2012, pp. 77-119. bibtex
    @InCollection{romanko2012multiobjective, Title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      Author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      Booktitle = {Modeling and Optimization: Theory and Applications},
      Publisher = {Springer},
      Year = {2012},
      Pages = {77--119}
    }
  • C. Roos and T. Terlaky, "Note on a paper of Broyden," Operations Research Letters, vol. 25, iss. 4, pp. 183-186, 1999. bibtex Go to document
    @Article{Roos1999183, Title = {Note on a paper of Broyden},
      Author = {Cornelis Roos and Tam\'as Terlaky},
      Journal = {Operations Research Letters},
      Year = {1999},
      Number = {4},
      Pages = {183 - 186},
      Volume = {25},
      Doi = {DOI: 10.1016/S0167-6377(99)00054-1},
      ISSN = {0167-6377},
      Keywords = {Orthogonal matrices},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-3XXCYJ1-5/2/aee6d4097519af7fe98428fdf77a4a38}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @Book{Roos2006, Title = {Interior Point Methods for Linear Optimization},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {Springer Science},
      Year = {2006},
      Address = {Heidelberg/Boston},
      Note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997. bibtex
    @Book{Roos1997, Title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      Author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Publisher = {John Wiley {\&} Sons},
      Year = {1997},
      Address = {Chichester, New York},
      Note = {(second print 1998)}
    }
  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex Go to document
    @Article{Saad2008, Title = {Packing trees in communication networks},
      Author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Journal of Combinatorial Optimization},
      Year = {2008},
      Note = {10.1007/s10878-008-9150-4},
      Pages = {402-423},
      Volume = {16},
      Affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      ISSN = {1382-6905},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex Go to document
    @Article{Salahi2007, Title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      Author = {Salahi, M. and Peng, J. and Terlaky, T.},
      Journal = {SIAM J. on Optimization},
      Year = {2007},
      Month = {December},
      Pages = {1377--1397},
      Volume = {18},
      Acmid = {1350573},
      Address = {Philadelphia, PA, USA},
      Doi = {10.1137/050628787},
      ISSN = {1052-6234},
      Issue = {4},
      Keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      Numpages = {21},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex Go to document
    @Article{Salahi2008466, Title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      Author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2008},
      Number = {2},
      Pages = {466 - 485},
      Volume = {186},
      Doi = {DOI: 10.1016/j.ejor.2007.02.008},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex Go to document
    @Article{Salahi2004, Title = {On self-regular IPMs},
      Author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      Journal = {TOP},
      Year = {2004},
      Note = {10.1007/BF02578956},
      Pages = {209-275},
      Volume = {12},
      Affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      ISSN = {1134-5764},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization." Springer, 2012, pp. 437-454. bibtex
    @InCollection{salahi2012self, Title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      Author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      Booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      Publisher = {Springer},
      Year = {2012},
      Pages = {437--454}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex Go to document
    @Article{Salahi2007502, Title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      Author = {Maziar Salahi and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2007},
      Number = {2},
      Pages = {502 - 513},
      Volume = {182},
      Doi = {DOI: 10.1016/j.ejor.2006.08.044},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex Go to document
    @Article{Salahi2007a, Title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      Author = {Salahi, M. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-006-9095-7},
      Pages = {143-160},
      Volume = {132},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      ISSN = {0022-3239},
      Issue = {1},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }
  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex Go to document
    @Article{Salahi2005, Title = {An adaptive self-regular proximity-based large-update IPM for LO},
      Author = {Salahi, Maziar and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2005},
      Number = {1},
      Pages = {169-185},
      Volume = {20},
      Url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex Go to document
    @Article{Salahi2006, Title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      Author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      Journal = {Comput. Optim. Appl.},
      Year = {2006},
      Month = {March},
      Pages = {157--185},
      Volume = {33},
      Acmid = {1121222},
      Address = {Norwell, MA, USA},
      Doi = {10.1007/s10589-005-3064-1},
      ISSN = {0926-6003},
      Issue = {2-3},
      Keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      Numpages = {29},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @Article{sotirov2013multi, Title = {Multi-start approach for an integer determinant maximization problem},
      Author = {Sotirov, R and Terlaky, T},
      Journal = {Optimization},
      Year = {2013},
      Number = {1},
      Pages = {101--114},
      Volume = {62},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky, "Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes," TOP, vol. 21, iss. 3, pp. 461-467, 2013. bibtex
    @Article{Terlaky2013, Title = {Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes},
      Author = {Terlaky, T.},
      Journal = {TOP},
      Year = {2013},
      Month = {October},
      Number = {3},
      Pages = {461 -- 467},
      Volume = {21},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex Go to document
    @Article{Terlaky2001, Title = {An easy way to teach interior-point methods},
      Author = {Tam\'as Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2001},
      Number = {1},
      Pages = {1 - 19},
      Volume = {130},
      Doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      ISSN = {0377-2217},
      Keywords = {Linear optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @Article{Terlaky2001a, Title = {Algorithmic Concepts for Linear Optimization},
      Author = {Terlaky, T.},
      Journal = {CORS-SCORO Bulletin},
      Year = {2001},
      Number = {2},
      Pages = {7--33},
      Volume = {35}
    }
  • T. Terlaky, "A Finite Criss–Cross Method for Oriented Matroids," Journal of Combinatorial Theory B, vol. 42, iss. 3, pp. 319-327, 1987. bibtex
    @Article{Terlaky1987, Title = {A Finite Criss–Cross Method for Oriented Matroids},
      Author = {Terlaky, T.},
      Journal = {Journal of Combinatorial Theory B},
      Year = {1987},
      Number = {3},
      Pages = {319 -- 327},
      Volume = {42}
    }
  • T. Terlaky, "A New Algorithm for Quadratic Programming," European Journal of Operational Research, vol. 32, iss. 2, pp. 294-301, 1987. bibtex
    @Article{Terlaky1987a, Title = {A New Algorithm for Quadratic Programming},
      Author = {Terlaky, T.},
      Journal = {European Journal of Operational Research},
      Year = {1987},
      Number = {2},
      Pages = {294 -- 301},
      Volume = {32}
    }
  • T. Terlaky, "Smoothing Empirical Functions by lp Programming," European Journal of Operational Research, vol. 27, pp. 343-363, 1986. bibtex
    @Article{Terlaky1986, Title = {Smoothing Empirical Functions by lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1986},
      Pages = {343--363},
      Volume = {27}
    }
  • T. Terlaky, "On lp Programming," European Journal of Operational Research, vol. 22, pp. 70-100, 1985. bibtex
    @Article{Terlaky1985, Title = {On lp Programming},
      Author = {Terlaky, Tamás},
      Journal = {European Journal of Operational Research},
      Year = {1985},
      Pages = {70--100},
      Volume = {22}
    }
  • T. Terlaky, "A Convergent Criss–Cross Method," Mathemathische Operationsforschung und Statistics ser. Optimization, vol. 16, iss. 5, pp. 683-690, 1985. bibtex
    @Article{Terlaky1985a, Title = {A Convergent Criss–Cross Method},
      Author = {Terlaky, T.},
      Journal = {Mathemathische Operationsforschung und Statistics ser. Optimization},
      Year = {1985},
      Number = {5},
      Pages = {683 -- 690},
      Volume = {16}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @Book{terlaky2012modeling, Title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      Author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      Publisher = {Springer},
      Year = {2012},
      Volume = {21}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @Article{terlaky2013special, Title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      Author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      Journal = {Optimization Methods and Software},
      Year = {2013},
      Number = {3},
      Pages = {393--395},
      Volume = {28},
      Publisher = {Taylor \& Francis}
    }
  • T. Terlaky and T. Tsuchiya, "A Note on Mascarenhas’ Counterexample about Global Convergence of the Affine Scaling Algorithm," Applied Mathematics \& Optimization, vol. 40, pp. 287-314, 1999. bibtex Go to document
    @Article{Terlaky1999, Title = {A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm},
      Author = {Terlaky, T. and Tsuchiya, T.},
      Journal = {Applied Mathematics \& Optimization},
      Year = {1999},
      Note = {10.1007/s002459900127},
      Pages = {287-314},
      Volume = {40},
      Affiliation = {Department of Mathematics and Computer Science, Delft University of Technology, P.O. Box 5031, NL-2600 GA Delft, The Netherlands t.terlaky@its.twi.tudelft.nl NL},
      ISSN = {0095-4616},
      Issue = {3},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s002459900127}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex Go to document
    @Article{Terlaky2008, Title = {On routing in VLSI design and communication networks},
      Author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      Journal = {Discrete Appl. Math.},
      Year = {2008},
      Month = {June},
      Pages = {2178--2194},
      Volume = {156},
      Acmid = {1393780},
      Address = {Amsterdam, The Netherlands, The Netherlands},
      Doi = {10.1016/j.dam.2008.01.014},
      ISSN = {0166-218X},
      Issue = {11},
      Keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      Numpages = {17},
      Publisher = {Elsevier Science Publishers B. V.},
      Url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • T. Terlaky and J. Vial, "Computing Maximum Likelihood Estimators of Convex Density Functions," SIAM Journal on Scientific Computing, vol. 19, iss. 2, pp. 675-694, 1998. bibtex
    @Article{Terlaky1998, Title = {Computing Maximum Likelihood Estimators of Convex Density Functions},
      Author = {Terlaky, T. and Vial, J.-Ph.},
      Journal = {SIAM Journal on Scientific Computing},
      Year = {1998},
      Number = {2},
      Pages = {675--694},
      Volume = {19}
    }
  • T. Terlaky and Z. Wang, "On the Identification of the Optimal Partition of Second Order Cone Optimization Problems," SIAM Journal on Optimization, vol. 24, iss. 1, pp. 385-414, 2014. bibtex
    @Article{Terlaky2014, Title = {On the Identification of the Optimal Partition of Second Order Cone Optimization Problems},
      Author = {Terlaky, T. and Wang, Z.},
      Journal = {SIAM Journal on Optimization},
      Year = {2014},
      Number = {1},
      Pages = {385--414},
      Volume = {24},
      Owner = {jgoez},
      Timestamp = {2014.09.02}
    }
  • T. Terlaky and S. Zhang, "Pivot Rules for Linear Programming – A Survey," Annales of Operations Research, vol. 46, pp. 203-233, 1993. bibtex
    @Article{Terlaky1993, Title = {Pivot Rules for Linear Programming – A Survey},
      Author = {Terlaky, T. and Zhang, S.},
      Journal = {Annales of Operations Research},
      Year = {1993},
      Pages = {203 -- 233},
      Volume = {46}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex Go to document
    @Article{Terlaky2008a, Title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      Author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      Journal = {Optimization Letters},
      Year = {2008},
      Note = {10.1007/s11590-008-0076-7},
      Pages = {497-503},
      Volume = {2},
      Affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      ISSN = {1862-4472},
      Issue = {4},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @Article{Yang2006, Title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      Author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      Journal = {Communications in Computational Physics},
      Year = {2006},
      Number = {3},
      Pages = {528-547},
      Volume = {1}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex Go to document
    @Article{DinghuiYang06012006, Title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      Author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      Journal = {Bulletin of the Seismological Society of America},
      Year = {2006},
      Number = {3},
      Pages = {1114-1130},
      Volume = {96},
      Doi = {10.1785/0120050080},
      Eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      Url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex Go to document
    @Article{Zinchenko2008, Title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      Author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      Journal = {Physics in Medicine and Biology},
      Year = {2008},
      Number = {12},
      Pages = {3231},
      Volume = {53},
      Abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      Url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }

2008

  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex Go to document
    @Article{Anand2007, Title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      Author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      Journal = {Optimization and Engineering},
      Year = {2007},
      Note = {10.1007/s11081-007-9009-z},
      Pages = {215-238},
      Volume = {8},
      Affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      ISSN = {1389-4420},
      Issue = {2},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @Article{anand2011optimizing, Title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      Author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      Journal = {Algorithmic Operations Research},
      Year = {2011},
      Number = {1},
      Pages = {Pages--1},
      Volume = {6}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex Go to document
    @Article{Anand2004, Title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      Author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      Journal = {Optimization and Engineering},
      Year = {2004},
      Note = {10.1023/B:OPTE.0000042036.04931.49},
      Pages = {485-502},
      Volume = {5},
      ISSN = {1389-4420},
      Issue = {4},
      Keyword = {Engineering},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex Go to document
    @Article{Andersen2003, Title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      Author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      Journal = {Mathematical Programming},
      Year = {2003},
      Note = {10.1007/s10107-002-0349-3},
      Pages = {249-277},
      Volume = {95},
      Affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex Go to document
    @Article{Andersen2002, Title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      Author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      Journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      Year = {2002},
      Number = {4},
      Pages = {627 -- 643},
      Volume = {51},
      Url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • K. M. Anstreicher, D. den Hertog, C. Roos, and T. Terlaky, "A Long Step Barrier Method for Convex Quadratic Programming," Algorithmica, vol. 10, pp. 365-382, 1993. bibtex
    @Article{Anstreicher1993, Title = {A Long Step Barrier Method for Convex Quadratic Programming},
      Author = {Anstreicher, K.M. and den Hertog, D. and Roos, C. and Terlaky, T.},
      Journal = {Algorithmica},
      Year = {1993},
      Pages = {365 -- 382},
      Volume = {10}
    }
  • K. M. Anstreicher and T. Terlaky, "A Monotonic Build-Up Simplex Algorithm," Operations Research, vol. 42, pp. 556-561, 1994. bibtex
    @Article{Anstreicher1994, Title = {A Monotonic Build-Up Simplex Algorithm},
      Author = {Anstreicher, K.M. and Terlaky, T.},
      Journal = {Operations Research},
      Year = {1994},
      Pages = {556 -- 561},
      Volume = {42}
    }
  • F. Bastos, J. Judice, J. Paixõ, L. Portugal, and T. Terlaky, "An Investigation of Interior Point Algorithms for the Linear Transportation Problems," SIAM Journal on Computing, vol. 17, iss. 5, pp. 1202-1223, 1994. bibtex
    @Article{Bastos1994, Title = {An Investigation of Interior Point Algorithms for the Linear Transportation Problems},
      Author = {Bastos, F. and Judice, J. and Paix\~o, J. and Portugal, L. and Terlaky, T.},
      Journal = {SIAM Journal on Computing},
      Year = {1994},
      Number = {5},
      Pages = {1202 -- 1223},
      Volume = {17}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online, 2012. bibtex Go to document
    @Article{belotti2012conic, Title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      Author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      Journal = {Optimization Online},
      Year = {2012},
      Url = {http://www. optimization-online. org/DB\_HTML/2012/06/3494. html}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering2011. bibtex
    @TechReport{belotti2011families, Title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      Author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      Institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      Year = {2011}
    }
  • A. B. Berkelaar, B. Jansen, K. Roos, and T. Terlaky, "Basis- and partition identification for quadratic programming and linear complementarity problems," Mathematical Programming, vol. 86, pp. 261-282, 1999. bibtex Go to document
    @Article{Berkelaar1999, Title = {Basis- and partition identification for quadratic programming and linear complementarity problems},
      Author = {Berkelaar, Arjan B. and Jansen, Benjamin and Roos, Kees and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {1999},
      Note = {10.1007/s101070050089},
      Pages = {261-282},
      Volume = {86},
      Affiliation = {Econometric Institute, Faculty of Economics, Erasmus University Rotterdam, The Netherlands NL},
      ISSN = {0025-5610},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s101070050089}
    }
  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex Go to document
    @Article{Bomze2000, Title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      Author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      Journal = {J. of Global Optimization},
      Year = {2000},
      Month = {December},
      Pages = {301--320},
      Volume = {18},
      Acmid = {596351},
      Address = {Hingham, MA, USA},
      Doi = {10.1023/A:1026583532263},
      ISSN = {0925-5001},
      Issue = {4},
      Keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      Numpages = {20},
      Publisher = {Kluwer Academic Publishers},
      Url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @Article{deak2012convex, Title = {Convex approximations in stochastic programming by semidefinite programming},
      Author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      Journal = {Annals of Operations Research},
      Year = {2012},
      Number = {1},
      Pages = {171--182},
      Volume = {200},
      Publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @Article{deza2012global, Title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      Author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      Journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      Year = {2012},
      Pages = {71},
      Volume = {80},
      Publisher = {Citeseer}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex Go to document
    @Article{Deza20082166, Title = {The colourful feasibility problem},
      Author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      Journal = {Discrete Applied Mathematics},
      Year = {2008},
      Note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      Number = {11},
      Pages = {2166 - 2177},
      Volume = {156},
      Doi = {DOI: 10.1016/j.dam.2008.01.016},
      ISSN = {0166-218X},
      Keywords = {Colourful linear programming},
      Url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex Go to document
    @Article{Deza2006a, Title = {Colourful Simplicial Depth},
      Author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      Journal = {Discrete \& Computational Geometry},
      Year = {2006},
      Note = {10.1007/s00454-006-1233-3},
      Pages = {597-615},
      Volume = {35},
      Affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      ISSN = {0179-5376},
      Issue = {4},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex Go to document
    @Article{Deza2006, Title = {The central path visits all the vertices of the Klee–Minty cube},
      Author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      Journal = {Optimization Methods and Software},
      Year = {2006},
      Number = {5},
      Pages = {851-- 865},
      Volume = {21},
      Url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex Go to document
    @Article{Deza2008, Title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      Author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      Journal = {Mathematical Programming},
      Year = {2008},
      Note = {10.1007/s10107-006-0044-x},
      Pages = {1-14},
      Volume = {113},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      ISSN = {0025-5610},
      Issue = {1},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex Go to document
    @Article{Deza2008221, Title = {Diameter and Curvature: Intriguing Analogies},
      Author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      Journal = {Electronic Notes in Discrete Mathematics},
      Year = {2008},
      Note = {The International Conference on Topological and Geometric Graph Theory},
      Pages = {221 - 225},
      Volume = {31},
      Doi = {DOI: 10.1016/j.endm.2008.06.044},
      ISSN = {1571-0653},
      Keywords = {Continuous d-step and Hirsch conjectures},
      Url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex Go to document
    @Article{Deza2009, Title = {A Continuous d-Step Conjecture for Polytopes},
      Author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      Journal = {Discrete \& Computational Geometry},
      Year = {2009},
      Note = {10.1007/s00454-008-9096-4},
      Pages = {318-327},
      Volume = {41},
      Affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      ISSN = {0179-5376},
      Issue = {2},
      Keyword = {Mathematics and Statistics},
      Publisher = {Springer New York},
      Url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex Go to document
    @Article{Deza2008215, Title = {Polytopes and arrangements: Diameter and curvature},
      Author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      Journal = {Operations Research Letters},
      Year = {2008},
      Number = {2},
      Pages = {215 - 222},
      Volume = {36},
      Doi = {DOI: 10.1016/j.orl.2007.06.007},
      ISSN = {0167-6377},
      Keywords = {Polytopes},
      Url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }
  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex Go to document
    @Article{Du2009, Title = {Self-adaptive support vector machines: modelling and experiments},
      Author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      Journal = {Computational Management Science},
      Year = {2009},
      Note = {10.1007/s10287-008-0071-6},
      Pages = {41-51},
      Volume = {6},
      Affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      ISSN = {1619-697X},
      Issue = {1},
      Keyword = {Business and Economics},
      Publisher = {Springer Berlin / Heidelberg},
      Url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • K. Fukuda and T. Terlaky, "On the existence of a short admissible pivot sequence for feasibility and linear optimization problems," Pure Mathematics and Applications, vol. 10, iss. 4, pp. 431-447, 1999. bibtex Go to document
    @Article{Fukuda1999, Title = {On the existence of a short admissible pivot sequence for feasibility and linear optimization problems},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Pure Mathematics and Applications},
      Year = {1999},
      Number = {4},
      Pages = {431-447},
      Volume = {10},
      Url = {http://ideas.repec.org/a/cmt/pumath/puma1999v010pp0431-0447.html}
    }
  • K. Fukuda and T. Terlaky, "Criss-Cross Methods: A Fresh View on Pivot Algorithms," Mathematical Programming Series B, vol. 79, iss. 1–3, pp. 369-395, 1997. bibtex
    @Article{Fukuda1997, Title = {Criss-Cross Methods: A Fresh View on Pivot Algorithms},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {Mathematical Programming Series B},
      Year = {1997},
      Number = {1--3},
      Pages = {369--395},
      Volume = {79}
    }
  • K. Fukuda and T. Terlaky, "Linear Complementarity and Oriented Matroids," apanese Journal of Operations Research, vol. 35, pp. 45-61, 1992. bibtex
    @Article{Fukuda1992, Title = {Linear Complementarity and Oriented Matroids},
      Author = {Fukuda, K. and Terlaky, T.},
      Journal = {apanese Journal of Operations Research},
      Year = {1992},
      Note = {Selected as “The best OR paper of the year 1992” by The Operations Research Society of Japan.},
      Pages = {45 -- 61},
      Volume = {35}
    }
  • O. Güler, C. Roos, T. Terlaky, and J. Vial, "A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming," Management Science, vol. 41, pp. 1922-1934, 1995. bibtex
    @Article{Guler1995, Title = {A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming},
      Author = {G\"uler, O. and Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      Journal = {Management Science},
      Year = {1995},
      Pages = {1922 -- 1934},
      Volume = {41}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex Go to document
    @Article{GhaffariHadigheh2007, Title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      Author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2007},
      Note = {10.1007/s10957-007-9201-5},
      Pages = {303-315},
      Volume = {133},
      Affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      ISSN = {0022-3239},
      Issue = {3},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex Go to document
    @Article{Ghaffari-Hadigheh2008, Title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      Journal = {Central European Journal of Operations Research},
      Year = {2008},
      Note = {10.1007/s10100-007-0054-7},
      Pages = {215-238},
      Volume = {16},
      Affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      ISSN = {1435-246X},
      Issue = {2},
      Keyword = {Business and Economics},
      Publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      Url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex Go to document
    @Article{Ghaffari-Hadigheh2010, Title = {Bi-parametric convex quadratic optimization},
      Author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      Journal = {Optimization Methods Software},
      Year = {2010},
      Month = {April},
      Pages = {229--245},
      Volume = {25},
      Acmid = {1744722},
      Address = {Bristol, PA, USA},
      Doi = {http://dx.doi.org/10.1080/10556780903239568},
      ISSN = {1055-6788},
      Issue = {2},
      Keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      Numpages = {17},
      Publisher = {Taylor \& Francis, Inc.},
      Url = {http://dx.doi.org/10.1080/10556780903239568}
    }
  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex Go to document
    @Article{Glineur2004, Title = {Conic Formulation for lp-Norm Optimization},
      Author = {Glineur, F. and Terlaky, T.},
      Journal = {Journal of Optimization Theory and Applications},
      Year = {2004},
      Note = {10.1023/B:JOTA.0000042522.65261.51},
      Pages = {285-307},
      Volume = {122},
      ISSN = {0022-3239},
      Issue = {2},
      Keyword = {Computer Science},
      Publisher = {Springer Netherlands},
      Url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • H. J. Greenberg, A. G. Holder, K. Roos, and T. Terlaky, "On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance," SIAM J. on Optimization, vol. 9, pp. 207-216, 1998. bibtex Go to document
    @Article{Greenberg1998, Title = {On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance},
      Author = {Greenberg, Harvey J. and Holder, Allen G. and Roos, Kees and Terlaky, Tam\'{a}s},
      Journal = {SIAM J. on Optimization},
      Year = {1998},
      Month = {May},
      Pages = {207--216},
      Volume = {9},
      Acmid = {589113},
      Address = {Philadelphia, PA, USA},
      Doi = {http://dx.doi.org/10.1137/S1052623497316798},
      ISSN = {1052-6234},
      Issue = {1},
      Keywords = {computational economics, linear programming, optimal partition, polyhedral combinatorics, polyhedron, quadratic programming},
      Numpages = {10},
      Publisher = {Society for Industrial and Applied Mathematics},
      Url = {http://dx.doi.org/10.1137/S1052623497316798}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex Go to document
    @Article{AOR4624, Title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      Author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      Journal = {Algorithmic Operations Research},
      Year = {2007},
      Number = {2},
      Pages = {94--111},
      Volume = {2},
      Keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      Url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @Article{Hadigheh2006, Title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      Author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      Journal = {INFOR: Information Systems and Operational Research},
      Year = {2006},
      Number = {2},
      Pages = {129-155},
      Volume = {44}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex Go to document
    @Article{Hadigheh20061158, Title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      Author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      Journal = {European Journal of Operational Research},
      Year = {2006},
      Number = {3},
      Pages = {1158 - 1175},
      Volume = {169},
      Doi = {DOI: 10.1016/j.ejor.2004.09.058},
      ISSN = {0377-2217},
      Keywords = {Parametric optimization},
      Url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex