Terlaky, Tamás.
Terlaky, Tamás, 1955-
Terlaky, T. (Tamás)
Terlaky, T.
Tamás Terlaky Hungarian mathematician
VIAF ID: 95208538 ( Personal )
Permalink: http://viaf.org/viaf/95208538
Preferred Forms
- 100 0 _ ‡a Tamás Terlaky ‡c Hungarian mathematician
-
- 100 1 _ ‡a Terlaky, T.
- 100 1 _ ‡a Terlaky, T.
-
- 100 1 _ ‡a Terlaky, Tamas
-
-
- 100 1 0 ‡a Terlaky, Tamás
- 100 1 _ ‡a Terlaky, Tamás
-
- 100 1 _ ‡a Terlaky, Tamás
-
-
-
-
-
4xx's: Alternate Name Forms (22)
5xx's: Related Names (4)
- 510 2 _ ‡a Eötvös Loránd Tudományegyetem ‡g Budapest ‡b Department of Operations Research ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Erasmus Universiteit Rotterdam ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Lehigh University ‡b Department of Industrial and Systems Engineering ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a McMaster University ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Advances and trends in optimization with engineering applications | |
Advances in linear optimization : (annotated bibliography) | |
A belsőpontos módszerek elméletének egy elemi tárgyalása | |
Computing maximum likelihood estimators of convex density functions | |
Egy véges criss-cross módszer és alkalmazásai, 1986: | |
The finite criss-cross method for hyperbolic programming | |
Initialization in semidefinite programming via a self-dual skew-symmetric embedding | |
Interior point methods of mathematical programming | |
Inverse barriers and CES-functions in linear programming | |
Iri's polynomiality proof for the IRI-IMAI method recast | |
The linear complementarity problem, sufficient matrices and the criss-cross method | |
Modeling and Optimization: Theory and Applications : MOPTA, Bethlehem, PA, USA, August 2016 Selected Contributions | |
A monotonic build-up simplex algorithm for linear programming | |
MOPTA | |
Nemlineáris optimalizálás | |
A new algorithm for the computation of the smallest eigenvalue of a symmetric matrix and its eigenspace | |
A new approach to the colour matching problem | |
New complexity analysis of primal-dual method for semidefinite optimization based on the NT-direction | |
A nonconvex weighted potential function for polynomial target following methods | |
Nonlinear Optimization : Lectures given at the C.I.M.E. Summer School held in Cetraro, Italy, July 1-7, 2007 | |
A note on Mascarenhas' counter example about global convergence of the affine scaling algorithm | |
On maximization of quadratic form over intersection of ellipsoids with common center | |
On the classical logarithmic barrier function method for a class of smooth convex programming problems | |
On the existence of a short admissible pivot sequences for feasib[i]lity and linear optimization problems | |
The optimal set and optimal partition approach to linear and quadratic programming | |
A polynomial method of weighted centers for convex quadratic programming | |
Polynomial primal-dual affine scaling algorithms in semidefinite programming | |
A potential reduction variant of renegar's short-step path-following method for linear programming | |
Proceedings of the Stieltjes Workshop on High Performance Optimization Techniques (HPOPT '96) September 19-20, 1996, Delft, Netherlands | |
Self-regularity : a new paradigm for primal-dual interior-point algorithms | |
Semi-definite problems in truss topology optimization | |
A short survey on ten years interior point methods | |
A survey on pivot rules for linear programming | |
Theory and algorithms for linear optimization : an interior point approach | |
The theory of linear programming: skew symmetric self-dual problems and the central path |