Tamás Terlaky

Q: What Schools Are Affiliated With Tamás Terlaky

Tamás Terlaky is affiliated with the following schools: Lehigh University, McMaster University, Eötvös Loránd University, Delft University of Technology, Erasmus University Rotterdam

Tamás Terlaky's AcademicInfluence.com Rankings

Tamás Terlaky

Mathematics

#6749

World Rank

#9294

Historical Rank

#1984

USA Rank

Operations Research

#74

World Rank

#76

Historical Rank

#24

USA Rank

Measure Theory

#2369

World Rank

#2833

Historical Rank

#671

USA Rank

mathematics Degrees

Download Badge

Mathematics

Tamás Terlaky's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Tamás Terlaky Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Tamás Terlaky is a Hungarian-Canadian-American professor of Industrial and Systems Engineering at Lehigh University. He is especially well known for his work on criss-cross algorithms, interior-point methods, Klee-Minty examples for path following algorithms, and optimization.

(See a Problem?)

Tamás Terlaky's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Theory and algorithms for linear optimization - an interior point approach (1998) (669)
On implementing a primal-dual interior-point method for conic quadratic optimization (2003) (613)
A Survey of the S-Lemma (2007) (510)
Self-regularity - a new paradigm for primal-dual interior-point algorithms (2002) (298)
Self-regular functions and new search directions for linear and semidefinite optimization (2002) (249)
Interior Point Methods for Nonlinear Optimization (2010) (243)
On Copositive Programming and Standard Quadratic Optimization Problems (2000) (224)
On maximization of quadratic form over intersection of ellipsoids with common center (1999) (196)
Pivot rules for linear programming: A survey on recent theoretical developments (1993) (147)
Sensitivity analysis in linear programming: just be careful! (1997) (135)
Interior Point Methods for Linear Optimization (2005) (125)
Initialization in semidefinite programming via a self-dual skew-symmetric embedding (1997) (103)
A convergent criss-cross method (1985) (99)
On Mehrotra-Type Predictor-Corrector Algorithms (2007) (81)
Optimal Nearly Analytic Discrete Approximation to the Scalar Wave Equation (2006) (80)
The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming (1996) (80)
Criss-cross methods: A fresh view on pivot algorithms (1997) (78)
The difference between the managerial and mathematical interpretation of sensitivity analysis results in linear programming (2000) (77)
Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities (2002) (76)
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with O(√n log (Tr(X0S0)/ε)) Iteration Complexity (2010) (74)
A NEW AND EFFICIENT LARGE-UPDATE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION (2001) (73)
On the classical logarithmic barrier function method for a class of smooth convex programming problems (1992) (71)
Primal-dual target-following algorithms for linear programming (1996) (66)
A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (2015) (65)
Pivot versus interior point methods: Pros and cons (2002) (58)
On lp programming (1985) (57)
Sensitivity analysis in linear optimization: Invariant support set intervals (2006) (56)
The theory of linear programming:skew symmetric self-dual problems and the central path * (1994) (55)
A new class of polynomial primal-dual methods for linear and semidefinite optimization (2002) (53)
The linear complimentarity problem, sufficient matrices, and the criss-cross method (1993) (53)
Degeneracy in interior point methods for linear programming: a survey (1993) (50)
New Complexity Analysis of the Primal—Dual Newton Method for Linear Optimization (2000) (48)
A polynomial path-following interior point algorithm for general linear complementarity problems (2010) (48)
A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems (2000) (47)
A finite crisscross method for oriented matroids (1987) (46)
A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming (1996) (46)
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors (2007) (45)
LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS (1992) (44)
A computational view of interior point methods (1996) (43)
On families of quadratic surfaces having fixed intersections with two hyperplanes (2013) (43)
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application (2011) (42)
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems (1995) (40)
New stopping criteria for detecting infeasibility in conic optimization (2009) (38)
Polytopes and arrangements: Diameter and curvature (2008) (38)
How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds (2008) (36)
A logarithmic barrier cutting plane method for convex programming (1995) (35)
Long-step primal-dual target-following algorithms for linear programming (1996) (34)
Some generalizations of the criss-cross method for quadratic programming (1992) (33)
A Monotonic Build-Up Simplex Algorithm for Linear Programming (1994) (32)
Interior-Point Methodology for Linear Programming: Duality, Sensitivity Analysis and Computational Aspects (1993) (31)
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems (1992) (31)
EP Theorem for Dual Linear Complementarity Problems (2009) (31)
Improved complexity using higher-order correctors for primal-dual Dikin affine scaling (1997) (30)
Theory and algorithms for semidefinite programming (2000) (30)
Central Path Curvature and Iteration-Complexity for Redundant Klee—Minty Cubes (2009) (30)
Interior Point and Semidefinite Approaches in Combinatorial Optimization (2005) (30)
A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems (1997) (29)
Colourful Simplicial Depth (2005) (29)
A Potential Reduction Approach to the Frequency Assignment Problem (1997) (29)
An Investigation of Interior-Point Algorithms for the Linear Transportation Problem (1996) (28)
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function (2005) (27)
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (1999) (27)
Sensitivity Analysis in (Degenerate) Quadratic Programming (1996) (27)
An interior point approach to postoptimal and parametric analysis in linear programming Report 92-21 (1993) (27)
Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (1989) (27)
A Continuous d-Step Conjecture for Polytopes (2009) (27)
Polynomial Interior Point Algorithms for General Linear Complementarity Problems (2010) (27)
Inverse barrier methods for linear programming (1994) (26)
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions (2010) (26)
Exact duality for optimization over symmetric cones (2007) (25)
On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance (1998) (25)
Advances and Trends in Optimization with Engineering Applications (2017) (25)
Active Constraint Set Invariancy Sensitivity Analysis in Linear Optimization (2007) (24)
The central path visits all the vertices of the Klee–Minty cube (2006) (24)
The role of pivoting in proving some fundamental theorems of linear algebra (1991) (24)
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization (2008) (24)
Controlling the dose distribution with gEUD-type constraints within the convex radiotherapy optimization framework (2008) (24)
Application of nonlinear optimization to reactor core fuel reloading (1999) (23)
Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems (1997) (23)
Self-Dual Embeddings (2000) (22)
The colourful feasibility problem (2005) (22)
Logarithmic barrier decomposition methods for semi-infinite programming (1997) (22)
An easy way to teach interior-point methods (2001) (21)
Generalized support set invariancy sensitivity analysis in linear optimization (2006) (20)
Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming (1998) (20)
A build-up variant of the logarithmic barrier method for LP (1992) (19)
On routing in VLSI design and communication networks (2005) (19)
Bi-parametric convex quadratic optimization (2010) (19)
A new approach to optimizing energy systems (2001) (17)
A potential-reduction variant of Renegar's short-step path-following method for linear programming (1991) (17)
Linearly constrained estimation by mathematical programming (1989) (17)
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (2015) (17)
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems (2014) (16)
Potential reduction algorithms for structured combinatorial optimization problems (1997) (16)
A new algorithm for quadratic programming (1987) (16)
A novel approach to discrete truss design problems using mixed integer neighborhood search (2018) (16)
Adding and Deleting Constraints in the Logarithmic Barrier Method for LP (1994) (16)
The Complexity of Self-Regular Proximity Based Infeasible IPMs (2006) (16)
Target-Following Methods for Linear Programming (1996) (16)
Self-Regular Proximities and New Search Directions for Linear and Semidefinite Optimization (2000) (15)
A Polynomial Method of Weighted Centers for Convex Quadratic Programming (1991) (15)
Multiobjective Optimization via Parametric Optimization: Models, Algorithms, and Applications (2012) (15)
A dynamic large-update primal‐dual interior-point method for linear optimization (2002) (15)
Semi-definite problems in truss topology optimization (2007) (14)
A Long-step barrier method for convex quadratic programming (1993) (14)
The Use of Low-rank Updates in Interior-point Methods (14)
On the identification of the optimal partition for semidefinite optimization (2020) (14)
Quantum circuit design search (2020) (14)
Parametric analysis of semidefinite optimization (2018) (14)
Polynomial affine-scaling algorithms for P*(k) linear complementary problems (1997) (13)
Mehrotra-type predictor-corrector algorithm revisited (2008) (13)
A novel unified approach to invariance conditions for a linear dynamical system (2017) (12)
New Complexity Analysis of Primal-Dual Newton Methods for P *(κ) Linear Complementarity Problems (2000) (12)
Computing Maximum Likelihood Estimators of Convex Density Functions (1998) (12)
Basis- and partition identification for quadratic programming and linear complementarity problems (1999) (12)
On the existence of a short admissible pivot sequence for feasibility and linear optimization problems (1999) (12)
A Polynomial Column-wise Rescaling von Neumann Algorithm (2015) (12)
Central Region Method (2000) (12)
Packing trees in communication networks (2005) (12)
The Duality Between the Perceptron Algorithm and the von Neumann Algorithm (2013) (12)
A confidence voting process for ranking problems based on support vector machines (2009) (11)
Quantum Interior Point Methods for Semidefinite Optimization (2021) (11)
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms (2007) (10)
Magnetic resonance tissue quantification using optimal bSSFP pulse-sequence design (2007) (10)
On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization (2019) (10)
The finite criss-cross method for hyperbolic programming (1996) (10)
A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization (2000) (10)
On primal-dual path-following algorithms in semidefinite programming. (1998) (10)
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors (2020) (10)
Self-adaptive support vector machines: modelling and experiments (2009) (10)
On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization (2010) (10)
Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem (1996) (10)
A Survey on Pivot Rules for Linear Programming (1992) (10)
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics (1999) (9)
A simpler and tighter redundant Klee–Minty construction (2008) (9)
Note on a paper of Broyden (1999) (9)
Optimization of nuclear reactor reloading patterns (1997) (9)
A survey of the implications of the behavior of the central path for the duality theory of linear programming (1995) (8)
Sensitivity Analysis In Linear And Convex Quadratic Optimization: Invariant Active Constraint Set And Invariant Set Intervals* (2006) (8)
A Nearly Analytical Discrete Method for Wave-Field Simulations in 2D Porous Media (2006) (8)
Global Routing in VLSI Design: Algorithms, Theory, and Computational Practice (2010) (8)
Inverse barrier methods for linear programming Report 91-27 (1991) (8)
Modeling and Optimization: Theory and Applications (2019) (8)
Method of approximate centers for semi-definite programming (1997) (8)
New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction (2001) (7)
Invariance Conditions for Nonlinear Dynamical Systems (2016) (7)
Warm-start of interior point methods for second order cone optimization via rounding over optimal Jordan frames (2017) (7)
Comments on “Dual methods for nonconvex spectrum optimization of multicarrier systems” (2008) (7)
Rapid, Embeddable Design Method for Spiral Magnetic Resonance Image Reconstruction Resampling Kernels (2004) (6)
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (2008) (6)
Sensitivity analysis in convex quadratic optimization: invariant support set interval (2005) (6)
A Homogenized Cutting Plane Method to Solve the Convex Feasibility Problem (2001) (6)
On the sensitivity of the optimal partition for parametric second-order conic optimization (2019) (5)
A rounding procedure for semidefinite optimization (2019) (5)
A Novel Unified Approach to Invariance in Control (2014) (5)
An Analogue of the Klee–Walkup Result for Sonnevend’s Curvature of the Central Path (2016) (5)
An adaptive self-regular proximity-based large-update IPM for LO (2005) (5)
On the monotonicity of the dual objective along barrier paths (1992) (5)
Inverse barriers and CES-functions in linear programming (1997) (5)
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (2008) (5)
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity (2018) (4)
Truss topology design and sizing optimization with guaranteed kinematic stability (2020) (4)
On pathological disjunctions and redundant disjunctive conic cuts (2018) (4)
Invariance Preserving Discretization Methods of Dynamical Systems (2016) (4)
Diameter and Curvature: Intriguing Analogies (2008) (4)
Self-Regular Interior-Point Methods for Semidefinite Optimization (2012) (4)
A unifying investigation of interior-point methods for convex programming Report 92-89 (1992) (4)
Optimization. Algorithms and consistent approximations : Elijah Polak Springer, New York, NY, 1997, ISBN 0-38794971-2, hb., 118 DM, 779 pages (1998) (4)
A Short Survey on Semidefinite Programming (1997) (4)
Effects of Disjunctive Conic Cuts within a Branch and Conic Cut Algorithm to Solve Asset Allocation Problems (2016) (4)
The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections (2018) (4)
Optimizing Teardrop, an MRI sampling trajectory (2008) (4)
Convex approximations in stochastic programming by semidefinite programming (2012) (4)
Derivative free optimization method (2000) (3)
A Note on Mascarenhas' Counterexample about Global Convergence of the Affine Scaling Algorithm (1999) (3)
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (2017) (3)
ON AN IMPLEMENTATION OF SELF-REGULAR PROXIMITY BASED FEASIBLE IPMS (2004) (3)
Pseudoconvex optimization for a special problem of paint industry (1994) (3)
Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions (1999) (3)
Modeling and optimization : theory and applications : selected contributions from the MOPTA 2010 conference (2012) (3)
Discrete multi-load truss sizing optimization: model analysis and computational experiments (2021) (3)
A geometric programming approach to the channel capacity problem (1992) (3)
Special issue in honour of Professor Kees Roos’ 70th Birthday (2013) (3)
Introduction to the Theory of Interior Point Methods (1996) (2)
An efficient optimisation method in groundwater resource management (2004) (2)
A nonconvex weighted potential function forpolynomial target following methods (1998) (2)
Twenty-Five Years of Interior Point Methods (2009) (2)
Efficient preprocessing for VLSI optimization problems (2010) (2)
Criss-Cross Pivoting Rules (2009) (2)
Optimization and Engineering Applications (2007) (2)
Multi-start approach for an integer determinant maximization problem (2013) (2)
Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization (2007) (2)
Mixed-Integer Conic Linear Programming: Challenges and Perspectives (2013) (2)
The first heuristic specifically for mixed-integer second-order cone optimization (2018) (2)
A new algorithm for the computation of the smallest eigenvalue of a symmetric matrix and its eigenspace Report (1995) (2)
Surface reconstruction from structured-light images for radiation therapy (2005) (2)
Magnetic resonance tissue density estimation using optimal SSFP pulse-sequence design (2007) (2)
Polynomial interior point algorithms for general LCPs (2007) (2)
Feature Cluster "Advances in Continuous Optimization" (2006) (2)
Lexicographic Pivoting Rules (2009) (2)
Veszprém Optimization Conference: Advanced Algorithms (VOCAL) 2010 (2013) (1)
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001) (2004) (1)
Towards a practical simplex method for second order cone programming (2004) (1)
Advanced Optimization Laboratory Title : Bi-Parametric Convex Quadratic Optimization (2008) (1)
A Novel Unified Approach to Invariance for a Dynamical System (2014) (1)
Book Review: Computational Techniques of the Simplex Method (2003) (1)
Mathematical Programming in Machine Learning and Data Mining (2007) (1)
Generating Linear, Semidefinite, and Second-order Cone Optimization Problems for Numerical Experiments (2023) (1)
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem (2021) (1)
A Hybrid Adaptive Algorithm for Linear Optimization (2009) (1)
A note on central cutting plane methods for convex programming Report (1993) (1)
The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design (2006) (1)
SU‐FF‐J‐103: Intra‐Fraction Prostate Motion Evaluation with On‐Line Fluoroscopic Imaging (2007) (1)
Pivot versus interior point methods (2000) (1)
A Multilevel Congestion-Based Global Router (2009) (1)
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization (2023) (1)
Smoothing empirical functions by lp programming (1986) (1)
A novel marker enhancement filter (MEF) for fluoroscopic images (2014) (1)
EUROpt, the Continuous Optimization Working Group of EURO: From idea to maturity (2022) (1)
IPM 2000. Continuous Optimization (2002) (1)
17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005 (2008) (1)
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms (2011) (1)
A Provably Good Global Routing Algorithm in Multilayer IC and MCM Layout Designs (2009) (1)
On Semidefinite Representations of Second-order Conic Optimization Problems (2023) (1)
Basis-and tripartition identification for quadratic programming and linear complementarity problems From an interior solution to an optimal basis and viceversa Report 96-31 (1996) (1)
Quadratic convergence of Newton ’ s method to the optimal solution of second-order conic optimization (2017) (1)
Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization problems (2020) (1)
The Inmate Transportation Problem and Its Application in the PA Department of Corrections (2018) (1)
Theory and algorithms for semidefinite programming : Introduction (2000) (0)
Challenges of Continuous Optimization in Theory and Applications (2007) (0)
Operations Research Report 2007-02 An EP theorem for dual linear complementarity problem (2007) (0)
Veszprém Optimization Conference: Advanced Algorithms (VOCAL) 2010 (2013) (0)
The Inmate Assignment and Scheduling Problem and its Application in the PA Department of Correction (2017) (0)
A note on Mascarenhas ’ counter example about global convergence of the affine scaling algorithm Report 96-45 (2007) (0)
Special Issue: Smooth and Nonsmooth Optimization (2004) (0)
ON BI-PARAMETRIC PROGRAMMING IN QUADRATIC OPTIMIZATION (2008) (0)
Advanced Optimization Laboratory Title : The continuous d-step conjecture for polytopes (2007) (0)
Polynomiality of Path-Following Methods (2000) (0)
Advanced Optimization Laboratory Title : Adaptive Large Neighborhood Self-Regular Predictor-Corrector (2004) (0)
Chapter 1. Introduction and Preliminaries (2009) (0)
On the sensitivity of the optimal partition for parametric second-order conic optimization (2021) (0)
Modeling and optimization: theory and applications (MOPTA) 2019–selected works (2021) (0)
Chapter 7 Central Path Curvature and Iteration-Complexity for Redundant Klee — (2009) (0)
Least-index Anticycling Rules (2009) (0)
An EP theorem for DLCP and interior point methods (2007) (0)
Introduction to Polynomial Time Algorithms for LP (2011) (0)
Solving Large-Scale Discrete Multi-Scenario Truss Sizing Optimization Problems (0)
Preface (2011) (0)
DELFT UNIVERSITY OF TECHNOLOGYREPORT 90 { 17 A POLYNOMIAL METHOD OF WEIGHTEDCENTERS FOR CONVEX QUADRATICPROGRAMMINGD (2007) (0)
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (2013) (0)
Modeling and optimization : theory and applications : MOPTA, Bethlehem, PA, USA, August 2014, selected contributions (2015) (0)
Preface (2010) (0)
Quantum-enhanced Regression Analysis Using State-of-the-art QLSAs and QIPMs (2022) (0)
Properties of the Central Path (2000) (0)
Chapter 6. Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities (2009) (0)
Invariance Preserving Discretization Methods of Dynamical Systems (2018) (0)
Principal Pivoting Methods for Linear Complementarity Problems (2009) (0)
Convex approximations in stochastic programming by semidefinite programming (2011) (0)
Truss topology design and sizing optimization with guaranteed kinematic stability (2020) (0)
4 TE 3 / 6 TE 3 Algorithms for Continuous Optimization ( Duality in Nonlinear Optimization ) (2003) (0)
Volumetric Path and Klee-Minty Constructions (2007) (0)
An Analogue of the Klee–Walkup Result for Sonnevend’s Curvature of the Central Path (2015) (0)
Nuclear reactor fuel management optimization (1997) (0)
Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (2013) (0)
Chapter 4. Interior-Point Methods for Complementarity Problems Based on Self- Regular Proximities (2009) (0)
Celebrating 20 years of EUROpt (2022) (0)
The max k-cut problem on classical and quantum solvers (2022) (0)
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (2016) (0)
A Logarithmic Barrier Approach to Fischer Function (2000) (0)
On the identification of optimal partition and optimal solutions for semidefinite optimization (2016) (0)
On self-regular IPMs (2004) (0)
Chapter 1: Algorithms for Linear and Quadratic Optimization (2017) (0)
A novel approach to discrete truss design problems using mixed integer neighborhood search (2018) (0)
COLMAP 1.0 - Color Matching Program (1991) (0)
Sensitivity analysis in ( degenerate ) quadratic programming Report 96-26 (1996) (0)
On Relaxations of the Max k -cut Formulations (2022) (0)
Application of Nonlinear Optimization toReactor Core Fuel (1998) (0)
Examples with decreasing largest inscribed ball for deterministic rescaling algorithms (2019) (0)
Chapter 7. Initialization: Embedding Models for Linear Optimization, Complementarity Problems, Semidefinite Optimization and Second-Order Conic Optimization (2009) (0)
On parametric second-order conic optimization (2019) (0)
Interior Point Methods for Linear Optimization: Exercises (2005) (0)
Primal-dual affine-scaling algorithms for nonlinear monotone complementarity problems (1994) (0)
Iri ’ s polynomiality proof for the Iri-Imai method recast Report 91-74 (1991) (0)
Advanced Optimization Laboratory Title : Colourful Simplicial Depth (2005) (0)
Chapter 5. Primal-Dual Interior-Point Methods for Semidefinite Optimization Based on Self-Regular Proximities (2009) (0)
Nonlinear Optimization: Lectures given at the C.I.M.E. Summer School held in Cetraro, Italy, July 1-7, 2007 (2010) (0)
Optimization Methods and Software: Preface (2010) (0)
Book reviews (1989) (0)
OPTIMAL PARTITION FOR SEMIDEFINITE OPTIMIZATION 3 and limiting behavior of the central path in SDO as extensively studied by Goldfarb (2016) (0)
Efficient Use of Quantum Linear System Algorithms in Interior Point Methods for Linear Optimization (2022) (0)
Editorial—Optimization and Engineering (OPTE) (2000) (0)
Towards a simplex-like method for second order cone programming (2004) (0)
O C ] 1 3 A ug 2 01 8 Parametric analysis of semidefinite optimization (2018) (0)
On the volumetric path (2011) (0)
On the volumetric path (2012) (0)
Self-Dual Embedding Technique (2000) (0)
Formulations of the max k-cut problem on classical and quantum computers (2022) (0)
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer (2023) (0)
MO‐D‐351‐08: Analysis of the Effects of Multiple GEUD‐Type Constraints On Dose Distribution for IMRT Optimization (2008) (0)
Editorial (2008) (0)
Sustainable groundwater resources use through efficient allocation (2006) (0)
Chapter 3. Primal-Dual Algorithms for Linear Optimization Based on Self-Regular Proximities (2009) (0)
Preface: Seventh IMACS International Symposium on Iterative Methods in Scientific Computing May 5--8, 2005 The University of Toronto, Toronto, Ontario, Canada (2008) (0)
Chapter 2. Self-Regular Functions and Their Properties (2009) (0)
Optimal Composite Material Wing Design via Disjunctive Conic Cut (2019) (0)
Foreword (2010) (0)
The Iteration-Complexity Upper Bound for the Mizuno-Todd-Ye Predictor-Corrector Algorithm is Tight (2017) (0)
Controlling the dose distribution with gEUD-type constraints within the convex IMRT optimization framework (2007) (0)
Nonlinear Programming in Computer Aided Color Matching (1994) (0)

This paper list is powered by the following services:

Other Resources About Tamás Terlaky

What Schools Are Affiliated With Tamás Terlaky?

Tamás Terlaky is affiliated with the following schools:

Tamás Terlaky's Academic­Influence.com Rankings

Tamás Terlaky's Degrees

Why Is Tamás Terlaky Influential?

Tamás Terlaky's Published Works

Published Works

Other Resources About Tamás Terlaky

What Schools Are Affiliated With Tamás Terlaky?

Tamás Terlaky's AcademicInfluence.com Rankings