The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Tamás Terlaky" ( http://dblp.L3S.de/Authors/Tamás_Terlaky )

URL (Homepage):  http://www.cas.mcmaster.ca/~terlaky/  Author page on DBLP  Author page in RDF  Community of Tamás Terlaky in ASPL-2

Publication years (Num. hits)
1987-2001 (16) 2002-2007 (17) 2008-2009 (20) 2010-2012 (11)
Publication types (Num. hits)
article(57) book(1) incollection(4) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 30 occurrences of 21 keywords

Results
Found 64 publication records. Showing 64 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Murat Mut, Tamás Terlaky On the volumetric path. Search on Bibsonomy Optimization Letters The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Botond Bertók, Zoltán Süle, Tamás Terlaky Preface. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christopher Kumar Anand, Stephen J. Stoyan, Tamás Terlaky Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms. Search on Bibsonomy Algorithmic Operations Research The full citation details ... 2011 DBLP  BibTeX  RDF
1Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky Bi-parametric convex quadratic optimization. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Botond Bertók, Tamás Terlaky Preface. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mohammad H. Koulaei, Tamás Terlaky On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ekaterina A. Kostina, Tamás Terlaky Foreword. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Yang 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. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tibor Illés, Marianna Nagy, Tamás Terlaky A polynomial path-following interior point algorithm for general linear complementarity problems. Search on Bibsonomy J. Global Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Miguel A. Goberna, Tamás Terlaky, Maxim I. Todorov Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tibor Illés, Marianna Nagy, Tamás Terlaky Polynomial Interior Point Algorithms for General Linear Complementarity Problems. Search on Bibsonomy Algorithmic Operations Research The full citation details ... 2010 DBLP  BibTeX  RDF
1Logan M. Rakai, Laleh Behjat, Shawki Areibi, Tamás Terlaky A Multilevel Congestion-Based Global Router. Search on Bibsonomy VLSI Design The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Imre Pólik, Tamás Terlaky New stopping criteria for detecting infeasibility in conic optimization. Search on Bibsonomy Optimization Letters The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximate Farkas theorem, Conic optimization, Infeasibility, Stopping criteria
1Antoine Deza, Tamás Terlaky, Yuriy Zinchenko A Continuous d -Step Conjecture for Polytopes. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Hirsch conjecture, d-Step conjecture, Diameter, Curvature, Polytopes, Central path
1Maziar Salahi, Tamás Terlaky A Hybrid Adaptive Algorithm for Linear Optimization. Search on Bibsonomy APJOR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tianshi Jiao, Jiming Peng, Tamás Terlaky A confidence voting process for ranking problems based on support vector machines. Search on Bibsonomy Annals OR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF “Max-Win” voting, Fuzzy voting, Ranking, Multi-class classification
1Tamás Terlaky Principal Pivoting Methods for Linear Complementarity Problems. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Principal pivoting, Block pivot, Pivot rules, LCP
1Tamás Terlaky Lexicographic Pivoting Rules. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Anticycling, LP, Lexicographic ordering, Oriented matroids, Pivot rules, LCP
1Tamás Terlaky Least-index Anticycling Rules. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Anticycling, Least-index, Recursion, Oriented matroids, Pivot rules
1Tamás Terlaky Criss-Cross Pivoting Rules. Search on Bibsonomy Encyclopedia of Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Criss-cross method, Recursion, Cycling, Oriented matroids, Linear optimization, Pivot rules
1Antoine Deza, Tamás Terlaky, Yuriy Zinchenko Polytopes and arrangements: Diameter and curvature. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Eissa Nematollahi, Tamás Terlaky A redundant Klee-Minty construction with all the redundant constraints touching the feasible region. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Antoine Deza, Tamás Terlaky, Feng Xie, Yuriy Zinchenko Diameter and Curvature: Intriguing Analogies. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang Packing trees in communication networks. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Steiner tree packing, Approximation algorithms, Communication networks, Multicast routing, Mathematical programming, Wavelength assignment
1Tamás Terlaky, Jiaping Zhu Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems". Search on Bibsonomy Optimization Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Strong duality theorem, Time-sharing property, Ky Fan convexity
1Eissa Nematollahi, Tamás Terlaky A simpler and tighter redundant Klee-Minty construction. Search on Bibsonomy Optimization Letters The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Klee-Minty example, Worst-case iteration complexity, Linear programming, Interior point methods, Central path
1Maziar Salahi, M. Reza Peyghami, Tamás Terlaky New complexity analysis of IIPMs for linear optimization based on a specific self-regular function. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tibor 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. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky The colourful feasibility problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tamás Terlaky, Anthony Vannelli, Hu Zhang On routing in VLSI design and communication networks. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Antoine Deza, Eissa Nematollahi, Tamás Terlaky How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) Primary 90C05, Secondary 90C51, Secondary 90C27, Secondary 52B12
1Maziar Salahi, Jiming Peng, Tamás Terlaky On Mehrotra-Type Predictor-Corrector Algorithms. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Maziar Salahi, Tamás Terlaky Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mirjam Dür, Bülent Karasözen, Tamás Terlaky, Gerhard-Wilhelm Weber Challenges of Continuous Optimization in Theory and Applications. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alireza Ghaffari Hadigheh, Oleksandr Romanko, Tamás Terlaky Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors. Search on Bibsonomy Algorithmic Operations Research The full citation details ... 2007 DBLP  BibTeX  RDF
1Bülent Karasözen, Mustafa Ç. Pinar, Tamás Terlaky, Gerhard-Wilhelm Weber Feature Cluster "Advances in Continuous Optimization". Search on Bibsonomy European Journal of Operational Research The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Alireza Ghaffari Hadigheh, Tamás Terlaky Sensitivity analysis in linear optimization: Invariant support set intervals. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Antoine Deza, Sui Huang, Tamon Stephen, Tamás Terlaky Colourful Simplicial Depth. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Jiming Peng, Tamás Terlaky, Yunbin Zhao A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang Packing Trees in Communication Networks. Search on Bibsonomy WINE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tamás Terlaky, Anthony Vannelli, Hu Zhang On Routing in VLSI Design and Communication Networks. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Jan 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). Search on Bibsonomy European Journal of Operational Research The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Erling D. Andersen, Cornelis Roos, Tamás Terlaky On implementing a primal-dual interior-point method for conic quadratic optimization. Search on Bibsonomy Math. Program. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Jiming Peng, Cornelis Roos, Tamás Terlaky Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Tibor Illés, Tamás Terlaky Pivot versus interior point methods: Pros and cons. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Tibor Illés, Tamás Rapcsák, Tamás Terlaky IPM 2000. Continuous Optimization. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jiming Peng, Cornelis Roos, Tamás Terlaky A new class of polynomial primal-dual methods for linear and semidefinite optimization. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jiming Peng, Cornelis Roos, Tamás Terlaky Self-regular functions and new search directions for linear and semidefinite optimization. Search on Bibsonomy Math. Program. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Etienne de Klerk, Jiming Peng, Cees Roos, Tamás Terlaky A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tamás Terlaky An easy way to teach interior-point methods. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tibor 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. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Cornelis Roos, Tamás Terlaky Note on a paper of Broyden. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Tibor Illés, Ákos Szirmai, Tamás Terlaky The finite criss-cross method for hyperbolic programming. Search on Bibsonomy European Journal of Operational Research The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Etienne de Klerk, Cornelis Roos, Tamás Terlaky Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. Search on Bibsonomy J. Comb. Optim. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Cornelis Roos, Tamás Terlaky, Jean-Philippe Vial Theory and algorithms for linear optimization - an interior point approach. Search on Bibsonomy 1998   RDF
1Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen Potential reduction algorithms for structured combinatorial optimization problems. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen A Potential Reduction Approach to the Frequency Assignment Problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Komei Fukuda, Tamás Terlaky Criss-cross methods: A fresh view on pivot algorithms. Search on Bibsonomy Math. Program. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Benjamin Jansen, Kees Roos, Tamás Terlaky, Akiko Yoshise Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. Search on Bibsonomy Math. Program. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Benjamin Jansen, Kees Roos, Tamás Terlaky, Yinyu Ye Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. Search on Bibsonomy Math. Program. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Dick 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. Search on Bibsonomy Math. Program. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Kurt M. Anstreicher, Dick den Hertog, Cornelis Roos, Tamás Terlaky A Long-Step Barrier Method for Convex Quadratic Programming. Search on Bibsonomy Algorithmica The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Emil Klafszky, Tamás Terlaky Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids. Search on Bibsonomy Combinatorica The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1Tamás Terlaky A finite crisscross method for oriented matroids. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #64 of 64 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.