Levent Tunçel

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 33

Top Topics

Approximation Algorithms

Optimization Problems

Top Venues

SIAM J. Discret. Math.

Publications

Mehdi Karimi, Levent Tunçel
Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form. Math. Program. Comput. 16 (1) (2024)
Yu Hin Au, Levent Tunçel
On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy. CoRR (2024)
Julian Romero, Levent Tunçel
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz. SIAM J. Discret. Math. 38 (3) (2024)
Nathan Benedetto Proença, Marcel K. de Carli Silva, Cristiane M. Sato, Levent Tunçel
Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm. CoRR (2024)
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Total dual dyadicness and dyadic generating sets. Math. Program. 206 (1) (2024)
Levent Tunçel, Lieven Vandenberghe
Linear optimization over homogeneous matrix cones. Acta Numer. 32 (2023)
Yu Hin Au, Levent Tunçel
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator. CoRR (2023)
Mehdi Karimi, Levent Tunçel
Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy. CoRR (2023)
Nathan Benedetto Proença, Marcel Kenji de Carli Silva, Cristiane M. Sato, Levent Tunçel
A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem. CoRR (2023)
Mehdi Karimi, Levent Tunçel
Status determination by interior-point methods for convex optimization problems in domain-driven form. Math. Program. 194 (1) (2022)
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Total Dual Dyadicness and Dyadic Generating Sets. IPCO (2022)
Levent Tunçel, Lieven Vandenberghe
Linear optimization over homogeneous matrix cones. CoRR (2022)
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Clean Clutters and Dyadic Fractional Packings. SIAM J. Discret. Math. 36 (2) (2022)
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Testing idealness in the filter oracle model. Oper. Res. Lett. 50 (6) (2022)
Yu Hin Au, Nathan Lindzey, Levent Tunçel
Matchings, hypergraphs, association schemes, and semidefinite optimization. CoRR (2020)
Peruvemba Sundaram Ravi, Levent Tunçel
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture. Inf. Process. Lett. (2020)
Marcel Kenji de Carli Silva, Levent Tunçel
A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations. SIAM J. Discret. Math. 34 (1) (2020)
Mehdi Karimi, Levent Tunçel
Primal-Dual Interior-Point Methods for Domain-Driven Formulations. Math. Oper. Res. 45 (2) (2020)
Marcel Kenji de Carli Silva, Levent Tunçel
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP. SIAM J. Optim. 29 (4) (2019)
Vera Roshchina, Levent Tunçel
Facially Dual Complete (Nice) Cones and Lexicographic Tangents. SIAM J. Optim. 29 (3) (2019)
Mehdi Karimi, Levent Tunçel
Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form. CoRR (2019)
Yu Hin (Gary) Au, Levent Tunçel
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. Discret. Optim. 27 (2018)
Mehdi Karimi, Somayeh Moazeni, Levent Tunçel
A Utility Theory Based Interactive Approach to Robustness in Linear Optimization. J. Glob. Optim. 70 (4) (2018)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. Math. Program. 162 (1-2) (2017)
Marcel Kenji de Carli Silva, Levent Tunçel
An axiomatic duality framework for the theta body and related convex corners. Math. Program. 162 (1-2) (2017)
Mehdi Karimi, Shen Luo, Levent Tunçel
Primal-dual entropy-based interior-point algorithms for linear optimization. RAIRO Oper. Res. 51 (2) (2017)
Yu Hin Au, Levent Tunçel
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. SIAM J. Discret. Math. 30 (1) (2016)
Masakazu Muramatsu, Hayato Waki, Levent Tunçel
Perturbed sums-of-squares theorem for polynomial optimization and its applications. Optim. Methods Softw. 31 (1) (2016)
Yu Hin Au, Levent Tunçel
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. CoRR (2016)
Tor G. J. Myklebust, M. A. Sharpe, Levent Tunçel
Efficient heuristic algorithms for maximum utility product pricing problems. Comput. Oper. Res. 69 (2016)
Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang
Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime. J. Sched. 19 (5) (2016)
Yurii E. Nesterov, Levent Tunçel
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems. SIAM J. Optim. 26 (1) (2016)
Ashwin Nayak, Jamie Sikora, Levent Tunçel
A search for quantum coin-flipping protocols using optimization techniques. Math. Program. 156 (1-2) (2016)
Yogesh Awate, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. Math. Program. 150 (2) (2015)
Marcel Kenji de Carli Silva, Levent Tunçel
Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives. SIAM J. Optim. 25 (1) (2015)
Ashwin Nayak, Jamie Sikora, Levent Tunçel
Quantum and classical coin-flipping protocols based on bit-commitment and their point games. CoRR (2015)
Peruvemba Sundaram Ravi, Levent Tunçel
Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture. CoRR (2015)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. CoRR (2014)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. Discret. Appl. Math. 164 (2014)
Ashwin Nayak, Jamie Sikora, Levent Tunçel
A search for quantum coin-flipping protocols using optimization techniques. CoRR (2014)
Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang
Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time. CoRR (2013)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. Electron. Notes Discret. Math. 44 (2013)
Marcel Kenji de Carli Silva, Levent Tunçel
Optimization Problems over Unit-Distance Representations of Graphs. Electron. J. Comb. 20 (1) (2013)
Yu Hin Au, Levent Tunçel
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. CoRR (2013)
Lingchen Kong, Levent Tunçel, Naihua Xiu
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems. J. Optim. Theory Appl. 153 (2) (2012)
Levent Tunçel, Henry Wolkowicz
Strong duality and minimal representations for cone optimization. Comput. Optim. Appl. 53 (2) (2012)
Lingchen Kong, Levent Tunçel, Naihua Xiu
Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems. Math. Program. 133 (1-2) (2012)
Lingchen Kong, Levent Tunçel, Naihua Xiu
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming. J. Optim. Theory Appl. 148 (2) (2011)
Romy Shioda, Levent Tunçel, Tor G. J. Myklebust
Maximum utility product pricing models and algorithms based on reservation price. Comput. Optim. Appl. 48 (2) (2011)
Yu Hin Au, Levent Tunçel
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. IPCO (2011)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
(G). Electron. Notes Discret. Math. 37 (2011)
Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel
(⋅) relaxations of the fractional stable set polytope. Electron. Notes Discret. Math. 37 (2011)
Lingchen Kong, Levent Tunçel, Naihua Xiu
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery CoRR (2011)
Levent Tunçel, Arkadi Nemirovski
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets. Found. Comput. Math. 10 (5) (2010)
Lingchen Kong, Levent Tunçel, Naihua Xiu
Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems. Asia Pac. J. Oper. Res. 26 (2) (2009)
Levent Tunçel
Optimization algorithms on matrix manifolds. Math. Comput. 78 (266) (2009)
Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
Lehman matrices. J. Comb. Theory, Ser. B 99 (3) (2009)
Yu Hin Au, Levent Tunçel
On the polyhedral lift-and-project methods and the fractional stable set polytope. Discret. Optim. 6 (2) (2009)
Chek Beng Chua, Levent Tunçel
Invariance and efficiency of convex representations. Math. Program. 111 (1-2) (2008)
Marina Potaptchik, Levent Tunçel, Henry Wolkowicz
Large scale portfolio optimization with piecewise linear transaction costs. Optim. Methods Softw. 23 (6) (2008)
Sung-Pil Hong, Levent Tunçel
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. Discret. Appl. Math. 156 (1) (2008)
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) (2007)
Romy Shioda, Levent Tunçel
Clustering via minimum volume ellipsoids. Comput. Optim. Appl. 37 (3) (2007)
Arkadi Nemirovski, Levent Tunçel
"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods. Math. Program. 102 (2) (2005)
László Lipták, Levent Tunçel
Lift-and-project ranks and antiblocker duality. Oper. Res. Lett. 33 (1) (2005)
Van-Anh Truong, Levent Tunçel
Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. Math. Program. 100 (2) (2004)
László Lipták, Levent Tunçel
The stable set problem and the lift-and-project ranks of graphs. Math. Program. 98 (1-3) (2003)
Masakazu Kojima, Levent Tunçel
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. J. Glob. Optim. 24 (3) (2002)
Masakazu Kojima, Levent Tunçel
On the finite convergence of successive SDP relaxation methods. Eur. J. Oper. Res. 143 (2) (2002)
Gábor Pataki, Levent Tunçel
On the generic properties of convex optimization problems in conic form. Math. Program. 89 (3) (2001)
Levent Tunçel
Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form. Found. Comput. Math. 1 (3) (2001)
Levent Tunçel, Song Xu
On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping. Math. Oper. Res. 26 (2) (2001)
Michel X. Goemans, Levent Tunçel
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? Math. Oper. Res. 26 (4) (2001)
Levent Tunçel
On the Slater condition for the SDP relaxations of nonconvex sets. Oper. Res. Lett. 29 (4) (2001)
Michael J. Todd, Levent Tunçel, Yinyu Ye
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90 (1) (2001)
Masakazu Kojima, Levent Tunçel
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. Math. Program. 89 (1) (2000)
Masakazu Kojima, Levent Tunçel
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. SIAM J. Optim. 10 (3) (2000)
Levent Tunçel
On the condition numbers for polyhedra in Karmarkar's form. Oper. Res. Lett. 24 (4) (1999)
Tamon Stephen, Levent Tunçel
On a Representation of the Matching Polytope Via Semidefinite Liftings. Math. Oper. Res. 24 (1) (1999)
Levent Tunçel
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86 (1) (1999)
Osman Güler, Levent Tunçel
Characterization of the barrier parameter of homogeneous convex cones. Math. Program. 81 (1998)
Levent Tunçel
Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization. Math. Oper. Res. 23 (3) (1998)
Abbas Seifi, Levent Tunçel
A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications. Comput. Optim. Appl. 9 (2) (1998)
Motakuri V. Ramana, Levent Tunçel, Henry Wolkowicz
Strong Duality for Semidefinite Programming. SIAM J. Optim. 7 (3) (1997)
Levent Tunçel, Michael J. Todd
On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms. Comput. Optim. Appl. 8 (1) (1997)
Levent Tunçel, Michael J. Todd
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming. Math. Oper. Res. 21 (2) (1996)
Levent Tunçel
On the convergence of primal-dual interior-point methods with wide neighborhoods. Comput. Optim. Appl. 4 (2) (1995)
Shinji Mizuno, Michael J. Todd, Levent Tunçel
Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms. SIAM J. Optim. 4 (3) (1994)
Levent Tunçel
On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. Algorithmica 11 (4) (1994)
Levent Tunçel
Constant potential primal-dual algorithms: A framework. Math. Program. 66 (1994)
Michael J. Todd, Levent Tunçel
A New Triangulation for Simplicial Algorithms. SIAM J. Discret. Math. 6 (1) (1993)
Joseph Cheriyan, William H. Cunningham, Levent Tunçel, Yaoguang Wang
A linear programming and rounding approach to max 2-sat. Cliques, Coloring, and Satisfiability (1993)
Levent Tunçel, Peter L. Jackson
On the convexity of a function related to the Wagner-Whitin model. Oper. Res. Lett. 11 (4) (1992)