Tunel Levent

Levent Tunel

Information about the author Levent Tunel will soon be added to the site.
Found 14 papers in total
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime
2016
In 1976, Coffman and Sethi conjectured that a natural extension of LPT list scheduling...
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems
2012
We consider existence and uniqueness properties of a solution to homogeneous cone...
Strong duality and minimal representations for cone optimization
Strong duality and minimal representations for cone optimization
2012
The elegant theoretical results for strong duality and strict complementarity for...
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming
2011
In this paper we consider the linear symmetric cone programming (SCP). At a...
Lift-and-projrct ranks and antiblocker duality
Lift-and-projrct ranks and antiblocker duality
2005
We present a very short proof of the beautiful result of Aguilera et al . that the...
On the finite convergence of successive semidefinite programming relaxation methods
On the finite convergence of successive semidefinite programming relaxation methods
2002
Let F be a subset of the n -dimensional Euclidean space R n represented in terms of a...
On the Slater condition for the semidefinite programming relaxations of nonconvex sets
On the Slater condition for the semidefinite programming relaxations of nonconvex sets
2001
We prove that all results determining the dimension and the affine hull of feasible...
On the condition numbers for polyhedra in Karmarkar's form
On the condition numbers for polyhedra in Karmarkar's form
1999
We present formulations of two condition measures (one for linear programming (LP) due...
Characterization of the barrier parameter of homogeneous convex cones
Characterization of the barrier parameter of homogeneous convex cones
1998
We characterize the smallest (best) barrier parameter of self-concordant barriers for...
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
A constant-potential infeasible-start interior-point algorithm with computational experiments and applications
1998
We present a constant-potential infeasible-start interior-point (INFCP) algorithm for...
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
1997
We are motivated by the problem of constructing a primal–dual barrier function...
Constant potential primal-dual algorithms: A framework
Constant potential primal-dual algorithms: A framework
1994
The paper starts with a study of the primal-dual affine-scaling algorithms for linear...
A new triangulation for simplicial algorithms
A new triangulation for simplicial algorithms
1993
Triangulations are used in simplicial algorithms to find the fixed points of...
On the convexity of a function related to the Wagner-Whitin model
On the convexity of a function related to the Wagner-Whitin model
1992
The classical Economic Order Quantity (EOQ) model of Harris and Wilson exhibits a...
Papers per page: