Tamás Terlaky
Orcid: 0000-0003-1953-1971Affiliations:
- McMaster University, Hamilton, Canada
According to our database1,
Tamás Terlaky
authored at least 127 papers
between 1987 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on scopus.com
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
CoRR, 2024
2023
Quantum, September, 2023
Oper. Res. Lett., September, 2023
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization.
Entropy, February, 2023
2022
Math. Oper. Res., November, 2022
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem.
Quantum Inf. Process., 2022
EUR<i>O</i>pt, the Continuous Optimization Working Group of EURO: From idea to maturity.
EURO J. Comput. Optim., 2022
Proceedings of the 7th IEEE/ACM Symposium on Edge Computing, 2022
2021
On the sensitivity of the optimal partition for parametric second-order conic optimization.
Math. Program., 2021
2020
INFOR Inf. Syst. Oper. Res., 2020
CoRR, 2020
2019
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity.
Optim. Methods Softw., 2019
Examples with decreasing largest inscribed ball for deterministic rescaling algorithms.
INFOR Inf. Syst. Oper. Res., 2019
2018
Oper. Res. Lett., 2018
The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections.
Interfaces, 2018
2017
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim., 2017
Comput. Optim. Appl., 2017
Appl. Math. Comput., 2017
2016
J. Optim. Theory Appl., 2016
2014
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems.
SIAM J. Optim., 2014
2013
Optim. Methods Softw., 2013
Discret. Appl. Math., 2013
2012
Ann. Oper. Res., 2012
2011
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application.
Oper. Res., 2011
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms.
Algorithmic Oper. Res., 2011
2010
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X<sup>0</sup>S<sup>0</sup>)/ε)) Iteration Complexity.
SIAM J. Optim., 2010
On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization.
Optim. Methods Softw., 2010
Math. Oper. Res., 2010
A polynomial path-following interior point algorithm for general linear complementarity problems.
J. Glob. Optim., 2010
Algorithmic Oper. Res., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Optim. Lett., 2009
Comput. Manag. Sci., 2009
Ann. Oper. Res., 2009
2008
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region.
Oper. Res. Lett., 2008
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems".
Optim. Lett., 2008
How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Math. Program., 2008
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function.
Eur. J. Oper. Res., 2008
17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005.
Eur. J. Oper. Res., 2008
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization.
Central Eur. J. Oper. Res., 2008
2007
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms.
Eur. J. Oper. Res., 2007
Eur. J. Oper. Res., 2007
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors.
Algorithmic Oper. Res., 2007
2006
Optim. Methods Softw., 2006
Eur. J. Oper. Res., 2006
Comput. Optim. Appl., 2006
Proceedings of the Modeling, 2006
2005
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function.
SIAM J. Optim., 2005
Optim. Methods Softw., 2005
2004
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001).
Eur. J. Oper. Res., 2004
2003
On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Program., 2003
Comput. Optim. Appl., 2003
2002
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities.
SIAM J. Optim., 2002
Optim. Methods Softw., 2002
Self-regular functions and new search directions for linear and semidefinite optimization.
Math. Program., 2002
A new class of polynomial primal-dual methods for linear and semidefinite optimization.
Eur. J. Oper. Res., 2002
Self-regularity - a new paradigm for primal-dual interior-point algorithms.
Princeton series in applied mathematics, Princeton University Press, ISBN: 978-0-691-09193-8, 2002
2001
SIAM J. Optim., 2001
2000
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P<sub>*(kappa)</sub> Linear Complementarity Problems.
SIAM J. Optim., 2000
J. Glob. Optim., 2000
Ann. Oper. Res., 2000
1999
On maximization of quadratic form over intersection of ellipsoids with common center.
Math. Program., 1999
Basis- and partition identification for quadratic programming and linear complementarity problems.
Math. Program., 1999
1998
SIAM J. Sci. Comput., 1998
SIAM J. Optim., 1998
J. Comb. Optim., 1998
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., 1998
Ann. Oper. Res., 1998
Theory and algorithms for linear optimization - an interior point approach.
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-95676-1, 1998
1997
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems.
SIAM J. Optim., 1997
Oper. Res. Lett., 1997
Oper. Res. Lett., 1997
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program., 1997
Discret. Appl. Math., 1997
1996
SIAM J. Sci. Comput., 1996
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program., 1996
Math. Oper. Res., 1996
Math. Methods Oper. Res., 1996
Ann. Oper. Res., 1996
1995
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
Math. Program., 1995
Ann. Oper. Res., 1995
1994
1993
Ann. Oper. Res., 1993
Ann. Oper. Res., 1993
1992
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems.
SIAM J. Optim., 1992
1989
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids.
Comb., 1989
1987