Terlaky Tams

Tams Terlaky

Information about the author Tams Terlaky will soon be added to the site.
Found 30 papers in total
On the volumetric path
On the volumetric path
2012
We consider the logarithmic and the volumetric barrier functions used in interior...
Convex approximations in stochastic programming by semidefinite programming
Convex approximations in stochastic programming by semidefinite programming
2012
The following question arises in stochastic programming: how can one approximate a...
Bi-parametric convex quadratic optimization
Bi-parametric convex quadratic optimization
2010
In this paper, we consider the convex quadratic optimization problem with simultaneous...
A polynomial path-following interior point algorithm for general linear complementarity problems
A polynomial path-following interior point algorithm for general linear complementarity problems
2010
Linear Complementarity Problems ( LCP s) belong to the class of NP -complete problems....
A redundant Klee–Minty construction with all the redundant constraints touching the feasible region
A redundant Klee–Minty construction with all the redundant constraints touching the feasible region
2008
We have previously shown, by redundant Klee–Minty constructions, that the...
A confidence voting process for ranking problems based on support vector machines
A confidence voting process for ranking problems based on support vector machines
2009
In this paper, we deal with ranking problems arising from various data mining...
Packing trees in communication networks
Packing trees in communication networks
2008
Given an undirected edge–capacitated graph and given (possibly) different...
Polytopes and arrangements: Diameter and curvature
Polytopes and arrangements: Diameter and curvature
2008
We introduce a continuous analogue of the Hirsch conjecture and a discrete analogue of...
Interior point methods with self-regular proximities
Interior point methods with self-regular proximities
2005
An interesting problem in the theory of interior point methods is the investigation of...
Sensitivity analysis in linear and convex quadratic optimization: invariant active constraint set and invariant set intervals
Sensitivity analysis in linear and convex quadratic optimization: invariant active constraint set and invariant set intervals
2006
Support set invariancy sensitivity analysis is concerned with finding the range of...
Sensitivity analysis in linear optimization: Invariant support set intervals
Sensitivity analysis in linear optimization: Invariant support set intervals
2006
Sensitivity analysis is one of the most interesting and preoccupying areas in...
The central path visits all the vertices of the Klee–Minty cube
The central path visits all the vertices of the Klee–Minty cube
2006
The Klee–Minty cube is a well-known worst-case example for which the simplex...
Note on a paper of Broyden
Note on a paper of Broyden
1999
Recently, Broyden proved a property of orthogonal matrices from which he derived...
Reloading nuclear reactor fuel using mixed-integer nonlinear optimization
Reloading nuclear reactor fuel using mixed-integer nonlinear optimization
2001
A nodal nuclear reactor reload pattern optimization model is solved using...
Dynamic large-update primal–dual interior-point method for linear optimization
Dynamic large-update primal–dual interior-point method for linear optimization
2002
Primal–dual interior-point methods (IPMs) have shown their power in solving...
A new class of polynomial primal–dual methods for linear and semidefinite optimization
A new class of polynomial primal–dual methods for linear and semidefinite optimization
2002
We propose a new class of primal–dual methods for linear optimization (LO). By...
Pivot versus interior point methods: Pros and cons
Pivot versus interior point methods: Pros and cons
2002
Linear optimization (LO) is the fundamental problem of mathematical optimization. It...
An easy way to teach interior-point methods
An easy way to teach interior-point methods
2001
In this paper the duality theory of Linear Optimization (LO) is built up based on...
Basis- and partition identification for quadratic programming and linear complementarity problems
Basis- and partition identification for quadratic programming and linear complementarity problems
1999
Optimal solutions of interior point algorithms for linear and quadratic programming...
The finite criss-cross method for hyperbolic programming
The finite criss-cross method for hyperbolic programming
1999
In this paper the finite criss-cross method is generalized to solve hyperbolic...
The finite criss-cross method for hyperbolic programming
The finite criss-cross method for hyperbolic programming
1996
In this paper the finite criss-cross method is generalized to solve hyperbolic...
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
Polynomiality of primal–dual affine scaling algorithms for nonlinear complementarity problems
1997
This paper provides an analysis of the polynomiality of primal–dual interior...
Criss-cross methods: A fresh view on pivot algorithms
Criss-cross methods: A fresh view on pivot algorithms
1997
Criss-cross methods are pivot algorithms that solve linear programming problems in one...
A nonconvex weighted potential function for polynomial target following methods
A nonconvex weighted potential function for polynomial target following methods
1998
Long step interior-point methods in linear programming are some of the most efficient...
Papers per page: