 | 2009 |
|---|
| 19 |       | Levent Tunçel:
Interior Point Methods for Semidefinite Programming.
Encyclopedia of Optimization 2009: 1679-1683 |
| 18 | | Lingchen Kong,
Levent Tunçel,
Naihua Xiu:
Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems.
APJOR 26(2): 199-233 (2009) |
| 17 | | Yu-Hin Au,
Levent Tunçel:
On the polyhedral lift-and-project methods and the fractional stable set polytope.
Discrete Optimization 6(2): 206-213 (2009) |
| 2008 |
|---|
| 16 | | Sung-Pil Hong,
Levent Tunçel:
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
Discrete Applied Mathematics 156(1): 25-41 (2008) |
| 15 | | Chek Beng Chua,
Levent Tunçel:
Invariance and efficiency of convex representations.
Math. Program. 111(1-2): 113-140 (2008) |
| 2007 |
|---|
| 14 | | Erling S. Andersen,
Etienne de Klerk,
Levent Tunçel,
Henry Wolkowicz,
Shuzhong Zhang:
Foreword: Special issue on large-scale nonlinear and semidefinite programming.
Math. Program. 109(2-3): 207-209 (2007) |
| 2005 |
|---|
| 13 | | Arkadi Nemirovski,
Levent Tunçel:
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Math. Program. 102(2): 261-294 (2005) |
| 12 | | László Lipták,
Levent Tunçel:
Lift-and-project ranks and antiblocker duality.
Oper. Res. Lett. 33(1): 35-41 (2005) |
| 2004 |
|---|
| 11 | | Van Anh Truong,
Levent Tunçel:
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers.
Math. Program. 100(2): 295-316 (2004) |
| 2002 |
|---|
| 10 | | Masakazu Kojima,
Levent Tunçel:
On the finite convergence of successive SDP relaxation methods.
European Journal of Operational Research 143(2): 325-341 (2002) |
| 2001 |
|---|
| 9 | | Levent Tunçel:
Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form.
Foundations of Computational Mathematics 1(3): 229-254 (2001) |
| 8 | | Levent Tunçel,
Song Xu:
On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping.
Math. Oper. Res. 26(2): 234-247 (2001) |
| 7 | | Michel X. Goemans,
Levent Tunçel:
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Math. Oper. Res. 26(4): 796-815 (2001) |
| 6 | | Levent Tunçel:
On the Slater condition for the SDP relaxations of nonconvex sets.
Oper. Res. Lett. 29(4): 181-186 (2001) |
| 1999 |
|---|
| 5 | | Levent Tunçel:
On the condition numbers for polyhedra in Karmarkar's form.
Oper. Res. Lett. 24(4): 149-155 (1999) |
| 1998 |
|---|
| 4 |  | Osman Güler,
Levent Tunçel:
Characterization of the barrier parameter of homogeneous convex cones.
Math. Program. 81: 55-76 (1998) |
| 1994 |
|---|
| 3 | | Levent Tunçel:
On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.
Algorithmica 11(4): 353-359 (1994) |
| 2 | | Levent Tunçel:
Constant potential primal-dual algorithms: A framework.
Math. Program. 66: 145-159 (1994) |
| 1993 |
|---|
| 1 | | Michael J. Todd,
Levent Tunçel:
A New Triangulation for Simplicial Algorithms.
SIAM J. Discrete Math. 6(1): 167-180 (1993) |
