Tamás Terlaky - Citegraph

Author Info

Name	Affiliation	Papers
TAMÁS TERLAKY	Advanced Optimization Laboratory, Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1 Canada Canada	68
Collaborators	Citations	PageRank
74	677	65.75
Referers	Referees	References
977	527	609

Search Limit

100977

Publications (68 rows)

Collaborators (74 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
On The Identification Of The Optimal Partition For Semidefinite Optimization	0	0.34	2020
On pathological disjunctions and redundant disjunctive conic cuts.	1	0.35	2018
The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections	0	0.34	2018
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization.	1	0.36	2017
András Prékopa 1929-2016.	0	0.34	2017
A novel unified approach to invariance conditions for a linear dynamical system.	0	0.34	2017
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.	1	0.37	2017
An Analogue of the Klee-Walkup Result for Sonnevend's Curvature of the Central Path.	0	0.34	2016
On the Identification of the Optimal Partition of Second Order Cone Optimization Problems.	5	0.46	2014
On families of quadratic surfaces having fixed intersections with two hyperplanes.	7	0.47	2013
Special issue in honour of Professor Kees Roos’ 70th Birthday	0	0.34	2013
Convex approximations in stochastic programming by semidefinite programming.	2	0.38	2012
On the volumetric path.	0	0.34	2012
Optimizing the gVERSE RF Pulse Sequence: An Evaluation of Two Competitive Software Algorithms.	0	0.34	2011
An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application	7	0.53	2011
Polynomial Interior Point Algorithms for General Linear Complementarity Problems	4	0.41	2010
A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity	18	0.76	2010
A polynomial path-following interior point algorithm for general linear complementarity problems	10	0.65	2010
A Hybrid Adaptive Algorithm for Linear Optimization	1	0.41	2009
Self-adaptive support vector machines: modelling and experiments	4	0.47	2009
A Continuous d-Step Conjecture for Polytopes	5	0.55	2009
A confidence voting process for ranking problems based on support vector machines	6	0.47	2009
Comments on "Dual methods for nonconvex spectrum optimization of multicarrier systems".	3	0.40	2008
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region	0	0.34	2008
How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds	11	0.95	2008
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function	2	0.39	2008
The colourful feasibility problem	10	0.76	2008
17th EURO Mini Conference "Continuous Optimization in the Industry", Pécs, Hungary, June 29-July 1, 2005	0	0.34	2008
Polytopes and arrangements: Diameter and curvature	8	0.80	2008
Diameter and Curvature: Intriguing Analogies	1	0.38	2008
Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization.	6	0.66	2008
Mehrotra-type predictor-corrector algorithm revisited	4	0.46	2008
Packing Trees in Communication Networks	1	0.35	2008
A simpler and tighter redundant Klee-Minty construction	2	0.44	2008
On routing in VLSI design and communication networks	8	0.58	2008
Challenges of Continuous Optimization in Theory and Applications	0	0.34	2007
Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms	5	0.61	2007
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors	9	1.00	2007
A Survey of the S-Lemma.	135	6.40	2007
Colourful Simplicial Depth	11	1.26	2006
Feature Cluster "Advances in Continuous Optimization	0	0.34	2006
Sensitivity analysis in linear optimization: Invariant support set intervals	21	1.17	2006
The central path visits all the vertices of the Klee–Minty cube	6	0.79	2006
The Complexity of Self-Regular Proximity Based Infeasible IPMs	7	0.57	2006
The gVERSE RF Pulse: An Optimal Approach to MRI Pulse Design.	0	0.34	2006
An adaptive self-regular proximity-based large-update IPM for LO	1	0.37	2005
A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function	14	1.12	2005
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001)	1	0.40	2004
On implementing a primal-dual interior-point method for conic quadratic optimization	88	3.81	2003
Book Review: Computational Techniques of the Simplex Method	0	0.34	2003

1
2
50 / page