Tamás Terlaky

139 papers B 1Misc 2Journal 129Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
A preconditioned inexact infeasible quantum interior point method for linear optimization.
Comput. Optim. Appl.
Zeguan Wu, Xiu Yang, Tamás Terlaky
2025 J jnl
A folding preprocess for the max k-cut problem.
Optim. Lett.
Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
2025 J jnl
An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers.
SIAM J. Optim.
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Zeguan Wu, Tamás Terlaky
2025 J jnl
Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing.
CoRR
Adrian Harkness, Hamidreza Validi, Ramin Fakhimi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
2025 J jnl
Improvements to Quantum Interior Point Method for Linear Optimization.
ACM Trans. Quantum Comput.
Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino, Arielle Carr, Tamás Terlaky
2025 J jnl
Towards identifying possible fault-tolerant advantage of quantum linear system algorithms in terms of space, time and energy.
CoRR
Yue Tu, Mark Dubynskyi, Mohammadhossein Mohammadisiahroudi, Ekaterina Riashchentceva, Jinglei Cheng, Dmitry Ryashchentsev, Tamás Terlaky, Junyu Liu
2024 J jnl
An Efficient Quantum Algorithm for Linear System Problem in Tensor Format.
CoRR
Zeguan Wu, Sidhant Misra, Tamás Terlaky, Xiu Yang, Marc Vuffray
2024 J jnl
Efficient Use of Quantum Linear System Algorithms in Inexact Infeasible IPMs for Linear Optimization.
J. Optim. Theory Appl.
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Tamás Terlaky
2024 J jnl
Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments.
Optim. Methods Softw.
Mohammadhossein Mohammadisiahroudi, Ramin Fakhimi, Brandon Augustino, Tamás Terlaky
2023 J jnl
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors.
ACM Trans. Quantum Comput.
Muqing Zheng, Ang Li, Tamás Terlaky, Xiu Yang
2023 J jnl
A quantum central path algorithm for linear optimization.
CoRR
Brandon Augustino, Jiaqi Leng, Giacomo Nannicini, Tamás Terlaky, Xiaodi Wu
2023 J jnl
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization.
Entropy
Zeguan Wu, Mohammadhossein Mohammadisiahroudi, Brandon Augustino, Xiu Yang, Tamás Terlaky
2023 J jnl
On relaxations of the max
Oper. Res. Lett.
Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga
2023 J jnl
Quantum Interior Point Methods for Semidefinite Optimization.
Quantum
Brandon Augustino, Giacomo Nannicini, Tamás Terlaky, Luis F. Zuluaga
2022 J jnl
Celebrating 20 years of EUR
EURO J. Comput. Optim.
Miguel F. Anjos, Tibor Illés, Tamás Terlaky
2022 J jnl
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem.
Quantum Inf. Process.
Rodolfo Quintero, David E. Bernal, Tamás Terlaky, Luis F. Zuluaga
2022 J jnl
EUR
EURO J. Comput. Optim.
Tibor Illés, Tamás Terlaky
2022 J jnl
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization.
Math. Oper. Res.
Jonathan D. Hauenstein, Ali Mohammad Nezhad, Tingting Tang, Tamás Terlaky
2022 Misc conf
Quantum-enhanced Regression Analysis Using State-of-the-art QLSAs and QIPMs.
SEC
Mohammadhossein Mohammadisiahroudi, Zeguan Wu, Brandon Augustino, Tamás Terlaky, Arielle Carr
2021 J jnl
On the sensitivity of the optimal partition for parametric second-order conic optimization.
Math. Program.
Ali Mohammad Nezhad, Tamás Terlaky
2021 J jnl
Quantum circuit design search.
Quantum Mach. Intell.
Mohammad Pirhooshyaran, Tamás Terlaky
2020 J jnl
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors.
CoRR
Muqing Zheng, Ang Li, Tamás Terlaky, Xiu Yang
2020 J jnl
On the identification of the optimal partition for semidefinite optimization.
INFOR Inf. Syst. Oper. Res.
Ali Mohammad Nezhad, Tamás Terlaky
2020 J jnl
Quantum Circuit Design Search.
CoRR
Mohammad Pirhooshyaran, Tamás Terlaky
2019 J jnl
A rounding procedure for semidefinite optimization.
Oper. Res. Lett.
Ali Mohammad Nezhad, Tamás Terlaky
2019 J jnl
Examples with decreasing largest inscribed ball for deterministic rescaling algorithms.
INFOR Inf. Syst. Oper. Res.
Dan Li, Tamás Terlaky
2019 J jnl
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity.
Optim. Methods Softw.
Ali Mohammad Nezhad, Tamás Terlaky
2018 J jnl
On pathological disjunctions and redundant disjunctive conic cuts.
Oper. Res. Lett.
Mohammad Shahabsafa, Julio Cesar Goez, Tamás Terlaky
2018 J jnl
The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections.
Interfaces
Mohammad Shahabsafa, Tamás Terlaky, Naga Venkata C. Gudapati, Anshul Sharma, George R. Wilson, Louis J. Plebani, Kristofer B. Bucklen
2017 J jnl
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim.
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
2017 J jnl
A novel unified approach to invariance conditions for a linear dynamical system.
Appl. Math. Comput.
Zoltán Horváth, Yunfei Song, Tamás Terlaky
2017 J jnl
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization.
Comput. Optim. Appl.
Ali Mohammad Nezhad, Tamás Terlaky
2017 J jnl
András Prékopa 1929-2016.
Eur. J. Oper. Res.
Tamás Terlaky
2016 J jnl
An Analogue of the Klee-Walkup Result for Sonnevend's Curvature of the Central Path.
J. Optim. Theory Appl.
Murat Mut, Tamás Terlaky
2014 J jnl
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems.
SIAM J. Optim.
Tamás Terlaky, Zhouhong Wang
2013 J jnl
On families of quadratic surfaces having fixed intersections with two hyperplanes.
Discret. Appl. Math.
Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky
2013 J jnl
Special issue in honour of Professor Kees Roos' 70th Birthday.
Optim. Methods Softw.
Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog
2012 J jnl
Convex approximations in stochastic programming by semidefinite programming.
Ann. Oper. Res.
István Deák, Imre Pólik, András Prékopa, Tamás Terlaky
2012 J jnl
On the volumetric path.
Optim. Lett.
Murat Mut, Tamás Terlaky
2011 J jnl
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application.
Oper. Res.
Mohammad R. Oskoorouchi, Hamid R. Ghaffari, Tamás Terlaky, Dionne M. Aleman
2011 J jnl
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms.
Algorithmic Oper. Res.
Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky
2011 J jnl
Preface.
Optim. Methods Softw.
Botond Bertók, Zoltán Süle, Tamás Terlaky
2010 J jnl
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X
SIAM J. Optim.
Yang Li, Tamás Terlaky
2010 J jnl
A polynomial path-following interior point algorithm for general linear complementarity problems.
J. Glob. Optim.
Tibor Illés, Marianna Nagy, Tamás Terlaky
2010 J jnl
Bi-parametric convex quadratic optimization.
Optim. Methods Softw.
Alireza Ghaffari-Hadigheh, Oleksandr Romanko, Tamás Terlaky
2010 J jnl
Efficient preprocessing for VLSI optimization problems.
Comput. Optim. Appl.
Warren L. Hare, M. J. J. Liu, Tamás Terlaky
2010 J jnl
Foreword.
Optim. Methods Softw.
Ekaterina A. Kostina, Tamás Terlaky
2010 J jnl
On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization.
Optim. Methods Softw.
Mohammad H. Koulaei, Tamás Terlaky
2010 J jnl
Polynomial Interior Point Algorithms for General Linear Complementarity Problems.
Algorithmic Oper. Res.
Tibor Illés, Marianna Nagy, Tamás Terlaky
2010 J jnl
Preface.
Optim. Methods Softw.
Botond Bertók, Tamás Terlaky
2010 J jnl
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions.
Math. Oper. Res.
Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov
2009 J jnl
A Continuous
Discret. Comput. Geom.
Antoine Deza, Tamás Terlaky, Yuriy Zinchenko
2009 J jnl
A Hybrid Adaptive Algorithm for Linear Optimization.
Asia Pac. J. Oper. Res.
Maziar Salahi, Tamás Terlaky
2009 J jnl
A Multilevel Congestion-Based Global Router.
VLSI Design
Logan M. Rakai, Laleh Behjat, Shawki Areibi, Tamás Terlaky
2009 J jnl
A confidence voting process for ranking problems based on support vector machines.
Ann. Oper. Res.
Tianshi Jiao, Jiming Peng, Tamás Terlaky
2009 — ch.
Criss-Cross Pivoting Rules.
Encyclopedia of Optimization
Tamás Terlaky
2009 — ch.
Least-index Anticycling Rules.
Encyclopedia of Optimization
Tamás Terlaky
2009 — ch.
Lexicographic Pivoting Rules.
Encyclopedia of Optimization
Tamás Terlaky
2009 J jnl
New stopping criteria for detecting infeasibility in conic optimization.
Optim. Lett.
Imre Pólik, Tamás Terlaky
2009 — ch.
Principal Pivoting Methods for Linear Complementarity Problems.
Encyclopedia of Optimization
Tamás Terlaky
2009 J jnl
Self-adaptive support vector machines: modelling and experiments.
Comput. Manag. Sci.
Peng Du, Jiming Peng, Tamás Terlaky
2008 J jnl
17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005.
Eur. J. Oper. Res.
Tibor Illés, Marco A. López, Tamás Terlaky, József Vörös, Gerhard-Wilhelm Weber
2008 J jnl
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region.
Oper. Res. Lett.
Eissa Nematollahi, Tamás Terlaky
2008 J jnl
A simpler and tighter redundant Klee-Minty construction.
Optim. Lett.
Eissa Nematollahi, Tamás Terlaky
2008 J jnl
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization.
Central Eur. J. Oper. Res.
Alireza Ghaffari-Hadigheh, Habib Ghaffari Hadigheh, Tamás Terlaky
2008 J jnl
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems".
Optim. Lett.
Tamás Terlaky, Jiaping Zhu
2008 J jnl
Diameter and Curvature: Intriguing Analogies.
Electron. Notes Discret. Math.
Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko
2008 J jnl
Editorial.
Central Eur. J. Oper. Res.
Oliver Stein, Georg Still, Tamás Terlaky, Gerhard-Wilhelm Weber
2008 J jnl
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Math. Program.
Antoine Deza, Eissa Nematollahi, Tamás Terlaky
2008 J jnl
Mehrotra-type predictor-corrector algorithm revisited.
Optim. Methods Softw.
Maziar Salahi, Tamás Terlaky
2008 J jnl
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function.
Eur. J. Oper. Res.
Maziar Salahi, M. Reza Peyghami, Tamás Terlaky
2008 J jnl
On routing in VLSI design and communication networks.
Discret. Appl. Math.
Tamás Terlaky, Anthony Vannelli, Hu Zhang
2008 J jnl
Optimizing Teardrop, an MRI sampling trajectory.
Optim. Methods Softw.
Christopher Kumar Anand, TingTing Ren, Tamás Terlaky
2008 J jnl
Packing trees in communication networks.
J. Comb. Optim.
Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang
2008 J jnl
Polytopes and arrangements: Diameter and curvature.
Oper. Res. Lett.
Antoine Deza, Tamás Terlaky, Yuriy Zinchenko
2008 J jnl
The colourful feasibility problem.
Discret. Appl. Math.
Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky
2007 J jnl
A Survey of the S-Lemma.
SIAM Rev.
Imre Pólik, Tamás Terlaky
2007 J jnl
Challenges of Continuous Optimization in Theory and Applications.
Eur. J. Oper. Res.
Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber
2007 J jnl
On Mehrotra-Type Predictor-Corrector Algorithms.
SIAM J. Optim.
Maziar Salahi, Jiming Peng, Tamás Terlaky
2007 J jnl
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms.
Eur. J. Oper. Res.
Maziar Salahi, Tamás Terlaky
2007 J jnl
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors.
Algorithmic Oper. Res.
Alireza Ghaffari-Hadigheh, Oleksandr Romanko, Tamás Terlaky
2006 J jnl
Colourful Simplicial Depth.
Discret. Comput. Geom.
Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky
2006 J jnl
Feature Cluster "Advances in Continuous Optimization".
Eur. J. Oper. Res.
Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber
2006 J jnl
Sensitivity analysis in linear optimization: Invariant support set intervals.
Eur. J. Oper. Res.
Alireza Ghaffari-Hadigheh, Tamás Terlaky
2006 J jnl
The Complexity of Self-Regular Proximity Based Infeasible IPMs.
Comput. Optim. Appl.
Maziar Salahi, Tamás Terlaky, Guoqing Zhang
2006 J jnl
The central path visits all the vertices of the Klee-Minty cube.
Optim. Methods Softw.
Antoine Deza, Eissa Nematollahi, M. Reza Peyghami, Tamás Terlaky
2006 Misc conf
The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design.
HPSC
Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky
2005 J jnl
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function.
SIAM J. Optim.
Jiming Peng, Tamás Terlaky, Yunbin Zhao
2005 J jnl
An adaptive self-regular proximity-based large-update IPM for LO.
Optim. Methods Softw.
Maziar Salahi, Tamás Terlaky
2005 B conf
On Routing in VLSI Design and Communication Networks.
ISAAC
Tamás Terlaky, Anthony Vannelli, Hu Zhang
2005 — conf
Packing Trees in Communication Networks.
WINE
Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang
2004 J jnl
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001).
Eur. J. Oper. Res.
Jan Brinkhuis, Tibor Illés, Hans Frenk, Georg Still, Gerhard-Wilhelm Weber, Tamás Terlaky
2003 J jnl
Book Review: Computational Techniques of the Simplex Method.
Comput. Optim. Appl.
Tamás Terlaky
2003 J jnl
On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Program.
Erling D. Andersen, Cornelis Roos, Tamás Terlaky
2002 J jnl
A dynamic large-update primal-dual interior-point method for linear optimization.
Optim. Methods Softw.
Jiming Peng, Tamás Terlaky
2002 J jnl
A new class of polynomial primal-dual methods for linear and semidefinite optimization.
Eur. J. Oper. Res.
Jiming Peng, Cornelis Roos, Tamás Terlaky
2002 J jnl
IPM 2000. Continuous Optimization.
Eur. J. Oper. Res.
Tibor Illés, Tamás Rapcsák, Tamás Terlaky
2002 J jnl
Pivot versus interior point methods: Pros and cons.
Eur. J. Oper. Res.
Tibor Illés, Tamás Terlaky
2002 J jnl
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities.
SIAM J. Optim.
Jiming Peng, Cornelis Roos, Tamás Terlaky
2002 J jnl
Self-regular functions and new search directions for linear and semidefinite optimization.
Math. Program.
Jiming Peng, Cornelis Roos, Tamás Terlaky
2002 — book
Self-regularity - a new paradigm for primal-dual interior-point algorithms.
Jiming Peng, Cornelis Roos, Tamás Terlaky
2001 J jnl
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization.
SIAM J. Optim.
Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky
2001 J jnl
An easy way to teach interior-point methods.
Eur. J. Oper. Res.
Tamás Terlaky
2000 J jnl
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P
SIAM J. Optim.
Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky
2000 J jnl
New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization.
Ann. Oper. Res.
Jiming Peng, Cees Roos, Tamás Terlaky
2000 J jnl
On Copositive Programming and Standard Quadratic Optimization Problems.
J. Glob. Optim.
Immanuel M. Bomze, Mirjam Dür, Etienne de Klerk, Cornelis Roos, Arie J. Quist, Tamás Terlaky
1999 J jnl
Basis- and partition identification for quadratic programming and linear complementarity problems.
Math. Program.
Arjan Berkelaar, Benjamin Jansen, Kees Roos, Tamás Terlaky
1999 J jnl
Note on a paper of Broyden.
Oper. Res. Lett.
Cornelis Roos, Tamás Terlaky
1999 J jnl
On maximization of quadratic form over intersection of ellipsoids with common center.
Math. Program.
Arkadi Nemirovski, Cornelis Roos, Tamás Terlaky
1999 J jnl
The finite criss-cross method for hyperbolic programming.
Eur. J. Oper. Res.
Tibor Illés, Ákos Szirmai, Tamás Terlaky
1998 J jnl
A nonconvex weighted potential function forpolynomial target following methods.
Ann. Oper. Res.
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
1998 J jnl
Computing Maximum Likelihood Estimators of Convex Density Functions.
SIAM J. Sci. Comput.
Tamás Terlaky, Jean-Philippe Vial
1998 J jnl
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance.
SIAM J. Optim.
Harvey J. Greenberg, Allen G. Holder, Kees Roos, Tamás Terlaky
1998 J jnl
Optimization. Algorithms and consistent approximations : Elijah Polak Springer, New York, NY, 1997, ISBN 0-38794971-2, hb., 118 DM, 779 pages.
Eur. J. Oper. Res.
Tamás Terlaky
1998 J jnl
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
J. Comb. Optim.
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
1998 — book
Theory and algorithms for linear optimization - an interior point approach.
Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
1997 J jnl
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems.
SIAM J. Optim.
Benjamin Jansen, Cornelis Roos, Tamás Terlaky
1997 J jnl
A Potential Reduction Approach to the Frequency Assignment Problem.
Discret. Appl. Math.
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
1997 J jnl
Criss-cross methods: A fresh view on pivot algorithms.
Math. Program.
Komei Fukuda, Tamás Terlaky
1997 J jnl
Initialization in semidefinite programming via a self-dual skew-symmetric embedding.
Oper. Res. Lett.
Etienne de Klerk, Cornelis Roos, Tamás Terlaky
1997 J jnl
Inverse barriers and CES-functions in linear programming.
Oper. Res. Lett.
Hans van Maaren, Tamás Terlaky
1997 J jnl
Optimization of nuclear reactor reloading patterns.
Ann. Oper. Res.
Etienne de Klerk, Cornelis Roos, Tamás Terlaky, Tibor Illés, A. J. de Jong, J. Valkó, J. E. Hoogenboom
1997 J jnl
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program.
Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise
1997 J jnl
Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett.
Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen
1996 J jnl
A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming.
Math. Oper. Res.
Benjamin Jansen, Cees Roos, Tamás Terlaky
1996 J jnl
An Investigation of Interior-Point Algorithms for the Linear Transportation Problem.
SIAM J. Sci. Comput.
Luis F. Portugal, Frederico Machado Bastos, Joaquim Júdice, José M. P. Paixão, Tamás Terlaky
1996 J jnl
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program.
Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye
1996 J jnl
Long-step primal-dual target-following algorithms for linear programming.
Math. Methods Oper. Res.
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
1996 J jnl
Primal-dual target-following algorithms for linear programming.
Ann. Oper. Res.
Benjamin Jansen, Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial
1995 J jnl
A logarithmic barrier cutting plane method for convex programming.
Ann. Oper. Res.
Dick den Hertog, John Kaliski, Cees Roos, Tamás Terlaky
1995 J jnl
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
Math. Program.
Dick den Hertog, Florian Jarre, Kees Roos, Tamás Terlaky
1994 J jnl
A Monotonic Build-Up Simplex Algorithm for Linear Programming.
Oper. Res.
Kurt M. Anstreicher, Tamás Terlaky
1993 J jnl
A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica
Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky
1993 J jnl
Degeneracy in interior point methods for linear programming: a survey.
Ann. Oper. Res.
Osman Güler, Dick den Hertog, Cornelis Roos, Tamás Terlaky, Takashi Tsuchiya
1993 J jnl
Pivot rules for linear programming: A survey on recent theoretical developments.
Ann. Oper. Res.
Tamás Terlaky, Shuzhong Zhang
1992 J jnl
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems.
SIAM J. Optim.
Dick den Hertog, Cornelis Roos, Tamás Terlaky
1992 J jnl
A build-up variant of the logarithmic barrier method for LP.
Oper. Res. Lett.
Dick den Hertog, Cees Roos, Tamás Terlaky
1989 J jnl
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids.
Comb.
Emil Klafszky, Tamás Terlaky
1987 J jnl
A finite crisscross method for oriented matroids.
J. Comb. Theory B
Tamás Terlaky