Levent Tunçel
According to our database^{1},
Levent Tunçel
authored at least 75 papers
between 1992 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations.
SIAM J. Discret. Math., 2020
Math. Oper. Res., 2020
Approximation ratio of LD algorithm for multiprocessor scheduling and the CoffmanSethi conjecture.
Inf. Process. Lett., 2020
CoRR, 2020
2019
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP.
SIAM J. Optim., 2019
SIAM J. Optim., 2019
DomainDriven Solver (DDS): a MATLABbased Software Package for Convex Optimization Problems in DomainDriven Form.
CoRR, 2019
2018
J. Glob. Optim., 2018
Elementary polytopes with high liftandproject ranks for strong positive semidefinite operators.
Discret. Optim., 2018
2017
RAIRO Oper. Res., 2017
Math. Program., 2017
Math. Program., 2017
2016
Local Superlinear Convergence of PolynomialTime InteriorPoint Methods for Hyperbolicity Cone Optimization Problems.
SIAM J. Optim., 2016
SIAM J. Discret. Math., 2016
Worstcase performance analysis of some approximation algorithms for minimizing makespan and flowtime.
J. Sched., 2016
Perturbed sumsofsquares theorem for polynomial optimization and its applications.
Optim. Methods Softw., 2016
Math. Program., 2016
Comput. Oper. Res., 2016
2015
Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives.
SIAM J. Optim., 2015
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs.
Math. Program., 2015
Quantum and classical coinflipping protocols based on bitcommitment and their point games.
CoRR, 2015
2014
Some advances on LovászSchrijver semidefinite programming relaxations of the fractional stable set polytope.
Discret. Appl. Math., 2014
2013
Electron. Notes Discret. Math., 2013
WorstCase Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and FlowTime.
CoRR, 2013
Electron. J. Comb., 2013
2012
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.
Math. Program., 2012
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems.
J. Optim. Theory Appl., 2012
Comput. Optim. Appl., 2012
2011
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming.
J. Optim. Theory Appl., 2011
Electron. Notes Discret. Math., 2011
Some advances on LovászSchrijver N<sub>+</sub>(⋅) relaxations of the fractional stable set polytope.
Electron. Notes Discret. Math., 2011
Sufficient Conditions for Lowrank Matrix Recovery, Translated from Sparse Signal Recovery
CoRR, 2011
Comput. Optim. Appl., 2011
Complexity Analyses of BienstockZuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
2010
Found. Comput. Math., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Math. Comput., 2009
J. Comb. Theory, Ser. B, 2009
On the polyhedral liftandproject methods and the fractional stable set polytope.
Discret. Optim., 2009
Asia Pac. J. Oper. Res., 2009
2008
Optim. Methods Softw., 2008
Math. Program., 2008
Unification of lowerbound analyses of the liftandproject rank of combinatorial optimization polyhedra.
Discret. Appl. Math., 2008
2007
Math. Program., 2007
Comput. Optim. Appl., 2007
2005
Oper. Res. Lett., 2005
"Conefree" primaldual pathfollowing and potentialreduction polynomial time interiorpoint methods.
Math. Program., 2005
2004
Geometry of homogeneous convex cones, duality mapping, and optimal selfconcordant barriers.
Math. Program., 2004
2003
Math. Program., 2003
2002
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems.
J. Glob. Optim., 2002
Eur. J. Oper. Res., 2002
2001
Oper. Res. Lett., 2001
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001
Math. Program., 2001
Math. Oper. Res., 2001
Math. Oper. Res., 2001
Generalization of PrimalDual InteriorPoint Methods to Convex Optimization Problems in Conic Form.
Found. Comput. Math., 2001
2000
SIAM J. Optim., 2000
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
Math. Program., 2000
1999
Oper. Res. Lett., 1999
Math. Program., 1999
Math. Oper. Res., 1999
1998
Math. Program., 1998
PrimalDual Symmetry and Scale Invariance of InteriorPoint Algorithms for Convex Optimization.
Math. Oper. Res., 1998
A ConstantPotential InfeasibleStart InteriorPoint Algorithm with Computational Experiments and Applications.
Comput. Optim. Appl., 1998
1997
SIAM J. Optim., 1997
On the Interplay among Entropy, Variable Metrics and Potential Functions in InteriorPoint Algorithms.
Comput. Optim. Appl., 1997
1996
Asymptotic Behavior of InteriorPoint Methods: A View From SemiInfinite Programming.
Math. Oper. Res., 1996
1995
Comput. Optim. Appl., 1995
1994
Monotonicity of Primal and Dual Objective Values in Primaldual Interiorpoint Algorithms.
SIAM J. Optim., 1994
Math. Program., 1994
Algorithmica, 1994
1993
SIAM J. Discret. Math., 1993
Proceedings of the Cliques, 1993
1992
Oper. Res. Lett., 1992