Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Tamás Terlaky
2010 – today
- 2013
[j64]Tamás Terlaky, Etienne de Klerk, Goran Lesaja, Dick den Hertog: Special issue in honour of Professor Kees Roos' 70th Birthday. Optimization Methods and Software 28(3): 393-395 (2013)- 2012
- [j63]István Deák, Imre Pólik, András Prékopa, Tamás Terlaky: Convex approximations in stochastic programming by semidefinite programming. Annals OR 200(1): 171-182 (2012)
- [j62]
- 2011
- [j61]Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky: Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms. Algorithmic Operations Research 6(1): 1-19 (2011)
- [j60]Mohammad R. Oskoorouchi, Hamid R. Ghaffari, Tamás Terlaky, Dionne M. Aleman: An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application. Operations Research 59(5): 1184-1197 (2011)
- [j59]Botond Bertók, Zoltán Süle, Tamás Terlaky: Preface. Optimization Methods and Software 26(3): 345-346 (2011)
- 2010
- [j58]Tibor Illés, Marianna Nagy, Tamás Terlaky: Polynomial Interior Point Algorithms for General Linear Complementarity Problems. Algorithmic Operations Research 5(1): 1-12 (2010)
- [j57]W. L. Hare, M. J. J. Liu, Tamás Terlaky: Efficient preprocessing for VLSI optimization problems. Comp. Opt. and Appl. 45(3): 475-493 (2010)
- [j56]Tibor Illés, Marianna Nagy, Tamás Terlaky: A polynomial path-following interior point algorithm for general linear complementarity problems. J. Global Optimization 47(3): 329-342 (2010)
- [j55]Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov: Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. Math. Oper. Res. 35(1): 14-26 (2010)
- [j54]Ekaterina A. Kostina, Tamás Terlaky: Foreword. Optimization Methods and Software 25(2): 169-170 (2010)
- [j53]Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky: Bi-parametric convex quadratic optimization. Optimization Methods and Software 25(2): 229-245 (2010)
- [j52]
- [j51]Mohammad H. Koulaei, Tamás Terlaky: On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. Optimization Methods and Software 25(3): 467-485 (2010)
- [j50]Yang Li, Tamás Terlaky: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity. SIAM Journal on Optimization 20(6): 2853-2875 (2010)
2000 – 2009
- 2009
- [j49]Tianshi Jiao, Jiming Peng, Tamás Terlaky: A confidence voting process for ranking problems based on support vector machines. Annals OR 166(1): 23-38 (2009)
- [j48]Maziar Salahi, Tamás Terlaky: A Hybrid Adaptive Algorithm for Linear Optimization. APJOR 26(2): 235-256 (2009)
- [j47]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko: A Continuous d -Step Conjecture for Polytopes. Discrete & Computational Geometry 41(2): 318-327 (2009)
- [j46]Imre Pólik, Tamás Terlaky: New stopping criteria for detecting infeasibility in conic optimization. Optimization Letters 3(2): 187-198 (2009)
- [j45]Logan M. Rakai, Laleh Behjat, Shawki Areibi, Tamás Terlaky: A Multilevel Congestion-Based Global Router. VLSI Design 2009 (2009)
- [r4]
- [r3]
- [r2]
- [r1]Tamás Terlaky: Principal Pivoting Methods for Linear Complementarity Problems. Encyclopedia of Optimization 2009: 3067-3073
- 2008
- [j44]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky: The colourful feasibility problem. Discrete Applied Mathematics 156(11): 2166-2177 (2008)
- [j43]Tamás Terlaky, Anthony Vannelli, Hu Zhang: On routing in VLSI design and communication networks. Discrete Applied Mathematics 156(11): 2178-2194 (2008)
- [j42]Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko: Diameter and Curvature: Intriguing Analogies. Electronic Notes in Discrete Mathematics 31: 221-225 (2008)
- [j41]Maziar Salahi, M. Reza Peyghami, Tamás Terlaky: New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. European Journal of Operational Research 186(2): 466-485 (2008)
- [j40]Tibor Illés, Marco A. Lopez, Tamás Terlaky, József Vörös, Gerhard-Wilhelm Weber: 17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005. European Journal of Operational Research 191(3): 771-772 (2008)
- [j39]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang: Packing trees in communication networks. J. Comb. Optim. 16(4): 402-423 (2008)
- [j38]Antoine Deza, Eissa Nematollahi, Tamás Terlaky: How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. Math. Program. 113(1): 1-14 (2008)
- [j37]Eissa Nematollahi, Tamás Terlaky: A simpler and tighter redundant Klee-Minty construction. Optimization Letters 2(3): 403-414 (2008)
- [j36]Tamás Terlaky, Jiaping Zhu: Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems". Optimization Letters 2(4): 497-503 (2008)
- [j35]Antoine Deza, Tamás Terlaky, Yuriy Zinchenko: Polytopes and arrangements: Diameter and curvature. Oper. Res. Lett. 36(2): 215-222 (2008)
- [j34]Eissa Nematollahi, Tamás Terlaky: A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. Oper. Res. Lett. 36(4): 414-418 (2008)
- 2007
- [j33]Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky: Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. Algorithmic Operations Research 2(2): 94-111 (2007)
- [j32]Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber: Challenges of Continuous Optimization in Theory and Applications. European Journal of Operational Research 181(3): 1065-1068 (2007)
- [j31]Maziar Salahi, Tamás Terlaky: Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms. European Journal of Operational Research 182(2): 502-513 (2007)
- [j30]Maziar Salahi, Jiming Peng, Tamás Terlaky: On Mehrotra-Type Predictor-Corrector Algorithms. SIAM Journal on Optimization 18(4): 1377-1397 (2007)
- 2006
- [j29]Maziar Salahi, Tamás Terlaky, Guoqing Zhang: The Complexity of Self-Regular Proximity Based Infeasible IPMs. Comp. Opt. and Appl. 33(2-3): 157-185 (2006)
- [j28]Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky: Colourful Simplicial Depth. Discrete & Computational Geometry 35(4): 597-615 (2006)
- [j27]Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber: Feature Cluster "Advances in Continuous Optimization". European Journal of Operational Research 169(3): 1077-1078 (2006)
- [j26]Alireza Ghaffari Hadigheh, Tamás Terlaky: Sensitivity analysis in linear optimization: Invariant support set intervals. European Journal of Operational Research 169(3): 1158-1175 (2006)
- 2005
- [j25]Jiming Peng, Tamás Terlaky, Yunbin Zhao: A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function. SIAM Journal on Optimization 15(4): 1105-1127 (2005)
- [c2]Tamás Terlaky, Anthony Vannelli, Hu Zhang: On Routing in VLSI Design and Communication Networks. ISAAC 2005: 1051-1060
- [c1]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang: Packing Trees in Communication Networks. WINE 2005: 688-697
- 2004
- [j24]Jan Brinkhuis, Tibor Illés, Hans Frenk, Georg Still, Gerhard-Wilhelm Weber, Tamás Terlaky: International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001). European Journal of Operational Research 157(1): 1-2 (2004)
- 2003
- [j23]Tamás Terlaky: Book Review: Computational Techniques of the Simplex Method. Comp. Opt. and Appl. 26(2): 209-210 (2003)
- [j22]Erling D. Andersen, Cornelis Roos, Tamás Terlaky: On implementing a primal-dual interior-point method for conic quadratic optimization. Math. Program. 95(2): 249-277 (2003)
- 2002
- [j21]Tibor Illés, Tamás Terlaky: Pivot versus interior point methods: Pros and cons. European Journal of Operational Research 140(2): 170-190 (2002)
- [j20]Tibor Illés, Tamás Rapcsák, Tamás Terlaky: IPM 2000. Continuous Optimization. European Journal of Operational Research 143(2): 231-233 (2002)
- [j19]Jiming Peng, Cornelis Roos, Tamás Terlaky: A new class of polynomial primal-dual methods for linear and semidefinite optimization. European Journal of Operational Research 143(2): 234-256 (2002)
- [j18]Jiming Peng, Cornelis Roos, Tamás Terlaky: Self-regular functions and new search directions for linear and semidefinite optimization. Math. Program. 93(1): 129-171 (2002)
- [j17]Jiming Peng, Cornelis Roos, Tamás Terlaky: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. SIAM Journal on Optimization 13(1): 179-203 (2002)
- 2001
- [j16]Tamás Terlaky: An easy way to teach interior-point methods. European Journal of Operational Research 130(1): 1-19 (2001)
- [j15]Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky: A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. SIAM Journal on Optimization 11(4): 870-888 (2001)
- 2000
- [j14]Tibor Illés, Jiming Peng, Cornelis Roos, Tamás Terlaky: A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems. SIAM Journal on Optimization 11(2): 320-340 (2000)
1990 – 1999
- 1999
- [j13]Tibor Illés, Ákos Szirmai, Tamás Terlaky: The finite criss-cross method for hyperbolic programming. European Journal of Operational Research 114(1): 198-214 (1999)
- [j12]
- 1998
- [b1]Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial: Theory and algorithms for linear optimization - an interior point approach. Wiley-Interscience series in discrete mathematics and optimization, Wiley 1998, ISBN 978-0-471-95676-1, pp. I-XXIV, 1-482
- [j11]Etienne de Klerk, Cornelis Roos, Tamás Terlaky: Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. J. Comb. Optim. 2(1): 51-69 (1998)
- 1997
- [j10]Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen: A Potential Reduction Approach to the Frequency Assignment Problem. Discrete Applied Mathematics 78(1-3): 251-282 (1997)
- [j9]Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise: Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. Math. Program. 77: 315-345 (1997)
- [j8]Komei Fukuda, Tamás Terlaky: Criss-cross methods: A fresh view on pivot algorithms. Math. Program. 79: 369-395 (1997)
- [j7]Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen: Potential reduction algorithms for structured combinatorial optimization problems. Oper. Res. Lett. 21(2): 55-64 (1997)
- 1996
- [j6]Benjamin Jansen, Ccs Roos, Tamás Terlaky, Jean-Philippe Vial: Long-step primal-dual target-following algorithms for linear programming. Math. Meth. of OR 44(1): 11-30 (1996)
- [j5]Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye: Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Math. Program. 76: 117-130 (1996)
- 1995
- [j4]Dick den Hertog, Florian Jarre, Kees Roos, Tamás Terlaky: A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. Math. Program. 69: 75-88 (1995)
- 1993
- [j3]Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky: A Long-Step Barrier Method for Convex Quadratic Programming. Algorithmica 10(5): 365-382 (1993)
1980 – 1989
- 1989
- [j2]Emil Klafszky, Tamás Terlaky: Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. Combinatorica 9(2): 189-198 (1989)
- 1987
- [j1]Tamás Terlaky: A finite crisscross method for oriented matroids. J. Comb. Theory, Ser. B 42(3): 319-327 (1987)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-05 02:37 CEST by the dblp team