A finite crisscross method for oriented matroids. - Tamás Terlaky (J. Comb. Theory B, 1987)

Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. - Emil Klafszky; Tamás Terlaky (Comb., 1989)

A build-up variant of the logarithmic barrier method for LP. - Dick den Hertog; Cees Roos; Tamás Terlaky (Oper. Res. Lett., 1992)

A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems. - Dick den Hertog; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 1992)

A Long-Step Barrier Method for Convex Quadratic Programming. - Kurt M. Anstreicher; Dick den Hertog; Cornelis Roos; Tamás Terlaky (Algorithmica, 1993)

Degeneracy in interior point methods for linear programming: a survey. - Osman Güler; Dick den Hertog; Cornelis Roos; Tamás Terlaky; Takashi Tsuchiya (Ann. Oper. Res., 1993)

Pivot rules for linear programming: A survey on recent theoretical developments. - Tamás Terlaky; Shuzhong Zhang (Ann. Oper. Res., 1993)

A Monotonic Build-Up Simplex Algorithm for Linear Programming. - Kurt M. Anstreicher; Tamás Terlaky (Oper. Res., 1994)

A logarithmic barrier cutting plane method for convex programming. - Dick den Hertog; John Kaliski; Cees Roos; Tamás Terlaky (Ann. Oper. Res., 1995)

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. - Dick den Hertog; Florian Jarre; Kees Roos; Tamás Terlaky (Math. Program., 1995)

Primal-dual target-following algorithms for linear programming. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Ann. Oper. Res., 1996)

Long-step primal-dual target-following algorithms for linear programming. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Math. Methods Oper. Res., 1996)

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming. - Benjamin Jansen; Cees Roos; Tamás Terlaky (Math. Oper. Res., 1996)

Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. - Benjamin Jansen; Kees Roos; Tamás Terlaky; Yinyu Ye 001 (Math. Program., 1996)

An Investigation of Interior-Point Algorithms for the Linear Transportation Problem. - Luis F. Portugal; Frederico Machado Bastos; Joaquim Júdice; José M. P. Paixão; Tamás Terlaky (SIAM J. Sci. Comput., 1996)

Optimization of nuclear reactor reloading patterns. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky; Tibor Illés; A. J. de Jong; J. Valkó; J. E. Hoogenboom (Ann. Oper. Res., 1997)

A Potential Reduction Approach to the Frequency Assignment Problem. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Discret. Appl. Math., 1997)

Criss-cross methods: A fresh view on pivot algorithms. - Komei Fukuda; Tamás Terlaky (Math. Program., 1997)

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. - Benjamin Jansen; Kees Roos; Tamás Terlaky; Akiko Yoshise (Math. Program., 1997)

Initialization in semidefinite programming via a self-dual skew-symmetric embedding. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Oper. Res. Lett., 1997)

Inverse barriers and CES-functions in linear programming. - Hans van Maaren; Tamás Terlaky (Oper. Res. Lett., 1997)

Potential reduction algorithms for structured combinatorial optimization problems. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Oper. Res. Lett., 1997)

A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 1997)

Theory and algorithms for linear optimization - an interior point approach. - Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Wiley, 1998)

A nonconvex weighted potential function forpolynomial target following methods. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Ann. Oper. Res., 1998)

Optimization. Algorithms and consistent approximations : Elijah Polak Springer, New York, NY, 1997, ISBN 0-38794971-2, hb., 118 DM, 779 pages. - Tamás Terlaky (Eur. J. Oper. Res., 1998)

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (J. Comb. Optim., 1998)

On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance. - Harvey J. Greenberg; Allen G. Holder; Kees Roos; Tamás Terlaky (SIAM J. Optim., 1998)

Computing Maximum Likelihood Estimators of Convex Density Functions. - Tamás Terlaky; Jean-Philippe Vial (SIAM J. Sci. Comput., 1998)

The finite criss-cross method for hyperbolic programming. - Tibor Illés; Ákos Szirmai; Tamás Terlaky (Eur. J. Oper. Res., 1999)

Basis- and partition identification for quadratic programming and linear complementarity problems. - Arjan Berkelaar; Benjamin Jansen; Kees Roos; Tamás Terlaky (Math. Program., 1999)

On maximization of quadratic form over intersection of ellipsoids with common center. - Arkadi Nemirovski; Cornelis Roos; Tamás Terlaky (Math. Program., 1999)

Note on a paper of Broyden. - Cornelis Roos; Tamás Terlaky (Oper. Res. Lett., 1999)

New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization. - Jiming Peng; Cees Roos; Tamás Terlaky (Ann. Oper. Res., 2000)

On Copositive Programming and Standard Quadratic Optimization Problems. - Immanuel M. Bomze; Mirjam Dür; Etienne de Klerk; Cornelis Roos; Arie J. Quist; Tamás Terlaky (J. Glob. Optim., 2000)

A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems. - Tibor Illés; Jiming Peng; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 2000)

An easy way to teach interior-point methods. - Tamás Terlaky (Eur. J. Oper. Res., 2001)

A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization. - Etienne de Klerk; Jiming Peng; Cees Roos; Tamás Terlaky (SIAM J. Optim., 2001)

Self-regularity - a new paradigm for primal-dual interior-point algorithms. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Princeton University Press, 2002)

IPM 2000. Continuous Optimization. - Tibor Illés; Tamás Rapcsák; Tamás Terlaky (Eur. J. Oper. Res., 2002)

Pivot versus interior point methods: Pros and cons. - Tibor Illés; Tamás Terlaky (Eur. J. Oper. Res., 2002)

A new class of polynomial primal-dual methods for linear and semidefinite optimization. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Eur. J. Oper. Res., 2002)

Self-regular functions and new search directions for linear and semidefinite optimization. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Math. Program., 2002)

A dynamic large-update primal-dual interior-point method for linear optimization. - Jiming Peng; Tamás Terlaky (Optim. Methods Softw., 2002)

Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. - Jiming Peng; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 2002)

Book Review: Computational Techniques of the Simplex Method. - Tamás Terlaky (Comput. Optim. Appl., 2003)

On implementing a primal-dual interior-point method for conic quadratic optimization. - Erling D. Andersen; Cornelis Roos; Tamás Terlaky (Math. Program., 2003)

International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001). - Jan Brinkhuis; Tibor Illés; Hans Frenk; Georg Still; Gerhard-Wilhelm Weber; Tamás Terlaky (Eur. J. Oper. Res., 2004)

An adaptive self-regular proximity-based large-update IPM for LO. - Maziar Salahi; Tamás Terlaky (Optim. Methods Softw., 2005)

A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function. - Jiming Peng; Tamás Terlaky; Yunbin Zhao (SIAM J. Optim., 2005)

The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design. - Christopher Kumar Anand; Stephen J. Stoyan; Tamás Terlaky (HPSC, 2006)

The Complexity of Self-Regular Proximity Based Infeasible IPMs. - Maziar Salahi; Tamás Terlaky; Guoqing Zhang 003 (Comput. Optim. Appl., 2006)

Colourful Simplicial Depth. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Comput. Geom., 2006)

Sensitivity analysis in linear optimization: Invariant support set intervals. - Alireza Ghaffari-Hadigheh; Tamás Terlaky (Eur. J. Oper. Res., 2006)

Feature Cluster "Advances in Continuous Optimization". - Bülent Karasözen; Mustafa Ç. Pinar; Tamás Terlaky; Gerhard-Wilhelm Weber (Eur. J. Oper. Res., 2006)

The central path visits all the vertices of the Klee-Minty cube. - Antoine Deza; Eissa Nematollahi; M. Reza Peyghami; Tamás Terlaky (Optim. Methods Softw., 2006)

Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. - Alireza Ghaffari-Hadigheh; Oleksandr Romanko; Tamás Terlaky (Algorithmic Oper. Res., 2007)

Challenges of Continuous Optimization in Theory and Applications. - Mirjam Dür; Bülent Karasözen; Tamás Terlaky; Gerhard-Wilhelm Weber (Eur. J. Oper. Res., 2007)

Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms. - Maziar Salahi; Tamás Terlaky (Eur. J. Oper. Res., 2007)

On Mehrotra-Type Predictor-Corrector Algorithms. - Maziar Salahi; Jiming Peng; Tamás Terlaky (SIAM J. Optim., 2007)

A Survey of the S-Lemma. - Imre Pólik; Tamás Terlaky (SIAM Rev., 2007)

Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization. - Alireza Ghaffari-Hadigheh; Habib Ghaffari Hadigheh; Tamás Terlaky (Central Eur. J. Oper. Res., 2008)

Editorial. - Oliver Stein; Georg Still; Tamás Terlaky; Gerhard-Wilhelm Weber (Central Eur. J. Oper. Res., 2008)

The colourful feasibility problem. - Antoine Deza; Sui Huang; Tamon Stephen; Tamás Terlaky (Discret. Appl. Math., 2008)

On routing in VLSI design and communication networks. - Tamás Terlaky; Anthony Vannelli; Hu Zhang 004 (Discret. Appl. Math., 2008)

Diameter and Curvature: Intriguing Analogies. - Antoine Deza; Tamás Terlaky; Feng Xie 007; Yuriy Zinchenko (Electron. Notes Discret. Math., 2008)

17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005. - Tibor Illés; Marco A. López 001; Tamás Terlaky; József Vörös; Gerhard-Wilhelm Weber (Eur. J. Oper. Res., 2008)

New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. - Maziar Salahi; M. Reza Peyghami; Tamás Terlaky (Eur. J. Oper. Res., 2008)

Packing trees in communication networks. - Mohamed Saad 001; Tamás Terlaky; Anthony Vannelli; Hu Zhang 004 (J. Comb. Optim., 2008)

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. - Antoine Deza; Eissa Nematollahi; Tamás Terlaky (Math. Program., 2008)

A simpler and tighter redundant Klee-Minty construction. - Eissa Nematollahi; Tamás Terlaky (Optim. Lett., 2008)

Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems". - Tamás Terlaky; Jiaping Zhu (Optim. Lett., 2008)

Optimizing Teardrop, an MRI sampling trajectory. - Christopher Kumar Anand; Tingting Ren; Tamás Terlaky (Optim. Methods Softw., 2008)

Mehrotra-type predictor-corrector algorithm revisited. - Maziar Salahi; Tamás Terlaky (Optim. Methods Softw., 2008)

Polytopes and arrangements: Diameter and curvature. - Antoine Deza; Tamás Terlaky; Yuriy Zinchenko (Oper. Res. Lett., 2008)

A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. - Eissa Nematollahi; Tamás Terlaky (Oper. Res. Lett., 2008)

A confidence voting process for ranking problems based on support vector machines. - Tianshi Jiao; Jiming Peng; Tamás Terlaky (Ann. Oper. Res., 2009)

A Hybrid Adaptive Algorithm for Linear Optimization. - Maziar Salahi; Tamás Terlaky (Asia Pac. J. Oper. Res., 2009)

Self-adaptive support vector machines: modelling and experiments. - Peng Du; Jiming Peng; Tamás Terlaky (Comput. Manag. Sci., 2009)

A Continuous d -Step Conjecture for Polytopes. - Antoine Deza; Tamás Terlaky; Yuriy Zinchenko (Discret. Comput. Geom., 2009)

New stopping criteria for detecting infeasibility in conic optimization. - Imre Pólik; Tamás Terlaky (Optim. Lett., 2009)

A Multilevel Congestion-Based Global Router. - Logan M. Rakai; Laleh Behjat; Shawki Areibi; Tamás Terlaky (VLSI Design, 2009)

Criss-Cross Pivoting Rules. - Tamás Terlaky (Encyclopedia of Optimization, 2009)

Least-index Anticycling Rules. - Tamás Terlaky (Encyclopedia of Optimization, 2009)

Lexicographic Pivoting Rules. - Tamás Terlaky (Encyclopedia of Optimization, 2009)

Principal Pivoting Methods for Linear Complementarity Problems. - Tamás Terlaky (Encyclopedia of Optimization, 2009)

Polynomial Interior Point Algorithms for General Linear Complementarity Problems. - Tibor Illés; Marianna Nagy 001; Tamás Terlaky (Algorithmic Oper. Res., 2010)

Efficient preprocessing for VLSI optimization problems. - Warren L. Hare; M. J. J. Liu; Tamás Terlaky (Comput. Optim. Appl., 2010)

A polynomial path-following interior point algorithm for general linear complementarity problems. - Tibor Illés; Marianna Nagy 001; Tamás Terlaky (J. Glob. Optim., 2010)

Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. - Miguel A. Goberna; Tamás Terlaky; Maxim I. Todorov (Math. Oper. Res., 2010)

Preface. - Botond Bertók; Tamás Terlaky (Optim. Methods Softw., 2010)

Bi-parametric convex quadratic optimization. - Alireza Ghaffari-Hadigheh; Oleksandr Romanko; Tamás Terlaky (Optim. Methods Softw., 2010)

Foreword. - Ekaterina A. Kostina; Tamás Terlaky (Optim. Methods Softw., 2010)

On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. - Mohammad H. Koulaei; Tamás Terlaky (Optim. Methods Softw., 2010)

A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X0S0)/ε)) Iteration Complexity. - Yang Li 065; Tamás Terlaky (SIAM J. Optim., 2010)

Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms. - Christopher Kumar Anand; Stephen J. Stoyan; Tamás Terlaky (Algorithmic Oper. Res., 2011)

An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application. - Mohammad R. Oskoorouchi; Hamid R. Ghaffari; Tamás Terlaky; Dionne M. Aleman (Oper. Res., 2011)

Preface. - Botond Bertók; Zoltán Süle; Tamás Terlaky (Optim. Methods Softw., 2011)

Convex approximations in stochastic programming by semidefinite programming. - István Deák; Imre Pólik; András Prékopa; Tamás Terlaky (Ann. Oper. Res., 2012)

On the volumetric path. - Murat Mut; Tamás Terlaky (Optim. Lett., 2012)

On families of quadratic surfaces having fixed intersections with two hyperplanes. - Pietro Belotti; Julio Cesar Goez; Imre Pólik; Ted K. Ralphs; Tamás Terlaky (Discret. Appl. Math., 2013)

Special issue in honour of Professor Kees Roos' 70th Birthday. - Tamás Terlaky; Etienne de Klerk; Goran Lesaja; Dick den Hertog (Optim. Methods Softw., 2013)

On the Identification of the Optimal Partition of Second Order Cone Optimization Problems. - Tamás Terlaky; Zhouhong Wang (SIAM J. Optim., 2014)

An Analogue of the Klee-Walkup Result for Sonnevend's Curvature of the Central Path. - Murat Mut; Tamás Terlaky (J. Optim. Theory Appl., 2016)

A novel unified approach to invariance conditions for a linear dynamical system. - Zoltán Horváth; Yunfei Song; Tamás Terlaky (Appl. Math. Comput., 2017)

A polynomial primal-dual affine scaling algorithm for symmetric conic optimization. - Ali Mohammad Nezhad; Tamás Terlaky (Comput. Optim. Appl., 2017)

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. - Pietro Belotti; Julio Cesar Goez; Imre Pólik; Ted K. Ralphs; Tamás Terlaky (Discret. Optim., 2017)

András Prékopa 1929-2016. - Tamás Terlaky (Eur. J. Oper. Res., 2017)

The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections. - Mohammad Shahabsafa; Tamás Terlaky; Naga Venkata C. Gudapati; Anshul Sharma; George R. Wilson; Louis J. Plebani; Kristofer B. Bucklen (Interfaces, 2018)

On pathological disjunctions and redundant disjunctive conic cuts. - Mohammad Shahabsafa; Julio Cesar Goez; Tamás Terlaky (Oper. Res. Lett., 2018)

Examples with decreasing largest inscribed ball for deterministic rescaling algorithms. - Dan Li; Tamás Terlaky (INFOR Inf. Syst. Oper. Res., 2019)

Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity. - Ali Mohammad Nezhad; Tamás Terlaky (Optim. Methods Softw., 2019)

A rounding procedure for semidefinite optimization. - Ali Mohammad Nezhad; Tamás Terlaky (Oper. Res. Lett., 2019)

A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors. - Muqing Zheng; Ang Li; Tamás Terlaky; Xiu Yang (CoRR, 2020)

On the identification of the optimal partition for semidefinite optimization. - Ali Mohammad Nezhad; Tamás Terlaky (INFOR Inf. Syst. Oper. Res., 2020)

On the sensitivity of the optimal partition for parametric second-order conic optimization. - Ali Mohammad Nezhad; Tamás Terlaky (Math. Program., 2021)

Quantum circuit design search. - Mohammad Pirhooshyaran; Tamás Terlaky (Quantum Mach. Intell., 2021)

Quantum-enhanced Regression Analysis Using State-of-the-art QLSAs and QIPMs. - Mohammadhossein Mohammadisiahroudi; Zeguan Wu; Brandon Augustino; Tamás Terlaky; Arielle Carr (SEC, 2022)

Celebrating 20 years of EUROpt. - Miguel F. Anjos; Tibor Illés; Tamás Terlaky (EURO J. Comput. Optim., 2022)

EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity. - Tibor Illés; Tamás Terlaky (EURO J. Comput. Optim., 2022)

Characterization of QUBO reformulations for the maximum k-colorable subgraph problem. - Rodolfo Quintero; David E. Bernal; Tamás Terlaky; Luis F. Zuluaga (Quantum Inf. Process., 2022)

On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization. - Jonathan D. Hauenstein; Ali Mohammad Nezhad; Tingting Tang; Tamás Terlaky (Math. Oper. Res., 2022)

A quantum central path algorithm for linear optimization. - Brandon Augustino; Jiaqi Leng; Giacomo Nannicini; Tamás Terlaky; Xiaodi Wu 001 (CoRR, 2023)

An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization. - Zeguan Wu; Mohammadhossein Mohammadisiahroudi; Brandon Augustino; Xiu Yang; Tamás Terlaky (Entropy, 2023)

On relaxations of the max k-cut problem formulations. - Ramin Fakhimi; Hamidreza Validi; Illya V. Hicks; Tamás Terlaky; Luis F. Zuluaga (Oper. Res. Lett., 2023)

Quantum Interior Point Methods for Semidefinite Optimization. - Brandon Augustino; Giacomo Nannicini; Tamás Terlaky; Luis F. Zuluaga (Quantum, 2023)

An Efficient Quantum Algorithm for Linear System Problem in Tensor Format. - Zeguan Wu; Sidhant Misra; Tamás Terlaky; Xiu Yang; Marc Vuffray (CoRR, 2024)

Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments. - Mohammadhossein Mohammadisiahroudi; Ramin Fakhimi; Brandon Augustino; Tamás Terlaky (Optim. Methods Softw., 2024)

Efficient Use of Quantum Linear System Algorithms in Inexact Infeasible IPMs for Linear Optimization. - Mohammadhossein Mohammadisiahroudi; Ramin Fakhimi; Tamás Terlaky (J. Optim. Theory Appl., 2024)

Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy. - Yue Tu; Mark Dubynskyi; Mohammadhossein Mohammadisiahroudi; Ekaterina Riashchentceva; Jinglei Cheng; Dmitry Ryashchentsev; Tamás Terlaky; Junyu Liu (CoRR, 2025)

A folding preprocess for the max k-cut problem. - Ramin Fakhimi; Hamidreza Validi; Illya V. Hicks; Tamás Terlaky; Luis F. Zuluaga (Optim. Lett., 2025)