Tamas Terlaky

Tamas Terlaky is a Hungarian-Canadian-American professor of Industrial and Systems Engineering at Lehigh University.[1] He is especially well-known for his work on criss-cross algorithms, interior-point methods, Klee-Minty examples for path following algorithms, and optimization.[2][3]

Tamas Terlaky
NationalityHungarian
OccupationMathematician and Optimizer
Known forCriss-cross algorithms and optimization
AwardsFellow of The Fields Institute (2005)

Fellow of INFORMS (2017)
Fellow of SIAM (2018)

Fellow of the Canadian Academy of Engineering (2020)
Academic background
Alma materEötvös Loránd University
Thesis (1981)
Doctoral advisorEmil Klafszky
Academic work
InstitutionsEötvös Loránd University, Budapest, Hungary

Delft University of Technology, The Netherlands
McMaster University, Hamilton, Ontario, Canada

Lehigh University, Bethlehem, Pennsylvania, USA
Main interestsOptimization

Biography

Terlaky was born on January 10, 1955, in Kaposvár, Hungary. He studied Mathematics and Operations Research at the Eötvös Loránd University in Budapest, Hungary. He earned his Ph.D. in 1981 under the supervision of Emil Klafszky. Terlaky taught at Eötvös Loránd University from 1981 to 1989; at the Delft University of Technology from 1989 to 1999; and at McMaster University in Hamilton, Ontario from 1999 to 2008, when he moved to Lehigh University. At Lehigh, he holds the George N. and Soteria Kledaras Endowed Chair. From 2008 to 2017, he served as the Chair of the Industrial and Systems Engineering Department. Since 2020 he is Director of the Quantum Computing and Optimization Laboratory.[2][3]

He was founding Chair (2000) and since 2003 Honorary Chair of EUROPT, The Continuous Optimization Working group of EURO. From 2017 to 2019, he was elected as Chair of the SIAM Activity Group of Optimization. Since 2019, he is Vice President of INFORMS.[2][3]

Career

In 1985 and 1987, Terlaky independently published on the criss-cross algorithm.[4][5][6] The theory of oriented matroids has also been used by Terlaky and Zhang (1991) to prove that their criss-cross algorithms have finite termination for linear programming problems.[7]

Terlaky has previously taught at Eötvös Loránd University and Delft University of Technology. From 1999 to 2008, he was Professor at the Department of Computing and Software at McMaster University, and was also the founding director of the School of Computational Engineering and Science at the same university.[8]

In 2020, Terlaky, along with Luis Zuluaga and Boris Defourny, was the recipient of a large quantum computing research grant from DARPA.[9]

Terlaky is also a founding editor-in-chief of Optimization and Engineering (founded in 1998), a journal specializing in mathematical optimization and its applications.[8] He has served on numerous editorial boards, including the Journal of Optimization Theory and Applications, Computational Optimization and Applications, European Journal on Operational research, Optimization Methods and Software, Optimization Letters, and Journal of Computational Sciences.

Recognition

Terlaky has been elected as:

In 2017, he was awarded the 2017 Daniel H. Wagner Prize for Excellence in Operations Research Practice for helping to improve algorithmic efficiency at the Pennsylvania Department of Corrections by creating the unique Inmate Assignment Decision Support System (IADSS).[12][13][14]

Also, in 2019, for his pioneering work in correctional systems, he was awarded the Outstanding Innovation in Service Systems Engineering award by the Institute of Industrial Engineers (IISE).

Additional awards:

  • Award of Merit of the Canadian Operations Research Society (2015)
  • Egerváry Award of the Hungarian Operations Research Society (2017)
  • Farkas Award of the János Bolyai Mathematical Society of Hungary (1985)
  • Four-time finalist of the George D. Smith Prizre of INFORMS-UPS (2021, 2013, 2014, 2015)
  • Distinguished Visiting Professor Award, the University of Pannonia, Veszprém, Hungary (2018)[15]

Selected publications

Books
  • Roos, Cornelis; Terlaky, Tamás; Vial, Jean-Philippe (1997). Interior Point Approach to Linear Optimization: Theory and Algorithms. John Wiley & Sons, Chichester, New York, (second print by Springer Science (1998).
  • Peng, Jiming; Roos, Cornelis; Terlaky, Tamás (2002). Self-Regularity: A New Paradigm for Primal-Dual Interior Point Methods”. Princeton University Press.
  • Terlaky, Tamás (editor) (1996). Interior Point Methods in Mathematical Programming. Kluwer Academic Publisher, Dordrecht, The Netherlands.
  • Terlaky, Tamás; Anjos, Miguel F.; Ahmed, Shabbir (editors) (2017). Handbook of Advances and Trends in Optimization with Engineering Applications, Advances and Trends in Optimization with Engineering Applications. MOS-SIAM Book Series on Optimization, SIAM, Philadelphia.

Papers

Terlaky has published over 160 papers, some of which are:

  • Fukuda, Komei; Terlaky, Tamás (1997). Liebling, Thomas M.; de Werra, Dominique (eds.). "Criss-cross methods: A fresh view on pivot algorithms". Mathematical Programming, Series B. 79 (Papers from the 16th International Symposium on Mathematical Programming held in Lausanne, 1997, number 1–3): 369–395. CiteSeerX 10.1.1.36.9373. doi:10.1007/BF02614325. MR 1464775. Postscript preprint.CS1 maint: ref=harv (link)
  • den Hertog, Dick; Roos, Cornelis; Terlaky, Tamás (1 July 1993). "The linear complementarity problem, sufficient matrices, and the criss-cross method" (PDF). Linear Algebra and Its Applications. 187: 1–14. doi:10.1016/0024-3795(93)90124-7. MR 1221693.CS1 maint: ref=harv (link)
  • Illés, Tibor; Szirmai, Ákos; Terlaky, Tamás (1999). "The finite criss-cross method for hyperbolic programming". European Journal of Operational Research. 114 (1): 198–214. doi:10.1016/S0377-2217(98)00049-6. Zbl 0953.90055. Postscript preprint.CS1 maint: ref=harv (link)
  • Klafszky, Emil; Terlaky, Tamás (1991). "The role of pivoting in proving some fundamental theorems of linear algebra". Linear Algebra and Its Applications. 151: 97–118. doi:10.1016/0024-3795(91)90356-2. MR 1102142. Archived from the original (postscript) on 27 September 2011. Retrieved 4 August 2011.CS1 maint: ref=harv (link)
  • Terlaky, Tamás (1985). "A convergent criss-cross method". Optimization: A Journal of Mathematical Programming and Operations Research. 16 (5): 683–690. doi:10.1080/02331938508843067. ISSN 0233-1934. MR 0798939.CS1 maint: ref=harv (link)
  • Terlaky, Tamás (1987). "A finite crisscross method for oriented matroids". Journal of Combinatorial Theory. Series B. 42 (3): 319–327. doi:10.1016/0095-8956(87)90049-9. ISSN 0095-8956. MR 0888684.CS1 maint: ref=harv (link)
  • Terlaky, Tamás; Zhang, Shu Zhong (1993). "Pivot rules for linear programming: A Survey on recent theoretical developments". Annals of Operations Research. 46–47: 203–233. CiteSeerX 10.1.1.36.7658. doi:10.1007/BF02096264. ISSN 0254-5330. MR 1260019.CS1 maint: ref=harv (link)
  • Illés, Tibor; Szirmai, Ákos; Terlaky, Tamás (1999). "The finite criss-cross method for hyperbolic programming". European Journal of Operational Research. 114 (1): 198–214. CiteSeerX 10.1.1.36.7090. doi:10.1016/S0377-2217(98)00049-6. ISSN 0377-2217. PDF preprint.CS1 maint: ref=harv (link)
  • Roos, C. (1990). "An exponential example for Terlaky's pivoting rule for the criss-cross simplex method". Mathematical Programming. Series A. 46 (1): 79–84. doi:10.1007/BF01585729. MR 1045573.CS1 maint: ref=harv (link)
  • Terlaky, Tamás (1985). "A convergent criss-cross method". Optimization: A Journal of Mathematical Programming and Operations Research. 16 (5): 683–690. doi:10.1080/02331938508843067. ISSN 0233-1934. MR 0798939.CS1 maint: ref=harv (link)
  • Terlaky, Tamás (1987). "A finite crisscross method for oriented matroids". Journal of Combinatorial Theory. Series B. 42 (3): 319–327. doi:10.1016/0095-8956(87)90049-9. ISSN 0095-8956. MR 0888684.CS1 maint: ref=harv (link)
  • Gondzio, Jacek; Terlaky, Tamás (1996). "A computational view of interior point methods". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. 4. New York: Oxford University Press. pp. 103–144. MR 1438311. Postscript file at website of Gondzio.CS1 maint: ref=harv (link)
  • Pólik, Imre; Terlaky, Tamás (2007) “A survey of the S-lemma” SIAM Review 49 (3), 371-418.
  • Bomze, Immanuael; Dür, Mirjam; De Klerk, Etienne; Roos, Cornelis; Quist, Arie; Terlaky, Tamás (2000) “On copositive programming and standard quadratic optimization problems” Journal of Global Optimization 18 (4), 301-320.
  • Nemirovski, Arkadii; Roos, Cornelis; Terlaky; Tamás (1999) “On maximization of quadratic form over intersection of ellipsoids with common center” Mathematical Programming 86 (3), 463-473.
  • Shahabsafa, Mohammad; Terlaky, Tamás; Gudapati, Chaitanya; Sharma, Anshul; Plebani, Louis; Wilson, George; Bucklen, Kristofer (2018) “The Inmate Assignment and Scheduling Problem and its Application in the PA Department of Correction”, Interfaces 48 (5), 467-483.
  • Andersen, Erling D.; Roos, Cornelis; Terlaky, Tamás (2003) “On implementing a primal-dual interior-point method for conic quadratic optimization” Mathematical Programming 95 (2), 249-277.
  • De Klerk, Etienne; Roos, Cornelis; Terlaky, Tamás (1997) “Initialization in semidefinite programming via a self-dual skew-symmetric embedding” Operations Research Letters 20 (5), 213-221.
  • Deza, Nematollahi & Terlaky (2008) Deza, Antoine; Nematollahi, Eissa; Terlaky, Tamás (May 2008). "How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds". Mathematical Programming. 113 (1): 1–14. CiteSeerX 10.1.1.214.111. doi:10.1007/s10107-006-0044-x. MR 2367063

See also

References
  1. Győrben Európa matematikai elitje - A matematika kulcsfontosságú lesz a jövő technológiai fejlesztéseiben. Kisalfold.hu. 2019-01-29.
  2. http://users.clas.ufl.edu/hager/coap/Journal/Terlaky.html
  3. https://engineering.lehigh.edu/faculty/tamas-terlaky
  4. Terlaky, Tamás (1985). "A convergent criss-cross method". Optimization: A Journal of Mathematical Programming and Operations Research. 16 (5): 683–690. doi:10.1080/02331938508843067. ISSN 0233-1934. MR 0798939.CS1 maint: ref=harv (link)
  5. Terlaky, Tamás (1987). "A finite crisscross method for oriented matroids". Journal of Combinatorial Theory. Series B. 42 (3): 319–327. doi:10.1016/0095-8956(87)90049-9. ISSN 0095-8956. MR 0888684.CS1 maint: ref=harv (link)
  6. Terlaky, Tamás; Zhang, Shu Zhong (1993). "Pivot rules for linear programming: A Survey on recent theoretical developments". Annals of Operations Research. 46–47: 203–233. CiteSeerX 10.1.1.36.7658. doi:10.1007/BF02096264. ISSN 0254-5330. MR 1260019.CS1 maint: ref=harv (link)
  7. Terlaky, Tamás; Zhang, Shu Zhong (1993) [1991]. "Pivot rules for linear programming: A Survey on recent theoretical developments". Annals of Operations Research. 46–47: 203–233. CiteSeerX 10.1.1.36.7658. doi:10.1007/BF02096264. ISSN 0254-5330. MR 1260019.CS1 maint: ref=harv (link)
  8. https://coral.ise.lehigh.edu/terlaky/
  9. https://www.eurekalert.org/pub_releases/2020-03/lu-dg032020.php
  10. "Fields Institute Fellows". Fields Institute. University of Toronto. Retrieved 26 April 2017.
  11. https://www.eurekalert.org/pub_releases/2018-04/lu-lup041218.php
  12. https://www.mcall.com/news/breaking/mc-nws-lehigh-engineering-award-20171024-story.html
  13. https://fox6now.com/2017/10/24/tinder-for-criminals-computer-program-matches-inmates-with-suitable-prisons/
  14. https://www2.lehigh.edu/news/engineers-help-state-corrections-department-save-millions
  15. Pannon Egyetem Műszaki Informatikai Kar
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.