Tamás Terlaky

1. A Survey of the S-Lemma
   2007/01/01 by Imre Pólik, Tamás Terlaky · 15 citations
   Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Numerical Methods and Algorithms #Polynomial and algebraic computation
2. A quantum central path algorithm for linear optimization
   2023/11/07 by Brandon Augustino, Augustino, Brandon, Jiaqi Leng +7 · 7 citations
   Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Optimization and Control (math.OC) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
3. The linear complimentarity problem, sufficient matrices, and the criss-cross method
   1993/07/01 by D. den Hertog, Dick den Hertog, C. Roos +2 · 2 citations
   Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Combinatorics #Eigenvalues and eigenvectors #Generalization #Linear complementarity problem #Mathematical analysis #Mathematics #Matrix (chemical analysis) #Matrix Theory and Algorithms #Matroid #Optimization and Variational Analysis #Positive-definite matrix #Simple (philosophy) #Transpose
4. Improvements to Quantum Interior Point Method for Linear Optimization
   2023/10/11 by Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Mohammadisiahroudi, Mohammadhossein +7 · 6 citations
   Computer Science · Mathematics · Physics and Astronomy · #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Optimization and Control (math.OC) #Orbital Angular Momentum in Optics
5. Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
   2021/01/23 by Rodolfo Quintero, David E. Bernal, Quintero, Rodolfo +5 · 2 citations
   Computer Science · Engineering · #68Q12 #81P68 #B.8 #C.5 #F.2.1 #FOS: Mathematics #FOS: Physical sciences #Optical Network Technologies #Optimization and Control (math.OC) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
6. Primal-dual algorithms for linear programming based on the logarithmic barrier method
   1994/10/01 by Benjamin Jansen, B. Jansen, C. Roos +4 · 1 citation
   Mathematics · Computer Science · Engineering · #Advanced Optimization Algorithms Research #Optimization and Variational Analysis #Optimization and Mathematical Programming
7. The finite criss-cross method for hyperbolic programming
   1999/04/01 by Tibor Illés, Ákos Szirmai, Tamás Terlaky · 2 citations
   Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Optimization and Packing Problems #Optimization and Variational Analysis
8. Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy
   2025/02/16 by Yue Tu, Tu, Yue, Mark Dubynskyi +13 · 4 citations
   Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #FOS: Mathematics #FOS: Physical sciences #Machine Learning (cs.LG) #Optimization and Control (math.OC) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
9. On relaxations of the max k-cut problem formulations
   2023/08/02 by Ramin Fakhimi, Fakhimi, Ramin, Hamidreza Validi +7 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Optimization Algorithms Research #Complexity and Algorithms in Graphs #FOS: Mathematics #Optimization and Control (math.OC)
10. Quantum Computing Inspired Iterative Refinement for Semidefinite Optimization
    2023/12/18 by Mohammadhossein Mohammadisiahroudi, Mohammadisiahroudi, Mohammadhossein, Brandon Augustino +5 · 2 citations
    Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Neural Networks and Reservoir Computing #Optimization and Control (math.OC) #Sparse and Compressive Sensing Techniques
11. How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds
    2006/10/20 by Antoine Deza, Eissa Nematollahi, Tamás Terlaky · 1 citation
    Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Complexity and Algorithms in Graphs #Sparse and Compressive Sensing Techniques
12. Pivot rules for linear programming: A survey on recent theoretical developments
    1993/03/01 by Tamás Terlaky, Shuzhong Zhang · 1 citation
    Computer Science · Engineering · Mathematics · #Advanced Control Systems Optimization #Advanced Optimization Algorithms Research #Algorithm #Artificial intelligence #Class (philosophy) #Combinatorics #Computer science #Data mining #First class #Linear programming #Mathematics #Parametric programming #Parametric statistics #Point (geometry) #Polynomial and algebraic computation #Simplex #Simplex algorithm #Theory of computation #Type (biology)