Levent Tunçel
Orcid: 0000-0001-5071-216XAffiliations:
- University of Waterloo, Department of Combinatorics and Optimization
According to our database1,
Levent Tunçel
authored at least 85 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form.
Math. Program. Comput., 2024
On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy.
CoRR, 2024
2023
CoRR, 2023
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem.
CoRR, 2023
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator.
CoRR, 2023
2022
Status determination by interior-point methods for convex optimization problems in domain-driven form.
Math. Program., 2022
Proceedings of the Integer Programming and Combinatorial Optimization, 2022
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 multi-processor scheduling and the Coffman-Sethi conjecture.
Inf. Process. Lett., 2020
CoRR, 2020
2019
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP.
SIAM J. Optim., 2019
Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form.
CoRR, 2019
2018
J. Glob. Optim., 2018
Elementary polytopes with high lift-and-project 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 Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems.
SIAM J. Optim., 2016
SIAM J. Discret. Math., 2016
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime.
J. Sched., 2016
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 coin-flipping protocols based on bit-commitment and their point games.
CoRR, 2015
2014
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope.
Discret. Appl. Math., 2014
2013
Electron. Notes Discret. Math., 2013
Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time.
CoRR, 2013
Electron. J. Comb., 2013
2012
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.
Math. Program., 2012
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ász-Schrijver N<sub>+</sub>(⋅) relaxations of the fractional stable set polytope.
Electron. Notes Discret. Math., 2011
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery
CoRR, 2011
Comput. Optim. Appl., 2011
Complexity Analyses of Bienstock-Zuckerberg 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
Discret. Optim., 2009
Asia Pac. J. Oper. Res., 2009
2008
Optim. Methods Softw., 2008
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
Discret. Appl. Math., 2008
2007
Math. Program., 2007
2005
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Math. Program., 2005
2004
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant 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 Primal-Dual Interior-Point 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
Math. Program., 1999
Math. Oper. Res., 1999
1998
Math. Program., 1998
Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization.
Math. Oper. Res., 1998
A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications.
Comput. Optim. Appl., 1998
1997
On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms.
Comput. Optim. Appl., 1997
1996
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming.
Math. Oper. Res., 1996
1995
Comput. Optim. Appl., 1995
1994
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms.
SIAM J. Optim., 1994
Algorithmica, 1994
1993
Proceedings of the Cliques, 1993
1992
Oper. Res. Lett., 1992