Tamás Terlaky

According to our database1, Tamás Terlaky authored at least 116 papers between 1987 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


On the identification of the optimal partition for semidefinite optimization.
INFOR Inf. Syst. Oper. Res., 2020

Quantum Circuit Design Search.
CoRR, 2020

A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors.
CoRR, 2020

A rounding procedure for semidefinite optimization.
Oper. Res. Lett., 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

On pathological disjunctions and redundant disjunctive conic cuts.
Oper. Res. Lett., 2018

The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections.
Interfaces, 2018

András Prékopa 1929-2016.
Eur. J. Oper. Res., 2017

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim., 2017

A polynomial primal-dual affine scaling algorithm for symmetric conic optimization.
Comput. Optim. Appl., 2017

A novel unified approach to invariance conditions for a linear dynamical system.
Appl. Math. Comput., 2017

An Analogue of the Klee-Walkup Result for Sonnevend's Curvature of the Central Path.
J. Optim. Theory Appl., 2016

On the Identification of the Optimal Partition of Second Order Cone Optimization Problems.
SIAM J. Optim., 2014

Special issue in honour of Professor Kees Roos' 70th Birthday.
Optim. Methods Softw., 2013

On families of quadratic surfaces having fixed intersections with two hyperplanes.
Discret. Appl. Math., 2013

On the volumetric path.
Optim. Lett., 2012

Convex approximations in stochastic programming by semidefinite programming.
Ann. Oper. Res., 2012

Optim. Methods Softw., 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

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

Optim. Methods Softw., 2010

Bi-parametric convex quadratic optimization.
Optim. Methods Softw., 2010

Optim. Methods Softw., 2010

Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions.
Math. Oper. Res., 2010

A polynomial path-following interior point algorithm for general linear complementarity problems.
J. Glob. Optim., 2010

Efficient preprocessing for VLSI optimization problems.
Comput. Optim. Appl., 2010

Polynomial Interior Point Algorithms for General Linear Complementarity Problems.
Algorithmic Oper. Res., 2010

Principal Pivoting Methods for Linear Complementarity Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Lexicographic Pivoting Rules.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Least-index Anticycling Rules.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Criss-Cross Pivoting Rules.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Multilevel Congestion-Based Global Router.
VLSI Design, 2009

New stopping criteria for detecting infeasibility in conic optimization.
Optim. Lett., 2009

A Continuous <i>d</i> -Step Conjecture for Polytopes.
Discret. Comput. Geom., 2009

Self-adaptive support vector machines: modelling and experiments.
Comput. Manag. Sci., 2009

A Hybrid Adaptive Algorithm for Linear Optimization.
Asia Pac. J. Oper. Res., 2009

A confidence voting process for ranking problems based on support vector machines.
Ann. Oper. Res., 2009

A redundant Klee-Minty construction with all the redundant constraints touching the feasible region.
Oper. Res. Lett., 2008

Polytopes and arrangements: Diameter and curvature.
Oper. Res. Lett., 2008

Mehrotra-type predictor-corrector algorithm revisited.
Optim. Methods Softw., 2008

Optimizing Teardrop, an MRI sampling trajectory.
Optim. Methods Softw., 2008

Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems".
Optim. Lett., 2008

A simpler and tighter redundant Klee-Minty construction.
Optim. Lett., 2008

How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds.
Math. Program., 2008

Packing trees in communication networks.
J. Comb. Optim., 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

Diameter and Curvature: Intriguing Analogies.
Electron. Notes Discret. Math., 2008

On routing in VLSI design and communication networks.
Discret. Appl. Math., 2008

The colourful feasibility problem.
Discret. Appl. Math., 2008

Central Eur. J. Oper. Res., 2008

Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization.
Central Eur. J. Oper. Res., 2008

A Survey of the S-Lemma.
SIAM Rev., 2007

On Mehrotra-Type Predictor-Corrector Algorithms.
SIAM J. Optim., 2007

Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms.
Eur. J. Oper. Res., 2007

Challenges of Continuous Optimization in Theory and Applications.
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

The central path visits all the vertices of the Klee-Minty cube.
Optim. Methods Softw., 2006

Feature Cluster "Advances in Continuous Optimization".
Eur. J. Oper. Res., 2006

Sensitivity analysis in linear optimization: Invariant support set intervals.
Eur. J. Oper. Res., 2006

Colourful Simplicial Depth.
Discret. Comput. Geom., 2006

The Complexity of Self-Regular Proximity Based Infeasible IPMs.
Comput. Optim. Appl., 2006

The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design.
Proceedings of the Modeling, 2006

A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function.
SIAM J. Optim., 2005

An adaptive self-regular proximity-based large-update IPM for LO.
Optim. Methods Softw., 2005

International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001).
Eur. J. Oper. Res., 2004

On implementing a primal-dual interior-point method for conic quadratic optimization.
Math. Program., 2003

Book Review: Computational Techniques of the Simplex Method.
Comput. Optim. Appl., 2003

Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities.
SIAM J. Optim., 2002

A dynamic large-update primal-dual interior-point method for linear optimization.
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

Pivot versus interior point methods: Pros and cons.
Eur. J. Oper. Res., 2002

IPM 2000. Continuous 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

A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization.
SIAM J. Optim., 2001

An easy way to teach interior-point methods.
Eur. J. Oper. Res., 2001

A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P<sub>*(kappa)</sub> Linear Complementarity Problems.
SIAM J. Optim., 2000

On Copositive Programming and Standard Quadratic Optimization Problems.
J. Glob. Optim., 2000

New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization.
Ann. Oper. Res., 2000

Note on a paper of Broyden.
Oper. Res. Lett., 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

The finite criss-cross method for hyperbolic programming.
Eur. J. Oper. Res., 1999

Computing Maximum Likelihood Estimators of Convex Density Functions.
SIAM J. Sci. Comput., 1998

On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance.
SIAM J. Optim., 1998

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming.
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

A nonconvex weighted potential function forpolynomial target following methods.
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

A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems.
SIAM J. Optim., 1997

Potential reduction algorithms for structured combinatorial optimization problems.
Oper. Res. Lett., 1997

Inverse barriers and CES-functions in linear programming.
Oper. Res. Lett., 1997

Initialization in semidefinite programming via a self-dual skew-symmetric embedding.
Oper. Res. Lett., 1997

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems.
Math. Program., 1997

Criss-cross methods: A fresh view on pivot algorithms.
Math. Program., 1997

A Potential Reduction Approach to the Frequency Assignment Problem.
Discret. Appl. Math., 1997

Optimization of nuclear reactor reloading patterns.
Ann. Oper. Res., 1997

An Investigation of Interior-Point Algorithms for the Linear Transportation Problem.
SIAM J. Sci. Comput., 1996

Improved complexity using higher-order correctors for primal-dual Dikin affine scaling.
Math. Program., 1996

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming.
Math. Oper. Res., 1996

Long-step primal-dual target-following algorithms for linear programming.
Math. Methods Oper. Res., 1996

Primal-dual target-following algorithms for linear programming.
Ann. Oper. Res., 1996

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems.
Math. Program., 1995

A logarithmic barrier cutting plane method for convex programming.
Ann. Oper. Res., 1995

A Monotonic Build-Up Simplex Algorithm for Linear Programming.
Oper. Res., 1994

Pivot rules for linear programming: A survey on recent theoretical developments.
Ann. Oper. Res., 1993

Degeneracy in interior point methods for linear programming: a survey.
Ann. Oper. Res., 1993

A Long-Step Barrier Method for Convex Quadratic Programming.
Algorithmica, 1993

A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems.
SIAM J. Optim., 1992

A build-up variant of the logarithmic barrier method for LP.
Oper. Res. Lett., 1992

Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids.
Comb., 1989

A finite crisscross method for oriented matroids.
J. Comb. Theory, Ser. B, 1987