Tamás Terlaky Explained

Tamás Terlaky
Birth Date:10 January 1955
Birth Place:Kaposvár, Hungary
Nationality:American, Canadian, Hungarian
Occupation:Mathematician and optimizer
Known For:Criss-cross algorithms and optimization
Spouse:Gabriella Terlaky Török
Children:1
Alma Mater:Eötvös Loránd University
Thesis Year:1981
Doctoral Advisor:Emil Klafszky
Main Interests:Optimization

Tamás 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]

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:

Selected publications

Books

Papers

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

See also

External links

Notes and References

  1. https://www.kisalfold.hu/gyor-es-kornyeke/gyorben-europa-matematikai-elitje-a-matematika-kulcsfontossagu-lesz-a-jovo-technologiai-fejleszteseiben-6191808/ Győrben Európa matematikai elitje - A matematika kulcsfontosságú lesz a jövő technológiai fejlesztéseiben
  2. Web site: Tamas Terlaky .
  3. Web site: Tamás Terlaky. 20 May 2018.
  4. Terlaky. Tamás. A convergent criss-cross method. Optimization: A Journal of Mathematical Programming and Operations Research. 16. 1985. 5. 683–690. 0233-1934. 10.1080/02331938508843067. 798939.
  5. Terlaky. Tamás. A finite crisscross method for oriented matroids. 42. 1987. 3. 319–327. Journal of Combinatorial Theory. Series B. 0095-8956. 10.1016/0095-8956(87)90049-9. 888684. . free.
  6. Terlaky. Tamás. Zhang. Shu Zhong. Pivot rules for linear programming: A Survey on recent theoretical developments. Annals of Operations Research. 46–47. 1993. 203–233 . 10.1007/BF02096264. 1260019 . 10.1.1.36.7658 . 6058077. 0254-5330.
  7. Terlaky. Tamás. Zhang. Shu Zhong. Pivot rules for linear programming: A Survey on recent theoretical developments. Annals of Operations Research. 46–47. 1993. 203–233 . 10.1007/BF02096264. 1260019 . 10.1.1.36.7658 . 6058077. 1991 . 0254-5330.
  8. Web site: Professor Tamás Terlaky.
  9. Web site: $2.1M DARPA grant puts Lehigh Univ. Optimization experts at vanguard of quantum computing.
  10. Web site: Fields Institute Fellows. Fields Institute. University of Toronto. 26 April 2017.
  11. Web site: Lehigh University professor elected SIAM 2018 Fellow.
  12. Web site: Lehigh University engineers win award for algorithm that saved state prison system millions of dollars. 24 October 2017 .
  13. Web site: Tinder for criminals: Computer program matches inmates with suitable prisons. 24 October 2017.
  14. Web site: Engineers Help State Corrections Department Save Millions.
  15. https://mik.uni-pannon.hu/index.php/hu/szervezet/fotogaleriak/2018/tanevnyito-uennepseg-2018.html?page=3#category Pannon Egyetem Műszaki Informatikai Kar

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Tamás Terlaky".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.