Tunel L.

L. Tunel

Information about the author L. Tunel will soon be added to the site.
Found 6 papers in total
The stable set problem and the lift-and-project ranks of graphs
The stable set problem and the lift-and-project ranks of graphs
2003
We study the lift-and-project procedures for solving combinatorial optimization...
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
2001
This note studies -->χ --> A , a condition number used in the linear programming...
On the generic properties of convex optimization problems in conic form
On the generic properties of convex optimization problems in conic form
2001
We prove that strict complementarity, primal and dual nondegeneracy of optimal...
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
2000
Based on the authors' previous work which established theoretical foundations of two,...
Approximating the complexity measure of Vavasis–Ye algorithm is NP-hard
Approximating the complexity measure of Vavasis–Ye algorithm is NP-hard
1999
Given an m × n integer matrix A of full row rank, we consider the problem of...
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
1998
We present primal–dual interior-point algorithms with polynomial iteration...
Papers per page: