On the convexity of a function related to the Wagner-Whitin model. - Levent Tunçel; Peter L. Jackson (Oper. Res. Lett., 1992)

A linear programming and rounding approach to max 2-sat. - Joseph Cheriyan; William H. Cunningham; Levent Tunçel; Yaoguang Wang (Cliques, Coloring, and Satisfiability, 1993)

A New Triangulation for Simplicial Algorithms. - Michael J. Todd; Levent Tunçel (SIAM J. Discret. Math., 1993)

On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. - Levent Tunçel (Algorithmica, 1994)

Constant potential primal-dual algorithms: A framework. - Levent Tunçel (Math. Program., 1994)

Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms. - Shinji Mizuno; Michael J. Todd; Levent Tunçel (SIAM J. Optim., 1994)

On the convergence of primal-dual interior-point methods with wide neighborhoods. - Levent Tunçel (Comput. Optim. Appl., 1995)

Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming. - Levent Tunçel; Michael J. Todd (Math. Oper. Res., 1996)

On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms. - Levent Tunçel; Michael J. Todd (Comput. Optim. Appl., 1997)

Strong Duality for Semidefinite Programming. - Motakuri V. Ramana; Levent Tunçel; Henry Wolkowicz (SIAM J. Optim., 1997)

A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications. - Abbas Seifi; Levent Tunçel (Comput. Optim. Appl., 1998)

Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization. - Levent Tunçel (Math. Oper. Res., 1998)

Characterization of the barrier parameter of homogeneous convex cones. - Osman Güler; Levent Tunçel (Math. Program., 1998)

On a Representation of the Matching Polytope Via Semidefinite Liftings. - Tamon Stephen; Levent Tunçel (Math. Oper. Res., 1999)

Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. - Levent Tunçel (Math. Program., 1999)

On the condition numbers for polyhedra in Karmarkar's form. - Levent Tunçel (Oper. Res. Lett., 1999)

Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. - Masakazu Kojima; Levent Tunçel (Math. Program., 2000)

Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. - Masakazu Kojima; Levent Tunçel (SIAM J. Optim., 2000)

Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form. - Levent Tunçel (Found. Comput. Math., 2001)

When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? - Michel X. Goemans; Levent Tunçel (Math. Oper. Res., 2001)

On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping. - Levent Tunçel; Song Xu 001 (Math. Oper. Res., 2001)

On the generic properties of convex optimization problems in conic form. - Gábor Pataki; Levent Tunçel (Math. Program., 2001)

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. - Michael J. Todd; Levent Tunçel; Yinyu Ye 001 (Math. Program., 2001)

On the Slater condition for the SDP relaxations of nonconvex sets. - Levent Tunçel (Oper. Res. Lett., 2001)

On the finite convergence of successive SDP relaxation methods. - Masakazu Kojima; Levent Tunçel (Eur. J. Oper. Res., 2002)

Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. - Masakazu Kojima; Levent Tunçel (J. Glob. Optim., 2002)

The stable set problem and the lift-and-project ranks of graphs. - László Lipták; Levent Tunçel (Math. Program., 2003)

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers. - Van-Anh Truong; Levent Tunçel (Math. Program., 2004)

"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods. - Arkadi Nemirovski; Levent Tunçel (Math. Program., 2005)

Lift-and-project ranks and antiblocker duality. - László Lipták; Levent Tunçel (Oper. Res. Lett., 2005)

Clustering via minimum volume ellipsoids. - Romy Shioda; Levent Tunçel (Comput. Optim. Appl., 2007)

Foreword: Special issue on large-scale nonlinear and semidefinite programming. - Erling S. Andersen; Etienne de Klerk; Levent Tunçel; Henry Wolkowicz; Shuzhong Zhang (Math. Program., 2007)

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. - Sung-Pil Hong; Levent Tunçel (Discret. Appl. Math., 2008)

Invariance and efficiency of convex representations. - Chek Beng Chua; Levent Tunçel (Math. Program., 2008)

Large scale portfolio optimization with piecewise linear transaction costs. - Marina Potaptchik; Levent Tunçel; Henry Wolkowicz (Optim. Methods Softw., 2008)

Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems. - Lingchen Kong; Levent Tunçel; Naihua Xiu (Asia Pac. J. Oper. Res., 2009)

On the polyhedral lift-and-project methods and the fractional stable set polytope. - Yu Hin Au; Levent Tunçel (Discret. Optim., 2009)

Lehman matrices. - Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (J. Comb. Theory B, 2009)

Optimization algorithms on matrix manifolds. - Levent Tunçel (Math. Comput., 2009)

Interior Point Methods for Semidefinite Programming. - Levent Tunçel (Encyclopedia of Optimization, 2009)

Self-Concordant Barriers for Convex Approximations of Structured Convex Sets. - Levent Tunçel; Arkadi Nemirovski (Found. Comput. Math., 2010)

Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. - Yu Hin Au; Levent Tunçel (IPCO, 2011)

Maximum utility product pricing models and algorithms based on reservation price. - Romy Shioda; Levent Tunçel; Tor G. J. Myklebust (Comput. Optim. Appl., 2011)

Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery - Lingchen Kong; Levent Tunçel; Naihua Xiu (CoRR, 2011)

Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Near-perfect graphs with polyhedral N+(G). - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2011)

Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming. - Lingchen Kong; Levent Tunçel; Naihua Xiu (J. Optim. Theory Appl., 2011)

Strong duality and minimal representations for cone optimization. - Levent Tunçel; Henry Wolkowicz (Comput. Optim. Appl., 2012)

Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems. - Lingchen Kong; Levent Tunçel; Naihua Xiu (J. Optim. Theory Appl., 2012)

Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems. - Lingchen Kong; Levent Tunçel; Naihua Xiu (Math. Program., 2012)

Optimization Problems over Unit-Distance Representations of Graphs. - Marcel Kenji de Carli Silva; Levent Tunçel (Electron. J. Comb., 2013)

Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time. - Peruvemba Sundaram Ravi; Levent Tunçel; Michael Huang (CoRR, 2013)

Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Electron. Notes Discret. Math., 2013)

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Discret. Appl. Math., 2014)

Quantum and classical coin-flipping protocols based on bit-commitment and their point games. - Ashwin Nayak 001; Jamie Sikora; Levent Tunçel (CoRR, 2015)

On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs. - Yogesh Awate; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2015)

Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives. - Marcel Kenji de Carli Silva; Levent Tunçel (SIAM J. Optim., 2015)

Efficient heuristic algorithms for maximum utility product pricing problems. - Tor G. J. Myklebust; M. A. Sharpe; Levent Tunçel (Comput. Oper. Res., 2016)

A search for quantum coin-flipping protocols using optimization techniques. - Ashwin Nayak 001; Jamie Sikora; Levent Tunçel (Math. Program., 2016)

Perturbed sums-of-squares theorem for polynomial optimization and its applications. - Masakazu Muramatsu; Hayato Waki; Levent Tunçel (Optim. Methods Softw., 2016)

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime. - Peruvemba Sundaram Ravi; Levent Tunçel; Michael Huang (J. Sched., 2016)

A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. - Yu Hin Au; Levent Tunçel (SIAM J. Discret. Math., 2016)

Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems. - Yurii E. Nesterov; Levent Tunçel (SIAM J. Optim., 2016)

Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs. - Silvia M. Bianchi; Mariana S. Escalante; Graciela L. Nasini; Levent Tunçel (Math. Program., 2017)

An axiomatic duality framework for the theta body and related convex corners. - Marcel Kenji de Carli Silva; Levent Tunçel (Math. Program., 2017)

Primal-dual entropy-based interior-point algorithms for linear optimization. - Mehdi Karimi; Shen Luo; Levent Tunçel (RAIRO Oper. Res., 2017)

Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. - Yu Hin (Gary) Au; Levent Tunçel (Discret. Optim., 2018)

A Utility Theory Based Interactive Approach to Robustness in Linear Optimization. - Mehdi Karimi; Somayeh Moazeni; Levent Tunçel (J. Glob. Optim., 2018)

Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form. - Mehdi Karimi; Levent Tunçel (CoRR, 2019)

Facially Dual Complete (Nice) Cones and Lexicographic Tangents. - Vera Roshchina; Levent Tunçel (SIAM J. Optim., 2019)

Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP. - Marcel Kenji de Carli Silva; Levent Tunçel (SIAM J. Optim., 2019)

Matchings, hypergraphs, association schemes, and semidefinite optimization. - Yu Hin Au; Nathan Lindzey; Levent Tunçel (CoRR, 2020)

Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture. - Peruvemba Sundaram Ravi; Levent Tunçel (Inf. Process. Lett., 2020)

Primal-Dual Interior-Point Methods for Domain-Driven Formulations. - Mehdi Karimi; Levent Tunçel (Math. Oper. Res., 2020)

A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations. - Marcel Kenji de Carli Silva; Levent Tunçel (SIAM J. Discret. Math., 2020)

Status determination by interior-point methods for convex optimization problems in domain-driven form. - Mehdi Karimi; Levent Tunçel (Math. Program., 2022)

Testing idealness in the filter oracle model. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Oper. Res. Lett., 2022)

Clean Clutters and Dyadic Fractional Packings. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (SIAM J. Discret. Math., 2022)

A Primal-Dual Extension of the Goemans-Williamson Algorithm for the Weighted Fractional Cut-Covering Problem. - Nathan Benedetto Proença; Marcel Kenji de Carli Silva; Cristiane M. Sato; Levent Tunçel (CoRR, 2023)

Linear optimization over homogeneous matrix cones. - Levent Tunçel; Lieven Vandenberghe (Acta Numer., 2023)

Generalized Cuts and Grothendieck Covers: a Primal-Dual Approximation Framework Extending the Goemans-Williamson Algorithm. - Nathan Benedetto Proença; Marcel K. de Carli Silva; Cristiane M. Sato; Levent Tunçel (CoRR, 2024)

Domain-Driven Solver (DDS) Version 2.1: a MATLAB-based software package for convex optimization problems in domain-driven form. - Mehdi Karimi; Levent Tunçel (Math. Program. Comput., 2024)

Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz. - Julian Romero; Levent Tunçel (SIAM J. Discret. Math., 2024)

Total dual dyadicness and dyadic generating sets. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2024)

Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy. - Mehdi Karimi; Levent Tunçel (INFORMS J. Comput., 2025)

Everything Is Possible: Constructing Spectrahedra with Prescribed Facial Dimensions. - Vera Roshchina; Levent Tunçel (SIAM J. Optim., 2025)

Normalizations of factorizations over convex cones and their effects on extension complexity. - Adam Brown; Kanstantsin Pashkovich; Levent Tunçel (CoRR, 2025)

Stable Set Polytopes with Rank |V(G)|/3 for the Lovász-Schrijver SDP Operator. - Yu Hin Au; Levent Tunçel (CoRR, 2025)

Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices. - Levent Tunçel; Stephen A. Vavasis; Jingye Xu (Found. Comput. Math., 2025)

A Computational Search for Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy. - Yu Hin Au; Levent Tunçel (CoRR, 2025)

Stable set polytopes with high lift-and-project ranks for the Lovász-Schrijver SDP operator. - Yu Hin Au; Levent Tunçel (Math. Program., 2025)

Dyadic linear programming and extensions. - Ahmad Abdi; Gérard Cornuéjols; Bertrand Guenin; Levent Tunçel (Math. Program., 2025)

On rank-monotone graph operations and minimal obstruction graphs for the Lovász-Schrijver SDP hierarchy. - Yu Hin Au; Levent Tunçel (Math. Program., 2025)

On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations. - Yu Hin Au; Nathan Lindzey; Levent Tunçel (Discret. Math., 2026)