Tamás Terlaky

7.5k total citations · 1 hit paper
186 papers, 4.4k citations indexed

About

Tamás Terlaky is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Control and Systems Engineering. According to data from OpenAlex, Tamás Terlaky has authored 186 papers receiving a total of 4.4k indexed citations (citations by other indexed papers that have themselves been cited), including 125 papers in Numerical Analysis, 118 papers in Computational Theory and Mathematics and 40 papers in Control and Systems Engineering. Recurrent topics in Tamás Terlaky's work include Advanced Optimization Algorithms Research (124 papers), Matrix Theory and Algorithms (40 papers) and Optimization and Variational Analysis (38 papers). Tamás Terlaky is often cited by papers focused on Advanced Optimization Algorithms Research (124 papers), Matrix Theory and Algorithms (40 papers) and Optimization and Variational Analysis (38 papers). Tamás Terlaky collaborates with scholars based in Netherlands, Canada and United States. Tamás Terlaky's co-authors include C. Roos, Imre Pólik, Erling D. Andersen, Jiming Peng, Jean-Philippe Vial, Shuzhong Zhang, Benjamin Jansen, Etienne de Klerk, Dick den Hertog and Hans Frenk and has published in prestigious journals such as SHILAP Revista de lepidopterología, Management Science and European Journal of Operational Research.

In The Last Decade

Tamás Terlaky

173 papers receiving 4.1k citations

Hit Papers

On implementing a primal-dual interior-point method for c... 2003 2026 2010 2018 2003 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. On implementing a primal-dual interior-point method for conic quadratic optimization
    2003 499 citations C. Roos, Tamás Terlaky et al. Mathematical Programming profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Tamás Terlaky Netherlands 30 2.5k 2.4k 1.0k 651 345 186 4.4k
C. Roos Netherlands 33 2.8k 1.1× 2.7k 1.2× 653 0.6× 698 1.1× 350 1.0× 133 4.3k
J. Frédéric Bonnans France 26 2.1k 0.8× 2.6k 1.1× 995 1.0× 1.0k 1.6× 406 1.2× 119 4.9k
Jean‐Baptiste Hiriart‐Urruty France 26 2.5k 1.0× 3.0k 1.3× 734 0.7× 1.2k 1.8× 255 0.7× 79 5.3k
Michael L. Overton United States 36 2.1k 0.8× 2.4k 1.0× 1.1k 1.1× 1.0k 1.6× 413 1.2× 111 4.9k
Christian Kanzow Germany 45 3.8k 1.5× 4.1k 1.7× 1.2k 1.2× 729 1.1× 474 1.4× 135 6.3k
Masakazu Kojima Japan 35 3.2k 1.3× 3.1k 1.3× 730 0.7× 931 1.4× 412 1.2× 118 4.3k
L. N. Vicente Portugal 32 1.7k 0.7× 2.0k 0.8× 1.0k 1.0× 748 1.1× 328 1.0× 94 4.6k
Klaus Schittkowski Germany 23 1.7k 0.7× 1.8k 0.8× 1.1k 1.1× 651 1.0× 324 0.9× 55 4.8k
Adrian S. Lewis United States 40 2.3k 0.9× 2.7k 1.1× 899 0.9× 1.9k 2.9× 358 1.0× 132 6.0k
Sven Leyffer United States 28 1.9k 0.7× 1.7k 0.7× 1.6k 1.6× 383 0.6× 892 2.6× 98 4.6k

Countries citing papers authored by Tamás Terlaky

Since Specialization
Citations

This map shows the geographic impact of Tamás Terlaky's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Tamás Terlaky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tamás Terlaky more than expected).

Fields of papers citing papers by Tamás Terlaky

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tamás Terlaky. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Tamás Terlaky. The network helps show where Tamás Terlaky may publish in the future.

Co-authorship network of co-authors of Tamás Terlaky

This figure shows the co-authorship network connecting the top 25 collaborators of Tamás Terlaky. A scholar is included among the top collaborators of Tamás Terlaky based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Tamás Terlaky. Tamás Terlaky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Terlaky, Tamás, et al.. (2025). Quantum computing inspired iterative refinement for semidefinite optimization. Mathematical Programming.
2.
Terlaky, Tamás, et al.. (2024). Efficient Use of Quantum Linear System Algorithms in Inexact Infeasible IPMs for Linear Optimization. Journal of Optimization Theory and Applications. 202(1). 146–183. 3 indexed citations
3.
Terlaky, Tamás, et al.. (2024). Improvements to Quantum Interior Point Method for Linear Optimization. 6(1). 1–24. 1 indexed citations
4.
Hicks, Illya V., et al.. (2023). On relaxations of the max k-cut problem formulations. Operations Research Letters. 51(5). 521–527.
5.
Yang, Xiu, et al.. (2023). An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization. Entropy. 25(2). 330–330. 6 indexed citations
6.
Belotti, Pietro, et al.. (2016). A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. Discrete Optimization. 24. 3–31. 4 indexed citations
7.
Terlaky, Tamás, et al.. (2015). Disjunctive conic cuts for mixed integer second order cone optimization. Les Cahiers du GERAD. 1–24. 3 indexed citations
8.
Terlaky, Tamás & Frank E. Curtis. (2012). Modeling and optimization : theory and applications : selected contributions from the MOPTA 2010 conference. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations
9.
Peng, Jiming, C. Roos, & Tamás Terlaky. (2009). Self-Regularity. Princeton University Press eBooks. 2 indexed citations
10.
Terlaky, Tamás, et al.. (2008). On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization. Optimization methods & software. 25(3). 467–485. 7 indexed citations
11.
Deza, Antoine, et al.. (2008). The colourful feasibility problem. Discrete Applied Mathematics. 156(11). 2166–2177. 11 indexed citations
12.
Terlaky, Tamás, et al.. (2008). On routing in VLSI design and communication networks. Discrete Applied Mathematics. 156(11). 2178–2194. 11 indexed citations
13.
Ghaffari-Hadigheh, ‎Alireza, Oleksandr Romanko, & Tamás Terlaky. (2007). Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. Érudit (Université de Montréal). 2(2). 94–111. 17 indexed citations
14.
Ghaffari-Hadigheh, ‎Alireza & Tamás Terlaky. (2006). Generalized support set invariancy sensitivity analysis in linear optimization. Journal of Industrial and Management Optimization. 2(1). 1–18. 11 indexed citations
15.
Fukuda, K. & Tamás Terlaky. (1999). On the Existence of a Short Admissible Pivot Sequence for Feasibility and Linear Optimization Problems. RePEc: Research Papers in Economics. 3 indexed citations
16.
Roos, C., Tamás Terlaky, & Jean-Philippe Vial. (1997). Theory and algorithms for linear optimization : an interior point approach. Wiley eBooks. 368 indexed citations
17.
Warners, Joost P., Tamás Terlaky, C. Roos, & Benjamin Jansen. (1997). A potential reduction approach to the frequency assignment problem. Discrete Applied Mathematics. 78(1-3). 251–282. 9 indexed citations
18.
Hertog, Dick den, C. Roos, & Tamás Terlaky. (1993). The linear complimentarity problem, sufficient matrices, and the criss-cross method. Linear Algebra and its Applications. 187. 1–14. 26 indexed citations
19.
Terlaky, Tamás. (1987). A finite crisscross method for oriented matroids. Journal of Combinatorial Theory Series B. 42(3). 319–327. 27 indexed citations
20.
Terlaky, Tamás. (1986). Egy véges criss-cross módszer és alkalmazásai. REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection).

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by C. Roos Breakdown of academic impact, for papers by J. Frédéric Bonnans Breakdown of academic impact, for papers by Jean‐Baptiste Hiriart‐Urruty Breakdown of academic impact, for papers by Michael L. Overton Breakdown of academic impact, for papers by Christian Kanzow Breakdown of academic impact, for papers by Masakazu Kojima Breakdown of academic impact, for papers by L. N. Vicente Breakdown of academic impact, for papers by Klaus Schittkowski Breakdown of academic impact, for papers by Adrian S. Lewis Breakdown of academic impact, for papers by Sven Leyffer
Rankless by CCL
2026