Terlaky T.

T. Terlaky

Information about the author T. Terlaky will soon be added to the site.
Found 21 papers in total
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors
Sensitivity analysis in convex quadratic optimization: Simultaneous perturbation of the objective and right-hand-side vectors
2007
In this paper we study the behavior of Convex Quadratic Optimization problems when...
Active constraint set invariancy sensitivity analysis in linear optimization
Active constraint set invariancy sensitivity analysis in linear optimization
2007
Active constraint set invariancy sensitivity analysis is concerned with finding the...
A polynomial primal–dual Dikin-type algorithm for linear programming
A polynomial primal–dual Dikin-type algorithm for linear programming
1996
In this paper we present a new primal–dual affine scaling method for linear...
On implementing a primal–dual interior-point method for conic quadratic optimization
On implementing a primal–dual interior-point method for conic quadratic optimization
2003
Based on the work of the Nesterov and Todd on self-scaled cones an implementation of a...
Self-regular functions and new search directions for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
2002
In this paper, we introduce the notion of a self-regular function. Such a function is...
New complexity analysis of the primal–dual Newton method for linear optimization
New complexity analysis of the primal–dual Newton method for linear optimization
2000
We deal with the primal–dual Newton method for linear optimization (LO)....
New complexity analysis of the primal–dual method for semidefinite optimization based on the Nesterov–Todd direction
New complexity analysis of the primal–dual method for semidefinite optimization based on the Nesterov–Todd direction
2001
Interior-point methods for semidefinite optimization have been studied intensively in...
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics
2000
A simplified but still quite realistic model of the nuclear reactor fuel management...
Potential reduction algorithms for structured combinatorial optimization problems
Potential reduction algorithms for structured combinatorial optimization problems
1997
Recently Karmarkar proposed a potential reduction algorithm for binary feasibility...
Sensitivity analysis in linear programming: Just be careful!
Sensitivity analysis in linear programming: Just be careful!
1997
In this paper we review the topic of sensitivity analysis in linear programming. We...
Inverse barriers and CES-functions in linear programming
Inverse barriers and CES-functions in linear programming
1997
Recently, much attention was paid to polynomial interior point methods, almost...
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
Improved complexity using higher-order correctors for primal–dual Dikin affine scaling
1997
In this paper we show that the primal–dual Dikin affine scaling algorithm for...
Optimization of nuclear reactor reloading patterns
Optimization of nuclear reactor reloading patterns
1997
The loading pattern of fuel bundles in a reactor core determines the characteristics...
Primal-dual target-following algorithms for linear programming
Primal-dual target-following algorithms for linear programming
1996
In this paper, the authors propose a method for linear programming with the property...
Inverse barrier methods for linear programming
Inverse barrier methods for linear programming
1994
In the recent interior point methods for linear programming much attention has been...
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
1995
Recently a number of papers were written that present low-complexity interior-point...
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
A survey of the implications of the behavior of the central path for the duality theory of Linear Programming
1995
The literature in the field of interior point methods for Linear Programming has been...
A logarithmic barrier cutting plane method for convex programming
A logarithmic barrier cutting plane method for convex programming
1995
The paper presents a logarithmic barrier cutting plane algorithm for convex (possibly...
Degeneracy in Interior Point Methods for linear programming: A survey
Degeneracy in Interior Point Methods for linear programming: A survey
1993
The publication of Karmarkar’s paper has resulted in intense research activity...
A build-up variant of the logarithmic barrier method for LP
A build-up variant of the logarithmic barrier method for LP
1992
The authors propose a strategy for building up the linear program while using a...
A polynomial method of weighted centers for convex quadratic programming
A polynomial method of weighted centers for convex quadratic programming
1991
A generalization of the weighted central path-following method for convex quadratic...
Papers per page: