Publications

Books

  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @BOOK{terlaky2012modeling, title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      publisher = {Springer},
      year = {2012},
      author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      volume = {21}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Methods for Linear Optimization, Heidelberg/Boston: Springer Science, 2006. bibtex
    @BOOK{Roos2006, title = {Interior Point Methods for Linear Optimization},
      publisher = {Springer Science},
      year = {2006},
      author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      address = {Heidelberg/Boston},
      note = {(Note: This book is a significantly revised new edition of Interior Point Approach to Linear Optimization: Theory and Algorithms)}
    }
  • E. de Klerk, C. Roos, and T. Terlaky, Nemlineáris Optimalizálás, (in Hungarian, English title: Nonlinear Optimization), Budapest, Hungary: Aula Publishing, 2004. bibtex
    @BOOK{Klerk2004, title = {Nemline\'aris Optimaliz\'al\'as, (in Hungarian, English title: Nonlinear Optimization)},
      publisher = {Aula Publishing},
      year = {2004},
      author = {de Klerk, E and Roos, C. and Terlaky, T.},
      address = {Budapest, Hungary}
    }
  • J. Peng, C. Roos, and T. Terlaky, Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods, Princeton University Press, 2002. bibtex
    @BOOK{Peng2002, title = {Self-Regularity: A New Paradigm for Primal Dual Interior Point Methods},
      publisher = {Princeton University Press},
      year = {2002},
      author = {Peng, J. and Roos, C. and Terlaky, T.}
    }
  • C. Roos, T. Terlaky, and J. Vial, Interior Point Approach to Linear Optimization: Theory and Algorithms, Chichester, New York: John Wiley & Sons, 1997 (second print 1998). bibtex
    @BOOK{Roos1997, title = {Interior Point Approach to Linear Optimization: Theory and Algorithms},
      publisher = {John Wiley {\&} Sons},
      year = {1997 (second print 1998)},
      author = {Roos, C. and Terlaky, T. and Vial, J.-Ph.},
      address = {Chichester, New York}
    }

Publications in Refereed Journals

2013

  • M. Mut and T. Terlaky, "An analogue of the Klee-Walkup result for Sonnevend’s curvature of the central path," , 2013. bibtex
    @ARTICLE{mut2013analogue,
      author = {Mut, Murat and Terlaky, Tam{\'a}s},
      title = {An analogue of the Klee-Walkup result for Sonnevend's curvature of the central path},
      year = {2013}
    }
  • R. Sotirov and T. Terlaky, "Multi-start approach for an integer determinant maximization problem," Optimization, vol. 62, iss. 1, pp. 101-114, 2013. bibtex
    @ARTICLE{sotirov2013multi,
      author = {Sotirov, R and Terlaky, T},
      title = {Multi-start approach for an integer determinant maximization problem},
      journal = {Optimization},
      year = {2013},
      volume = {62},
      pages = {101--114},
      number = {1},
      publisher = {Taylor \& Francis}
    }
  • T. Terlaky, E. de Klerk, G. Lesaja, and D. den Hertog, "Special issue in honour of Professor Kees Roos’ 70th Birthday," Optimization Methods and Software, vol. 28, iss. 3, pp. 393-395, 2013. bibtex
    @ARTICLE{terlaky2013special,
      author = {Terlaky, Tam{\'a}s and de Klerk, Etienne and Lesaja, Goran and den Hertog, Dick},
      title = {Special issue in honour of Professor Kees Roos' 70th Birthday},
      journal = {Optimization Methods and Software},
      year = {2013},
      volume = {28},
      pages = {393--395},
      number = {3},
      publisher = {Taylor \& Francis}
    }
  • M. Mut and T. Terlaky, "A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes," , 2013. bibtex
    @ARTICLE{mut2013tight,
      author = {Mut, Murat and Terlaky, Tam{\'a}s},
      title = {A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes},
      year = {2013}
    }

2012

  • D. Li and T. Terlaky, "The Duality between the Perceptron Algorithm and the von Neumann Algorithm," , 2012. bibtex
    @ARTICLE{li2012duality,
      author = {Li, Dan and Terlaky, Tam{\'a}s},
      title = {The Duality between the Perceptron Algorithm and the von Neumann Algorithm},
      year = {2012}
    }
  • I. Deák, I. Pólik, A. Prékopa, and T. Terlaky, "Convex approximations in stochastic programming by semidefinite programming," Annals of Operations Research, vol. 200, iss. 1, pp. 171-182, 2012. bibtex
    @ARTICLE{deak2012convex,
      author = {De{\'a}k, Istv{\'a}n and P{\'o}lik, Imre and Pr{\'e}kopa, Andr{\'a}s and Terlaky, Tam{\'a}s},
      title = {Convex approximations in stochastic programming by semidefinite programming},
      journal = {Annals of Operations Research},
      year = {2012},
      volume = {200},
      pages = {171--182},
      number = {1},
      publisher = {Springer}
    }
  • M. Salahi and T. Terlaky, "Self-Regular Interior-Point Methods for Semidefinite Optimization," in Handbook on Semidefinite, Conic and Polynomial Optimization, Springer, 2012, pp. 437-454. bibtex
    @INCOLLECTION{salahi2012self,
      author = {Salahi, Maziar and Terlaky, Tam{\'a}s},
      title = {Self-Regular Interior-Point Methods for Semidefinite Optimization},
      booktitle = {Handbook on Semidefinite, Conic and Polynomial Optimization},
      publisher = {Springer},
      year = {2012},
      pages = {437--454}
    }
  • O. Romanko, A. Ghaffari-Hadigheh, and T. Terlaky, "Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications," in Modeling and Optimization: Theory and Applications, Springer, 2012, pp. 77-119. bibtex
    @INCOLLECTION{romanko2012multiobjective,
      author = {Romanko, Oleksandr and Ghaffari-Hadigheh, Alireza and Terlaky, Tam{\'a}s},
      title = {Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications},
      booktitle = {Modeling and Optimization: Theory and Applications},
      publisher = {Springer},
      year = {2012},
      pages = {77--119}
    }
  • M. Mut and T. Terlaky, "On the volumetric path," Optimization Letters, vol. 6, iss. 4, pp. 687-693, 2012. bibtex
    @ARTICLE{mut2012volumetric,
      author = {Mut, Murat and Terlaky, Tam{\'a}s},
      title = {On the volumetric path},
      journal = {Optimization Letters},
      year = {2012},
      volume = {6},
      pages = {687--693},
      number = {4},
      publisher = {Springer}
    }
  • A. Deza, C. Dickson, T. Terlaky, A. Vannelli, and H. Zhang, "Global Routing in VLSI Design Algorithms, Theory, and Computational Practice," JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing, vol. 80, p. 71, 2012. bibtex
    @ARTICLE{deza2012global,
      author = {Deza, Antoine and Dickson, Chris and Terlaky, Tamas and Vannelli, Anthony and Zhang, Hu},
      title = {Global Routing in VLSI Design Algorithms, Theory, and Computational Practice},
      journal = {JCMCC-Journal of Combinatorial Mathematicsand Combinatorial Computing},
      year = {2012},
      volume = {80},
      pages = {71},
      publisher = {Citeseer}
    }
  • P. Belotti, J. Góez, I. Pólik, T. Ralphs, and T. Terlaky, "A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization," Optimization Online URL http://www. optimization-online. org/DB\_HTML/2012/06/3494. html, 2012. bibtex
    @ARTICLE{belotti2012conic,
      author = {Belotti, Pietro and G{\'o}ez, J and P{\'o}lik, Imre and Ralphs, Ted and Terlaky, Tam{\'a}s},
      title = {A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization},
      journal = {Optimization Online URL http://www. optimization-online. org/DB\_HTML/2012/06/3494. html},
      year = {2012}
    }
  • T. Terlaky and F. E. Curtis, Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference, Springer, 2012, vol. 21. bibtex
    @BOOK{terlaky2012modeling, title = {Modeling and Optimization: Theory and Applications; Selected Contributions from the MOPTA 2010 Conference},
      publisher = {Springer},
      year = {2012},
      author = {Terlaky, Tam{\'a}s and Curtis, Frank E},
      volume = {21}
    }

2011

  • C. K. Anand, S. J. Stoyan, and T. Terlaky, "Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms," Algorithmic Operations Research, vol. 6, iss. 1, p. pages-1, 2011. bibtex
    @ARTICLE{anand2011optimizing,
      author = {Anand, Christopher K and Stoyan, Stephen J and Terlaky, Tam{\'a}s},
      title = {Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms},
      journal = {Algorithmic Operations Research},
      year = {2011},
      volume = {6},
      pages = {Pages--1},
      number = {1}
    }
  • P. Belotti, J. C. Góez, I. Pólik, T. K. Ralphs, and T. Terlaky, "On families of quadratic surfaces having fixed intersections with two hyperplanes," Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering, 2011 bibtex
    @TECHREPORT{belotti2011families,
      author = {Belotti, Pietro and G{\'o}ez, Julio C and P{\'o}lik, Imre and Ralphs, Ted K and Terlaky, Tam{\'a}s},
      title = {On families of quadratic surfaces having fixed intersections with two hyperplanes},
      institution = {Tech. Rep. 11T-007, Lehigh University, Department of Industrial and Systems Engineering},
      year = {2011}
    }
  • M. R. Oskoorouchi, H. R. Ghaffari, T. Terlaky, and D. M. Aleman, "An interior point constraint generation algorithm for semi-infinite optimization with health-care application," Operations research, vol. 59, iss. 5, pp. 1184-1197, 2011. bibtex
    @ARTICLE{oskoorouchi2011interior,
      author = {Oskoorouchi, Mohammad R and Ghaffari, Hamid R and Terlaky, Tam{\'a}s and Aleman, Dionne M},
      title = {An interior point constraint generation algorithm for semi-infinite optimization with health-care application},
      journal = {Operations research},
      year = {2011},
      volume = {59},
      pages = {1184--1197},
      number = {5},
      publisher = {INFORMS}
    }

2010

  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, iss. 3, pp. 329-342, 2010. bibtex
    @ARTICLE{illes2010polynomial,
      author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      journal = {Journal of Global Optimization},
      year = {2010},
      volume = {47},
      pages = {329--342},
      number = {3},
      publisher = {Springer}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, vol. 47, pp. 329-342, 2010. bibtex (Download)
    @ARTICLE{Illes2010,
      author = {Ill\'es, Tibor and Nagy, Marianna and Terlaky, Tamás},
      title = {A polynomial path-following interior point algorithm for general linear complementarity problems},
      journal = {Journal of Global Optimization},
      year = {2010},
      volume = {47},
      pages = {329-342},
      note = {10.1007/s10898-008-9348-0},
      affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      issn = {0925-5001},
      issue = {3},
      keyword = {Engineering},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10898-008-9348-0}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, pp. 1-12, 2010. bibtex (Download)
    @ARTICLE{Illes2010b,
      author = {Tibor Illés and Marianna Nagy and Tamás Terlaky},
      title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      journal = {Algorithmic Operations Research},
      year = {2010},
      volume = {5},
      pages = {1--12},
      number = {1},
      issn = {1718-3235},
      keywords = {linear complementarity problem, sufficient matrix, $\mathcal{P}_*$-matrix, interior point method, affine scaling method, predictor-corrector algorithm},
      url = {http://journals.hil.unb.ca/index.php/AOR/article/view/11067}
    }
  • W. Hare, M. Liu, and T. Terlaky, "Efficient preprocessing for VLSI optimization problems," Computational Optimization and Applications, vol. 45, iss. 3, pp. 475-493, 2010. bibtex
    @ARTICLE{hare2010efficient,
      author = {Hare, WL and Liu, MJJ and Terlaky, Tam{\'a}s},
      title = {Efficient preprocessing for VLSI optimization problems},
      journal = {Computational Optimization and Applications},
      year = {2010},
      volume = {45},
      pages = {475--493},
      number = {3},
      publisher = {Springer}
    }
  • Y. Li and T. Terlaky, "A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^0S\^0)ϵ) Iteration Complexity," SIAM Journal on Optimization, vol. 20, iss. 6, pp. 2853-2875, 2010. bibtex
    @ARTICLE{li2010new,
      author = {Li, Yang and Terlaky, Tam{\'a}s},
      title = {A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(n$\backslash$logTr(X\^{}0S\^{}0)ϵ) Iteration Complexity},
      journal = {SIAM Journal on Optimization},
      year = {2010},
      volume = {20},
      pages = {2853--2875},
      number = {6},
      publisher = {SIAM}
    }
  • M. H. Koulaei and T. Terlaky, "On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization," Optimization Methods \& Software, vol. 25, iss. 3, pp. 467-485, 2010. bibtex
    @ARTICLE{koulaei2010complexity,
      author = {Koulaei, Mohammad H and Terlaky, Tamas},
      title = {On the complexity analysis of a Mehrotra-type primal--dual feasible algorithm for semidefinite optimization},
      journal = {Optimization Methods \& Software},
      year = {2010},
      volume = {25},
      pages = {467--485},
      number = {3},
      publisher = {Taylor \& Francis}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "Polynomial Interior Point Algorithms for General Linear Complementarity Problems," Algorithmic Operations Research, vol. 5, iss. 1, p. pages-1, 2010. bibtex
    @ARTICLE{illes2010polynomial,
      author = {Ill{\'e}s, Tibor and Nagy, Marianna and Terlaky, Tam{\'a}s},
      title = {Polynomial Interior Point Algorithms for General Linear Complementarity Problems},
      journal = {Algorithmic Operations Research},
      year = {2010},
      volume = {5},
      pages = {Pages--1},
      number = {1}
    }
  • A. Ghaffari-Hadigheh, O. Romanko, and T. Terlaky, "Bi-parametric convex quadratic optimization," Optimization Methods Software, vol. 25, pp. 229-245, 2010. bibtex (Download)
    @ARTICLE{Ghaffari-Hadigheh2010,
      author = {Ghaffari-Hadigheh, Alireza and Romanko, Oleksandr and Terlaky, Tamas},
      title = {Bi-parametric convex quadratic optimization},
      journal = {Optimization Methods Software},
      year = {2010},
      volume = {25},
      pages = {229--245},
      month = {April},
      acmid = {1744722},
      address = {Bristol, PA, USA},
      doi = {http://dx.doi.org/10.1080/10556780903239568},
      issn = {1055-6788},
      issue = {2},
      keywords = {bi-parametric optimization, convex quadratic optimization, interior-point methods, invariancy region, optimal partition},
      numpages = {17},
      publisher = {Taylor \& Francis, Inc.},
      url = {http://dx.doi.org/10.1080/10556780903239568}
    }

2009

  • P. Du, J. Peng, and T. Terlaky, "Self-adaptive support vector machines: modelling and experiments," Computational Management Science, vol. 6, pp. 41-51, 2009. bibtex (Download)
    @ARTICLE{Du2009,
      author = {Du, Peng and Peng, Jiming and Terlaky, Tamás},
      title = {Self-adaptive support vector machines: modelling and experiments},
      journal = {Computational Management Science},
      year = {2009},
      volume = {6},
      pages = {41-51},
      note = {10.1007/s10287-008-0071-6},
      affiliation = {Lake Simcoe Region Conservation Authority Corporate Services L3Y 4X1 Newmarket ON Canada},
      issn = {1619-697X},
      issue = {1},
      keyword = {Business and Economics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s10287-008-0071-6}
    }
  • T. Illés, M. Nagy, and T. Terlaky, "EP Theorem for Dual Linear Complementarity Problems," Journal of Optimization Theory and Applications, vol. 140, pp. 233-238, 2009. bibtex (Download)
    @ARTICLE{Illes2009,
      author = {Ill\'es, T. and Nagy, M. and Terlaky, T.},
      title = {EP Theorem for Dual Linear Complementarity Problems},
      journal = {Journal of Optimization Theory and Applications},
      year = {2009},
      volume = {140},
      pages = {233-238},
      note = {10.1007/s10957-008-9440-0},
      affiliation = {Strathclyde University Department of Management Science Glasgow UK},
      issn = {0022-3239},
      issue = {2},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10957-008-9440-0}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "A Continuous d-Step Conjecture for Polytopes," Discrete \& Computational Geometry, vol. 41, pp. 318-327, 2009. bibtex (Download)
    @ARTICLE{Deza2009,
      author = {Deza, Antoine and Terlaky, Tam{\'a}s and Zinchenko, Yuriy},
      title = {A Continuous d-Step Conjecture for Polytopes},
      journal = {Discrete \& Computational Geometry},
      year = {2009},
      volume = {41},
      pages = {318-327},
      note = {10.1007/s00454-008-9096-4},
      affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software, School of Computational Engineering and Science 1280 Main Street West Hamilton Ontario L8S 4K1 Canada},
      issn = {0179-5376},
      issue = {2},
      keyword = {Mathematics and Statistics},
      publisher = {Springer New York},
      url = {http://dx.doi.org/10.1007/s00454-008-9096-4}
    }
  • T. Jiao, J. Peng, and T. Terlaky, "A confidence voting process for ranking problems based on support vector machines," Annals of Operations Research, vol. 166, pp. 23-38, 2009. bibtex (Download)
    @ARTICLE{Jiao2009,
      author = {Jiao, Tianshi and Peng, Jiming and Terlaky, Tamás},
      title = {A confidence voting process for ranking problems based on support vector machines},
      journal = {Annals of Operations Research},
      year = {2009},
      volume = {166},
      pages = {23-38},
      note = {10.1007/s10479-008-0410-6},
      affiliation = {McMaster University Department of Computing and Software Hamilton Ontario Canada},
      issn = {0254-5330},
      issue = {1},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10479-008-0410-6}
    }

2008

  • M. Saad, T. Terlaky, A. Vannelli, and H. Zhang, "Packing trees in communication networks," Journal of Combinatorial Optimization, vol. 16, pp. 402-423, 2008. bibtex (Download)
    @ARTICLE{Saad2008,
      author = {Saad, Mohamed and Terlaky, Tam{\'a}s and Vannelli, Anthony and Zhang, Hu},
      title = {Packing trees in communication networks},
      journal = {Journal of Combinatorial Optimization},
      year = {2008},
      volume = {16},
      pages = {402-423},
      note = {10.1007/s10878-008-9150-4},
      affiliation = {University of Sharjah Department of Electrical and Computer Engineering Sharjah United Arab Emirates},
      issn = {1382-6905},
      issue = {4},
      keyword = {Mathematics and Statistics},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10878-008-9150-4}
    }
  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "The colourful feasibility problem," Discrete Applied Mathematics, vol. 156, iss. 11, pp. 2166-2177, 2008. bibtex (Download)
    @ARTICLE{Deza20082166,
      author = {Antoine Deza and Sui Huang and Tamon Stephen and Tam{\'a}s Terlaky},
      title = {The colourful feasibility problem},
      journal = {Discrete Applied Mathematics},
      year = {2008},
      volume = {156},
      pages = {2166 - 2177},
      number = {11},
      note = {In Memory of Leonid Khachiyan (1952 - 2005 )},
      doi = {DOI: 10.1016/j.dam.2008.01.016},
      issn = {0166-218X},
      keywords = {Colourful linear programming},
      url = {http://www.sciencedirect.com/science/article/B6TYW-4S0HBSF-1/2/f8fe6d08cf86426e933a8004821943b8}
    }
  • C. Kumar Anand, T. Ren, and T. Terlaky, "Optimizing Teardrop, an MRI sampling trajectory," Optimization Methods Software, vol. 23, pp. 575-592, 2008. bibtex (Download)
    @ARTICLE{KumarAnand2008,
      author = {Kumar Anand, Christopher and Ren, Tingting and Terlaky, Tamas},
      title = {Optimizing Teardrop, an MRI sampling trajectory},
      journal = {Optimization Methods Software},
      year = {2008},
      volume = {23},
      pages = {575--592},
      month = {August},
      acmid = {1451568},
      address = {Bristol, PA, USA},
      issn = {1055-6788},
      issue = {4},
      keywords = {balanced steady state free precession, constrained nonlinear optimization, k-space, magnetic resonance imaging, sequential second-order cone optimization, trajectory design},
      numpages = {18},
      publisher = {Taylor \& Francis, Inc.},
      url = {http://portal.acm.org/citation.cfm?id=1451560.1451568}
    }
  • T. Terlaky and J. Zhu, "Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”," Optimization Letters, vol. 2, pp. 497-503, 2008. bibtex (Download)
    @ARTICLE{Terlaky2008a,
      author = {Terlaky, Tam{\'a}s and Zhu, Jiaping},
      title = {Comments on Dual methods for nonconvex spectrum optimization of multicarrier systems”},
      journal = {Optimization Letters},
      year = {2008},
      volume = {2},
      pages = {497-503},
      note = {10.1007/s11590-008-0076-7},
      affiliation = {McMaster University Advanced Optimization Lab, School of Computational Engineering and Science, Department of Computing and Software Hamilton ON L8S 4K1 Canada},
      issn = {1862-4472},
      issue = {4},
      keyword = {Business and Economics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s11590-008-0076-7}
    }
  • E. Nematollahi and T. Terlaky, "A simpler and tighter redundant Klee–Minty construction," Optimization Letters, vol. 2, pp. 403-414, 2008. bibtex (Download)
    @ARTICLE{Nematollahi2008,
      author = {Nematollahi, Eissa and Terlaky, Tam{\'a}s},
      title = {A simpler and tighter redundant Klee–Minty construction},
      journal = {Optimization Letters},
      year = {2008},
      volume = {2},
      pages = {403-414},
      note = {10.1007/s11590-007-0068-z},
      affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      issn = {1862-4472},
      issue = {3},
      keyword = {Business and Economics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s11590-007-0068-z}
    }
  • Y. Zinchenko, T. Craig, H. Keller, T. Terlaky, and M. Sharpe, "Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework," Physics in Medicine and Biology, vol. 53, iss. 12, p. 3231, 2008. bibtex (Download)
    @ARTICLE{Zinchenko2008,
      author = {Y Zinchenko and T Craig and H Keller and T Terlaky and M Sharpe},
      title = {Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework},
      journal = {Physics in Medicine and Biology},
      year = {2008},
      volume = {53},
      pages = {3231},
      number = {12},
      abstract = {Radiation therapy is an important modality in treating various cancers. Various treatment planning and delivery technologies have emerged to support intensity modulated radiation therapy (IMRT), creating significant opportunities to advance this type of treatment. However, one of the fundamental questions in treatment planning and optimization, 'can we produce better treatment plans relying on the existing delivery technology?' still remains unanswered, in large part due to the underlying computational complexity of the problem, which, in turn, often stems from the optimization model being non-convex. We investigate the possibility of including the dose prescription, specified by the dose–volume histogram (DVH), within the convex optimization framework for inverse radiotherapy treatment planning. Specifically, we study the quality of approximating a given DVH with a superset of generalized equivalent uniform dose (gEUD)-based constraints, the so-called generalized moment constraints (GMCs). As a bi-product, we establish an analytic relationship between a DVH and a sequence of gEUD values. The newly proposed approach is promising as demonstrated by the computational study where the rectum DVH is considered. Unlike the precise partial-volume constraints formulation, which is commonly based on the mixed-integer model and necessitates the use of expensive computing resources to be solved to global optimality, our convex optimization approach is expected to be feasible for implementation on a conventional treatment planning station.},
      url = {http://stacks.iop.org/0031-9155/53/i=12/a=011}
    }
  • E. Nematollahi and T. Terlaky, "A redundant Klee-Minty construction with all the redundant constraints touching the feasible region," Operations Research Letters, vol. 36, iss. 4, pp. 414-418, 2008. bibtex (Download)
    @ARTICLE{Nematollahi2008414,
      author = {Eissa Nematollahi and Tam{\'a}s Terlaky},
      title = {A redundant Klee-Minty construction with all the redundant constraints touching the feasible region},
      journal = {Operations Research Letters},
      year = {2008},
      volume = {36},
      pages = {414 - 418},
      number = {4},
      doi = {DOI: 10.1016/j.orl.2008.02.004},
      issn = {0167-6377},
      keywords = {Linear optimization},
      url = {http://www.sciencedirect.com/science/article/B6V8M-4S1C2MC-1/2/2fd325b4230538114fc98dcbe7a7c131}
    }
  • A. Deza, E. Nematollahi, and T. Terlaky, "How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds," Mathematical Programming, vol. 113, pp. 1-14, 2008. bibtex (Download)
    @ARTICLE{Deza2008,
      author = {Deza, Antoine and Nematollahi, Eissa and Terlaky, Tamás},
      title = {How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds},
      journal = {Mathematical Programming},
      year = {2008},
      volume = {113},
      pages = {1-14},
      note = {10.1007/s10107-006-0044-x},
      affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton ON Canada},
      issn = {0025-5610},
      issue = {1},
      keyword = {Mathematics and Statistics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s10107-006-0044-x}
    }
  • T. Terlaky, A. Vannelli, and H. Zhang, "On routing in VLSI design and communication networks," Discrete Appl. Math., vol. 156, pp. 2178-2194, 2008. bibtex (Download)
    @ARTICLE{Terlaky2008,
      author = {Terlaky, Tam\'{a}s and Vannelli, Anthony and Zhang, Hu},
      title = {On routing in VLSI design and communication networks},
      journal = {Discrete Appl. Math.},
      year = {2008},
      volume = {156},
      pages = {2178--2194},
      month = {June},
      acmid = {1393780},
      address = {Amsterdam, The Netherlands, The Netherlands},
      doi = {10.1016/j.dam.2008.01.014},
      issn = {0166-218X},
      issue = {11},
      keywords = {Approximation algorithm, Communication networks, Routing, VLSI design},
      numpages = {17},
      publisher = {Elsevier Science Publishers B. V.},
      url = {http://portal.acm.org/citation.cfm?id=1393643.1393780}
    }
  • A. Deza, T. Terlaky, F. Xie, and Y. Zinchenko, "Diameter and Curvature: Intriguing Analogies," Electronic Notes in Discrete Mathematics, vol. 31, pp. 221-225, 2008. bibtex (Download)
    @ARTICLE{Deza2008221,
      author = {Antoine Deza and Tam{\'a}s Terlaky and Feng Xie and Yuriy Zinchenko},
      title = {Diameter and Curvature: Intriguing Analogies},
      journal = {Electronic Notes in Discrete Mathematics},
      year = {2008},
      volume = {31},
      pages = {221 - 225},
      note = {The International Conference on Topological and Geometric Graph Theory},
      doi = {DOI: 10.1016/j.endm.2008.06.044},
      issn = {1571-0653},
      keywords = {Continuous d-step and Hirsch conjectures},
      url = {http://www.sciencedirect.com/science/article/B75GV-4T5BWKX-1J/2/0608c91fb41f398b4f73054d1be6814c}
    }
  • A. Ghaffari-Hadigheh, H. Ghaffari-Hadigheh, and T. Terlaky, "Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization," Central European Journal of Operations Research, vol. 16, pp. 215-238, 2008. bibtex (Download)
    @ARTICLE{Ghaffari-Hadigheh2008,
      author = {Ghaffari-Hadigheh, Alireza and Ghaffari-Hadigheh, Habib and Terlaky, Tam{\'a}s},
      title = {Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization},
      journal = {Central European Journal of Operations Research},
      year = {2008},
      volume = {16},
      pages = {215-238},
      note = {10.1007/s10100-007-0054-7},
      affiliation = {Azarbaijan University of Tarbiat Moallem Department of Mathematics Tabriz Iran},
      issn = {1435-246X},
      issue = {2},
      keyword = {Business and Economics},
      publisher = {Physica Verlag, An Imprint of Springer-Verlag GmbH},
      url = {http://dx.doi.org/10.1007/s10100-007-0054-7}
    }
  • M. Salahi, M. R. Peyghami, and T. Terlaky, "New complexity analysis of IIPMs for linear optimization based on a specific self-regular function," European Journal of Operational Research, vol. 186, iss. 2, pp. 466-485, 2008. bibtex (Download)
    @ARTICLE{Salahi2008466,
      author = {M. Salahi and M.R. Peyghami and T. Terlaky},
      title = {New complexity analysis of IIPMs for linear optimization based on a specific self-regular function},
      journal = {European Journal of Operational Research},
      year = {2008},
      volume = {186},
      pages = {466 - 485},
      number = {2},
      doi = {DOI: 10.1016/j.ejor.2007.02.008},
      issn = {0377-2217},
      keywords = {Linear optimization},
      url = {http://www.sciencedirect.com/science/article/B6VCT-4N7RY2F-2/2/94c9366161a1fe2f152e300b1df38ef0}
    }
  • A. Deza, T. Terlaky, and Y. Zinchenko, "Polytopes and arrangements: Diameter and curvature," Operations Research Letters, vol. 36, iss. 2, pp. 215-222, 2008. bibtex (Download)
    @ARTICLE{Deza2008215,
      author = {Antoine Deza and Tamas Terlaky and Yuriy Zinchenko},
      title = {Polytopes and arrangements: Diameter and curvature},
      journal = {Operations Research Letters},
      year = {2008},
      volume = {36},
      pages = {215 - 222},
      number = {2},
      doi = {DOI: 10.1016/j.orl.2007.06.007},
      issn = {0167-6377},
      keywords = {Polytopes},
      url = {http://www.sciencedirect.com/science/article/B6V8M-4PN05G6-1/2/29ead241e2955e884c4406c1187788aa}
    }

2007

  • I. Pólik and T. Terlaky, "A Survey of the S-Lemma," SIAM Rev., vol. 49, pp. 371-418, 2007. bibtex (Download)
    @ARTICLE{Polik2007,
      author = {P\'{o}lik, Imre and Terlaky, Tam\'{a}s},
      title = {A Survey of the S-Lemma},
      journal = {SIAM Rev.},
      year = {2007},
      volume = {49},
      pages = {371--418},
      month = {July},
      acmid = {1655210},
      address = {Philadelphia, PA, USA},
      doi = {10.1137/S003614450444614X},
      issn = {0036-1445},
      issue = {3},
      keywords = {S-lemma, S-procedure, control theory, generalized convexities, nonconvex theorem of alternatives, numerical range, relaxation theory, semidefinite optimization},
      numpages = {48},
      publisher = {Society for Industrial and Applied Mathematics},
      url = {http://portal.acm.org/citation.cfm?id=1655208.1655210}
    }
  • A. Hadigheh, O. Romanko, and T. Terlaky, "Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors," Algorithmic Operations Research, vol. 2, iss. 2, pp. 94-111, 2007. bibtex (Download)
    @ARTICLE{AOR4624,
      author = {Alireza Hadigheh and Oleksandr Romanko and T. Terlaky},
      title = {Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors},
      journal = {Algorithmic Operations Research},
      year = {2007},
      volume = {2},
      pages = {94--111},
      number = {2},
      keywords = {Programming, quadratic: simultaneous perturbation sensitivity analysis using IPMs. Programming, linear,},
      url = {http://journals.hil.unb.ca/index.php/AOR/article/view/4624}
    }
  • A. Ghaffari Hadigheh, K. Mirnia, and T. Terlaky, "Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization," Journal of Optimization Theory and Applications, vol. 133, pp. 303-315, 2007. bibtex (Download)
    @ARTICLE{GhaffariHadigheh2007,
      author = {Ghaffari Hadigheh, A. and Mirnia, K. and Terlaky, T.},
      title = {Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization},
      journal = {Journal of Optimization Theory and Applications},
      year = {2007},
      volume = {133},
      pages = {303-315},
      note = {10.1007/s10957-007-9201-5},
      affiliation = {Azarbaijan Tarbiat Moallem University Department of Mathematics, Faculty of Science Tabriz Iran Tabriz Iran},
      issn = {0022-3239},
      issue = {3},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10957-007-9201-5}
    }
  • C. Anand, R. Sotirov, T. Terlaky, and Z. Zheng, "Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design," Optimization and Engineering, vol. 8, pp. 215-238, 2007. bibtex (Download)
    @ARTICLE{Anand2007,
      author = {Anand, Christopher and Sotirov, Renata and Terlaky, Tamás and Zheng, Zhuo},
      title = {Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design},
      journal = {Optimization and Engineering},
      year = {2007},
      volume = {8},
      pages = {215-238},
      note = {10.1007/s11081-007-9009-z},
      affiliation = {McMaster University Department of Computing and Software Hamilton ON L8S 4K1 Canada Hamilton ON L8S 4K1 Canada},
      issn = {1389-4420},
      issue = {2},
      keyword = {Engineering},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s11081-007-9009-z}
    }
  • M. Salahi, J. Peng, and T. Terlaky, "On Mehrotra-Type Predictor-Corrector Algorithms," SIAM J. on Optimization, vol. 18, pp. 1377-1397, 2007. bibtex (Download)
    @ARTICLE{Salahi2007,
      author = {Salahi, M. and Peng, J. and Terlaky, T.},
      title = {On Mehrotra-Type Predictor-Corrector Algorithms},
      journal = {SIAM J. on Optimization},
      year = {2007},
      volume = {18},
      pages = {1377--1397},
      month = {December},
      acmid = {1350573},
      address = {Philadelphia, PA, USA},
      doi = {10.1137/050628787},
      issn = {1052-6234},
      issue = {4},
      keywords = {Mehrotra-type algorithm, interior point methods, linear optimization, polynomial complexity, predictor-corrector method, superlinear convergence},
      numpages = {21},
      publisher = {Society for Industrial and Applied Mathematics},
      url = {http://portal.acm.org/citation.cfm?id=1350561.1350573}
    }
  • M. Salahi and T. Terlaky, "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, vol. 182, iss. 2, pp. 502-513, 2007. bibtex (Download)
    @ARTICLE{Salahi2007502,
      author = {Maziar Salahi and Tamás Terlaky},
      title = {Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms},
      journal = {European Journal of Operational Research},
      year = {2007},
      volume = {182},
      pages = {502 - 513},
      number = {2},
      doi = {DOI: 10.1016/j.ejor.2006.08.044},
      issn = {0377-2217},
      keywords = {Linear optimization},
      url = {http://www.sciencedirect.com/science/article/B6VCT-4MFJTBW-2/2/ec4defdf1c78fff3b180be05015d8e4f}
    }
  • M. Salahi and T. Terlaky, "Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization," Journal of Optimization Theory and Applications, vol. 132, pp. 143-160, 2007. bibtex (Download)
    @ARTICLE{Salahi2007a,
      author = {Salahi, M. and Terlaky, T.},
      title = {Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization},
      journal = {Journal of Optimization Theory and Applications},
      year = {2007},
      volume = {132},
      pages = {143-160},
      note = {10.1007/s10957-006-9095-7},
      affiliation = {McMaster University Advanced Optimization Laboratory, Department of Computing and Software Hamilton Ontario Canada},
      issn = {0022-3239},
      issue = {1},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1007/s10957-006-9095-7}
    }

2006

  • A. Deza, S. Huang, T. Stephen, and T. Terlaky, "Colourful Simplicial Depth," Discrete \& Computational Geometry, vol. 35, pp. 597-615, 2006. bibtex (Download)
    @ARTICLE{Deza2006a,
      author = {Deza, Antoine and Huang, Sui and Stephen, Tamon and Terlaky, Tamás},
      title = {Colourful Simplicial Depth},
      journal = {Discrete \& Computational Geometry},
      year = {2006},
      volume = {35},
      pages = {597-615},
      note = {10.1007/s00454-006-1233-3},
      affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada},
      issn = {0179-5376},
      issue = {4},
      keyword = {Mathematics and Statistics},
      publisher = {Springer New York},
      url = {http://dx.doi.org/10.1007/s00454-006-1233-3}
    }
  • A. Deza, E. Nematollahi, R. Peyghami, and T. Terlaky, "The central path visits all the vertices of the Klee–Minty cube," Optimization Methods and Software, vol. 21, iss. 5, pp. 851-865, 2006. bibtex (Download)
    @ARTICLE{Deza2006,
      author = {Deza, Antoine and Nematollahi, Eissa and Peyghami, Reza and Terlaky, Tamás},
      title = {The central path visits all the vertices of the Klee–Minty cube},
      journal = {Optimization Methods and Software},
      year = {2006},
      volume = {21},
      pages = {851-- 865},
      number = {5},
      url = {http://www.informaworld.com/10.1080/10556780500407725}
    }
  • D. Yang, J. Peng, M. L. 1, and T. Terlaky, "A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media," Communications in Computational Physics, vol. 1, iss. 3, pp. 528-547, 2006. bibtex
    @ARTICLE{Yang2006,
      author = {Dinghui Yang and Jiming Peng and Ming Lu 1 and Tamás Terlaky},
      title = {A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media},
      journal = {Communications in Computational Physics},
      year = {2006},
      volume = {1},
      pages = {528-547},
      number = {3}
    }
  • A. G. Hadigheh, K. Mirnia, and T. Terlaky, "Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals," INFOR: Information Systems and Operational Research, vol. 44, iss. 2, pp. 129-155, 2006. bibtex
    @ARTICLE{Hadigheh2006,
      author = {Hadigheh, Alireza Ghaffari and Mirnia, Kamal and Terlaky, Tamás},
      title = {Sensitivity analysis in linear and convex quadratic optimization: Invariant active constraint set and invariant set intervals},
      journal = {INFOR: Information Systems and Operational Research},
      year = {2006},
      volume = {44},
      pages = {129-155},
      number = {2}
    }
  • D. Yang, J. Peng, M. Lu, and T. Terlaky, "Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation," Bulletin of the Seismological Society of America, vol. 96, iss. 3, pp. 1114-1130, 2006. bibtex (Download)
    @ARTICLE{DinghuiYang06012006,
      author = {Yang, Dinghui and Peng, Jiming and Lu, Ming and Terlaky, Tamás},
      title = {Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation},
      journal = {Bulletin of the Seismological Society of America},
      year = {2006},
      volume = {96},
      pages = {1114-1130},
      number = {3},
      doi = {10.1785/0120050080},
      eprint = {http://www.bssaonline.org/cgi/reprint/96/3/1114.pdf},
      url = {http://www.bssaonline.org/cgi/content/abstract/96/3/1114}
    }
  • M. Salahi, T. Terlaky, and G. Zhang, "The Complexity of Self-Regular Proximity Based Infeasible IPMs," Comput. Optim. Appl., vol. 33, pp. 157-185, 2006. bibtex (Download)
    @ARTICLE{Salahi2006,
      author = {Salahi, Maziar and Terlaky, Tam\'{a}s and Zhang, Guoqing},
      title = {The Complexity of Self-Regular Proximity Based Infeasible IPMs},
      journal = {Comput. Optim. Appl.},
      year = {2006},
      volume = {33},
      pages = {157--185},
      month = {March},
      acmid = {1121222},
      address = {Norwell, MA, USA},
      doi = {10.1007/s10589-005-3064-1},
      issn = {0926-6003},
      issue = {2-3},
      keywords = {infeasible interior point method, linear optimization, polynomial complexity, self-regular proximity function},
      numpages = {29},
      publisher = {Kluwer Academic Publishers},
      url = {http://portal.acm.org/citation.cfm?id=1121209.1121222}
    }
  • G. A. Hadigheh and T. Terlaky, "Generalized support set invariancy sensitivity analysis in linear optimization," Journal of Industrial and Management Optimization, vol. 2, iss. 1, pp. 1-18, 2006. bibtex (Download)
    @ARTICLE{Hadigheh2006a,
      author = {A. Ghaffari Hadigheh and T. Terlaky},
      title = {Generalized support set invariancy sensitivity analysis in linear optimization},
      journal = {Journal of Industrial and Management Optimization},
      year = {2006},
      volume = {2},
      pages = {1--18},
      number = {1},
      url = {http://aimsciences.org/journals/pdfs.jsp?paperID=1555&mode=abstract}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity analysis in linear optimization: Invariant support set intervals," European Journal of Operational Research, vol. 169, iss. 3, pp. 1158-1175, 2006. bibtex (Download)
    @ARTICLE{Hadigheh20061158,
      author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      title = {Sensitivity analysis in linear optimization: Invariant support set intervals},
      journal = {European Journal of Operational Research},
      year = {2006},
      volume = {169},
      pages = {1158 - 1175},
      number = {3},
      doi = {DOI: 10.1016/j.ejor.2004.09.058},
      issn = {0377-2217},
      keywords = {Parametric optimization},
      url = {http://www.sciencedirect.com/science/article/B6VCT-4GMGWB4-1/2/e877e7b957bb619f5a263b5d39daaf5c}
    }

2005

  • M. Salahi and T. Terlaky, "An adaptive self-regular proximity-based large-update IPM for LO," Optimization Methods and Software, vol. 20, iss. 1, pp. 169-185, 2005. bibtex (Download)
    @ARTICLE{Salahi2005,
      author = {Salahi, Maziar and Terlaky, Tamás},
      title = {An adaptive self-regular proximity-based large-update IPM for LO},
      journal = {Optimization Methods and Software},
      year = {2005},
      volume = {20},
      pages = {169-185},
      number = {1},
      url = {http://www.informaworld.com/10.1080/10556780412331332024}
    }
  • J. Peng, T. Terlaky, and Y. Zhao, "A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function," SIAM J. on Optimization, vol. 15, pp. 1105-1127, 2005. bibtex (Download)
    @ARTICLE{Peng2005,
      author = {Peng, Jiming and Terlaky, Tam\'{a}s and Zhao, Yunbin},
      title = {A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function},
      journal = {SIAM J. on Optimization},
      year = {2005},
      volume = {15},
      pages = {1105--1127},
      month = {April},
      acmid = {1081209},
      address = {Philadelphia, PA, USA},
      doi = {10.1137/040603991},
      issn = {1052-6234},
      issue = {4},
      keywords = {interior-point methods, large neighborhoods, linear optimization, polynomial complexity, predictor-corrector method, self-regular proximity function, superlinear convergence},
      numpages = {23},
      publisher = {Society for Industrial and Applied Mathematics},
      url = {http://portal.acm.org/citation.cfm?id=1068397.1081209}
    }
  • A. G. Hadigheh and T. Terlaky, "Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals," Optimization, vol. 54, iss. 1, pp. 59-79, 2005. bibtex (Download)
    @ARTICLE{Hadigheh2005,
      author = {Alireza Ghaffari Hadigheh and Tamás Terlaky},
      title = {Sensitivity Analysis in Convex Quadratic Optimization: Invariant Support Set Intervals},
      journal = {Optimization},
      year = {2005},
      volume = {54},
      pages = {59--79},
      number = {1},
      url = {http://www.informaworld.com/10.1080/02331930412331323854}
    }

2004

  • F. Glineur and T. Terlaky, "Conic Formulation for lp-Norm Optimization," Journal of Optimization Theory and Applications, vol. 122, pp. 285-307, 2004. bibtex (Download)
    @ARTICLE{Glineur2004,
      author = {Glineur, F. and Terlaky, T.},
      title = {Conic Formulation for lp-Norm Optimization},
      journal = {Journal of Optimization Theory and Applications},
      year = {2004},
      volume = {122},
      pages = {285-307},
      note = {10.1023/B:JOTA.0000042522.65261.51},
      issn = {0022-3239},
      issue = {2},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1023/B:JOTA.0000042522.65261.51}
    }
  • M. Salahi, R. Sotirov, and T. Terlaky, "On self-regular IPMs," TOP, vol. 12, pp. 209-275, 2004. bibtex (Download)
    @ARTICLE{Salahi2004,
      author = {Salahi, Maziar and Sotirov, Renata and Terlaky, Tamás},
      title = {On self-regular IPMs},
      journal = {TOP},
      year = {2004},
      volume = {12},
      pages = {209-275},
      note = {10.1007/BF02578956},
      affiliation = {McMaster University Department of Mathematics and Statistics L8S 4K1 Hamilton ON Canada},
      issn = {1134-5764},
      issue = {2},
      keyword = {Business and Economics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/BF02578956}
    }
  • C. K. Anand, T. Terlaky, and B. Wang, "Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels," Optimization and Engineering, vol. 5, pp. 485-502, 2004. bibtex (Download)
    @ARTICLE{Anand2004,
      author = {Anand, Christopher Kumar and Terlaky, Tamás and Wang, Bixiang},
      title = {Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels},
      journal = {Optimization and Engineering},
      year = {2004},
      volume = {5},
      pages = {485-502},
      note = {10.1023/B:OPTE.0000042036.04931.49},
      issn = {1389-4420},
      issue = {4},
      keyword = {Engineering},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1023/B:OPTE.0000042036.04931.49}
    }

2003

  • J. Ndambuki, F. A. O. Otieno, C. B. M. Stroet, T. Terlaky, and E. Veling, "An Efficient Optimization Method in Groundwater Resource Management," Water South Africa, vol. 29, iss. 4, pp. 359-364, 2003. bibtex
    @ARTICLE{Ndambuki2003,
      author = {Ndambuki, JM and Otieno, F.A.O. and Stroet, C.B.M. and Terlaky, T. and EJM Veling},
      title = {An Efficient Optimization Method in Groundwater Resource Management},
      journal = {Water South Africa},
      year = {2003},
      volume = {29},
      pages = {359--364},
      number = {4}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "On implementing a primal-dual interior-point method for conic quadratic optimization," Mathematical Programming, vol. 95, pp. 249-277, 2003. bibtex (Download)
    @ARTICLE{Andersen2003,
      author = {Andersen, E.D. and Roos, C. and Terlaky, T.},
      title = {On implementing a primal-dual interior-point method for conic quadratic optimization},
      journal = {Mathematical Programming},
      year = {2003},
      volume = {95},
      pages = {249-277},
      note = {10.1007/s10107-002-0349-3},
      affiliation = {MOSEK APS, Fruebjergvej 3 Box 16, 2100 Copenhagen O, Denmark, e-mail: e.d. andersen@mosek.com DK},
      issn = {0025-5610},
      issue = {2},
      keyword = {Mathematics and Statistics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s10107-002-0349-3}
    }

2002

  • J. Peng, C. Roos, and T. Terlaky, "Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities," SIAM Journal on Optimization, vol. 13, iss. 1, pp. 179-203, 2002. bibtex (Download)
    @ARTICLE{Peng2002a,
      author = {Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      title = {Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities},
      journal = {SIAM Journal on Optimization},
      year = {2002},
      volume = {13},
      pages = {179-203},
      number = {1},
      keywords = {second-order conic optimization; primal-dual interior-point method; self-regular proximity function; polynomial complexity},
      publisher = {SIAM},
      url = {http://link.aip.org/link/?SJE/13/179/1}
    }
  • J. Peng, C. Roos, and T. Terlaky, "Self-regular functions and new search directions for linear and semidefinite optimization," Mathematical Programming, vol. 93, pp. 129-171, 2002. bibtex (Download)
    @ARTICLE{Peng2002d,
      author = {Peng, Jiming and Roos, Cornelis and Terlaky, Tamás},
      title = {Self-regular functions and new search directions for linear and semidefinite optimization},
      journal = {Mathematical Programming},
      year = {2002},
      volume = {93},
      pages = {129-171},
      note = {10.1007/s101070200296},
      affiliation = {Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada, L8S 4L7, e-mail: pengj@mcmaster.ca CA},
      issn = {0025-5610},
      issue = {1},
      keyword = {Mathematics and Statistics},
      publisher = {Springer Berlin / Heidelberg},
      url = {http://dx.doi.org/10.1007/s101070200296}
    }
  • E. D. Andersen, C. Roos, and T. Terlaky, "Notes on Duality in Second Order and p-Order Cone Optimization," Optimization: A Journal of Mathematical Programming and Operations Research, vol. 51, iss. 4, pp. 627-643, 2002. bibtex (Download)
    @ARTICLE{Andersen2002,
      author = {Andersen, E. D. and Roos, C. and Terlaky, T.},
      title = {Notes on Duality in Second Order and p-Order Cone Optimization},
      journal = {Optimization: A Journal of Mathematical Programming and Operations Research},
      year = {2002},
      volume = {51},
      pages = {627 -- 643},
      number = {4},
      url = {http://www.informaworld.com/10.1080/0233193021000030751}
    }
  • J. Peng, C. Roos, and T. Terlaky, "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, vol. 143, iss. 2, pp. 234-256, 2002. bibtex (Download)
    @ARTICLE{Peng2002b,
      author = {Jiming Peng and Cornelis Roos and Tam�s Terlaky},
      title = {A new class of polynomial primal-dual methods for linear and semidefinite optimization},
      journal = {European Journal of Operational Research},
      year = {2002},
      volume = {143},
      pages = {234 - 256},
      number = {2},
      issn = {0377-2217},
      keywords = {Linear optimization},
      url = {http://www.sciencedirect.com/science/article/B6VCT-45M0R5W-4/2/6448853a58a1baef289dd9b7a5db7b41}
    }
  • J. Peng and T. Terlaky, "A dynamic large-update primal-dual interior-point method for linear optimization," Optimization Methods and Software, vol. 17, iss. 6, pp. 1077-1104, 2002. bibtex (Download)
    @ARTICLE{Peng2002c,
      author = {Peng, Jiming and Terlaky, Tamás},
      title = {A dynamic large-update primal-dual interior-point method for linear optimization},
      journal = {Optimization Methods and Software},
      year = {2002},
      volume = {17},
      pages = {1077 -- 1104},
      number = {6},
      url = {http://www.informaworld.com/10.1080/1055678021000039175}
    }
  • T. Illes and T. Terlaky, "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, vol. 140, iss. 2, pp. 170-190, 2002. bibtex (Download)
    @ARTICLE{Illes2002,
      author = {Illes, Tibor and Terlaky, Tamas},
      title = {Pivot versus interior point methods: Pros and cons},
      journal = {European Journal of Operational Research},
      year = {2002},
      volume = {140},
      pages = {170-190},
      number = {2},
      month = {July},
      abstract = {No abstract is available for this item.},
      url = {http://ideas.repec.org/a/eee/ejores/v140y2002i2p170-190.html}
    }

2001

  • T. Terlaky, "Algorithmic Concepts for Linear Optimization," CORS-SCORO Bulletin, vol. 35, iss. 2, pp. 7-33, 2001. bibtex
    @ARTICLE{Terlaky2001a,
      author = {Terlaky, T.},
      title = {Algorithmic Concepts for Linear Optimization},
      journal = {CORS-SCORO Bulletin},
      year = {2001},
      volume = {35},
      pages = {7--33},
      number = {2}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction," J. Optim. Theory Appl., vol. 109, pp. 327-343, 2001. bibtex (Download)
    @ARTICLE{Peng2001,
      author = {Peng, J. and Roos, C. and Terlaky, T.},
      title = {New complexity analysis of the primal\—dual method for semidefinite optimization based on the Nesterov\—Todd direction},
      journal = {J. Optim. Theory Appl.},
      year = {2001},
      volume = {109},
      pages = {327--343},
      month = {May},
      acmid = {380598},
      address = {New York, NY, USA},
      doi = {10.1023/A:1017514422146},
      issn = {0022-3239},
      issue = {2},
      keywords = {Nesterov---Todd search direction, polynomial complexity, primal---dual interior point methods},
      numpages = {17},
      publisher = {Plenum Press},
      url = {http://portal.acm.org/citation.cfm?id=380592.380598}
    }
  • T. Terlaky, "An easy way to teach interior-point methods," European Journal of Operational Research, vol. 130, iss. 1, pp. 1-19, 2001. bibtex (Download)
    @ARTICLE{Terlaky2001,
      author = {Tam\'as Terlaky},
      title = {An easy way to teach interior-point methods},
      journal = {European Journal of Operational Research},
      year = {2001},
      volume = {130},
      pages = {1 - 19},
      number = {1},
      doi = {DOI: 10.1016/S0377-2217(00)00094-1},
      issn = {0377-2217},
      keywords = {Linear optimization},
      url = {http://www.sciencedirect.com/science/article/B6VCT-426XWHV-1/2/b20f39aa0003b8d0b86b5396f8879287}
    }
  • P. E. A. van der Lee, T. Terlaky, and T. Woudstra, "A new approach to optimizing energy systems," Computer Methods in Applied Mechanics and Engineering, vol. 190, iss. 40-41, pp. 5297-5310, 2001. bibtex (Download)
    @ARTICLE{Lee2001,
      author = {Patrick E. A. van der Lee and Tam\'as Terlaky and Theo Woudstra},
      title = {A new approach to optimizing energy systems},
      journal = {Computer Methods in Applied Mechanics and Engineering},
      year = {2001},
      volume = {190},
      pages = {5297 - 5310},
      number = {40-41},
      doi = {DOI: 10.1016/S0045-7825(01)00162-1},
      issn = {0045-7825},
      keywords = {Combined cycle},
      url = {http://www.sciencedirect.com/science/article/B6V29-43F3SN3-7/2/5070c324715018ba11a344f7b0aade16}
    }
  • A. J. Quist, K. Roos, T. Terlaky, R. Van Geemert, and E. Hoogenboom, "Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization," Optimization and Engineering, vol. 2, pp. 251-276, 2001. bibtex (Download)
    @ARTICLE{Quist2001,
      author = {Quist, Arie J. and Roos, Kees and Terlaky, Tam\'as and Van Geemert, Rene and Hoogenboom, Eduard},
      title = {Reloading Nuclear Reactor Fuel Using Mixed-Integer Nonlinear Optimization},
      journal = {Optimization and Engineering},
      year = {2001},
      volume = {2},
      pages = {251-276},
      note = {10.1023/A:1015354615402},
      issn = {1389-4420},
      issue = {3},
      keyword = {Engineering},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1023/A:1015354615402}
    }

2000

  • I. M. Bomze, M. Dür, E. De Klerk, C. Roos, A. J. Quist, and T. Terlaky, "On Copositive Programming and Standard Quadratic Optimization Problems," J. of Global Optimization, vol. 18, pp. 301-320, 2000. bibtex (Download)
    @ARTICLE{Bomze2000,
      author = {Bomze, Immanuel M. and D\"{u}r, Mirjam and De Klerk, Etienne and Roos, Cornelis and Quist, Arie J. and Terlaky, Tam\'{a}s},
      title = {On Copositive Programming and Standard Quadratic Optimization Problems},
      journal = {J. of Global Optimization},
      year = {2000},
      volume = {18},
      pages = {301--320},
      month = {December},
      acmid = {596351},
      address = {Hingham, MA, USA},
      doi = {10.1023/A:1026583532263},
      issn = {0925-5001},
      issue = {4},
      keywords = {Copositive programming, Global maximization, Positive semidefinite matrices, Standard quadratic optimization},
      numpages = {20},
      publisher = {Kluwer Academic Publishers},
      url = {http://portal.acm.org/citation.cfm?id=596089.596351}
    }
  • T. Illés, J. Peng, C. Roos, and T. Terlaky, "A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems," SIAM Journal on Optimization, vol. 11, iss. 2, pp. 320-340, 2000. bibtex (Download)
    @ARTICLE{Illes2000,
      author = {Tibor Ill\'{e}s and Jiming Peng and Cornelis Roos and Tam\'{a}s Terlaky},
      title = {A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems},
      journal = {SIAM Journal on Optimization},
      year = {2000},
      volume = {11},
      pages = {320-340},
      number = {2},
      doi = {10.1137/S1052623498336590},
      keywords = {linear complementarity problems; $P_*(\kappa)$ matrices; error bounds on the size of the variables; optimal partition; maximally complementary solution; rounding procedure},
      publisher = {SIAM},
      url = {http://link.aip.org/link/?SJE/11/320/1}
    }
  • E. de Klerk, J. Peng, C. Roos, and T. Terlaky, "A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization," SIAM J. on Optimization, vol. 11, pp. 870-888, 2000. bibtex (Download)
    @ARTICLE{Klerk2000,
      author = {Klerk, E. de and Peng, J. and Roos, C. and Terlaky, T.},
      title = {A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization},
      journal = {SIAM J. on Optimization},
      year = {2000},
      volume = {11},
      pages = {870--888},
      month = {April},
      acmid = {589015},
      address = {Philadelphia, PA, USA},
      doi = {http://dx.doi.org/10.1137/S1052623499352632},
      issn = {1052-6234},
      issue = {4},
      keywords = {interior point algorithms, primal-dual search directions, semidefinite optimization},
      numpages = {19},
      publisher = {Society for Industrial and Applied Mathematics},
      url = {http://dx.doi.org/10.1137/S1052623499352632}
    }
  • T. Koltai and T. Terlaky, "The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming," International Journal of Production Economics, vol. 65, iss. 3, pp. 257-274, 2000. bibtex (Download)
    @ARTICLE{Koltai2000257,
      author = {Tam\'as Koltai and Tam\'as Terlaky},
      title = {The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming},
      journal = {International Journal of Production Economics},
      year = {2000},
      volume = {65},
      pages = {257 - 274},
      number = {3},
      doi = {DOI: 10.1016/S0925-5273(99)00036-5},
      issn = {0925-5273},
      keywords = {Linear programming},
      url = {http://www.sciencedirect.com/science/article/B6VF8-405JSNP-3/2/9205821d66ea470b38e88ac0ed597d0e}
    }
  • J. Peng, C. Roos, and T. Terlaky, "New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization," Annals of Operations Research, vol. 99, pp. 23-39, 2000. bibtex (Download)
    @ARTICLE{Peng2000,
      author = {Peng, J. and Roos, C. and Terlaky, T.},
      title = {New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization},
      journal = {Annals of Operations Research},
      year = {2000},
      volume = {99},
      pages = {23-39},
      note = {10.1023/A:1019280614748},
      issn = {0254-5330},
      issue = {1},
      keyword = {Computer Science},
      publisher = {Springer Netherlands},
      url = {http://dx.doi.org/10.1023/A:1019280614748}
    }

Previous to 2000