default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLevent Tunçel
Person information
- affiliation: University of Waterloo, Department of Combinatorics and Optimization
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Ahmad Abdi
, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total dual dyadicness and dyadic generating sets. Math. Program. 206(1): 125-143 (2024)- [j73]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): 37-92 (2024) - [j72]Julian Romero, Levent Tunçel:
Graphs with Large Girth and Chromatic Number are Hard for Nullstellensatz. SIAM J. Discret. Math. 38(3): 2108-2131 (2024) - [i16]Yu Hin Au, Levent Tunçel:
On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász-Schrijver SDP Hierarchy. CoRR abs/2401.01476 (2024) - [i15]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 abs/2406.18670 (2024) - 2023
- [j71]Levent Tunçel, Lieven Vandenberghe:
Linear optimization over homogeneous matrix cones. Acta Numer. 32: 675-747 (2023) - [i14]Yu Hin Au, Levent Tunçel:
Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator. CoRR abs/2303.08971 (2023) - [i13]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 abs/2311.15346 (2023) - [i12]Mehdi Karimi, Levent Tunçel:
Efficient Implementation of Interior-Point Methods for Quantum Relative Entropy. CoRR abs/2312.07438 (2023) - 2022
- [j70]Mehdi Karimi, Levent Tunçel:
Status determination by interior-point methods for convex optimization problems in domain-driven form. Math. Program. 194(1): 937-974 (2022) - [j69]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Testing idealness in the filter oracle model. Oper. Res. Lett. 50(6): 753-755 (2022) - [j68]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Clean Clutters and Dyadic Fractional Packings. SIAM J. Discret. Math. 36(2): 1012-1037 (2022) - [c3]Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Total Dual Dyadicness and Dyadic Generating Sets. IPCO 2022: 1-14 - [i11]Levent Tunçel, Lieven Vandenberghe:
Linear optimization over homogeneous matrix cones. CoRR abs/2211.00761 (2022) - 2020
- [j67]Peruvemba Sundaram Ravi, Levent Tunçel:
Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture. Inf. Process. Lett. 159-160: 105959 (2020) - [j66]Mehdi Karimi, Levent Tunçel:
Primal-Dual Interior-Point Methods for Domain-Driven Formulations. Math. Oper. Res. 45(2): 591-621 (2020) - [j65]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): 470-496 (2020) - [i10]Yu Hin Au, Nathan Lindzey, Levent Tunçel:
Matchings, hypergraphs, association schemes, and semidefinite optimization. CoRR abs/2008.08628 (2020)
2010 – 2019
- 2019
- [j64]Vera Roshchina, Levent Tunçel:
Facially Dual Complete (Nice) Cones and Lexicographic Tangents. SIAM J. Optim. 29(3): 2363-2387 (2019) - [j63]Marcel Kenji de Carli Silva, Levent Tunçel:
Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP. SIAM J. Optim. 29(4): 2650-2676 (2019) - [i9]Mehdi Karimi, Levent Tunçel:
Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form. CoRR abs/1908.03075 (2019) - 2018
- [j62]Yu Hin (Gary) Au, Levent Tunçel:
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. Discret. Optim. 27: 103-129 (2018) - [j61]Mehdi Karimi, Somayeh Moazeni, Levent Tunçel:
A Utility Theory Based Interactive Approach to Robustness in Linear Optimization. J. Glob. Optim. 70(4): 811-842 (2018) - 2017
- [j60]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): 201-223 (2017) - [j59]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): 283-323 (2017) - [j58]Mehdi Karimi, Shen Luo, Levent Tunçel:
Primal-dual entropy-based interior-point algorithms for linear optimization. RAIRO Oper. Res. 51(2): 299-328 (2017) - 2016
- [j57]Tor G. J. Myklebust, M. A. Sharpe, Levent Tunçel:
Efficient heuristic algorithms for maximum utility product pricing problems. Comput. Oper. Res. 69: 25-39 (2016) - [j56]Ashwin Nayak, Jamie Sikora, Levent Tunçel:
A search for quantum coin-flipping protocols using optimization techniques. Math. Program. 156(1-2): 581-613 (2016) - [j55]Masakazu Muramatsu, Hayato Waki, Levent Tunçel:
Perturbed sums-of-squares theorem for polynomial optimization and its applications. Optim. Methods Softw. 31(1): 134-156 (2016) - [j54]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): 547-561 (2016) - [j53]Yu Hin Au, Levent Tunçel:
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. SIAM J. Discret. Math. 30(1): 411-451 (2016) - [j52]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): 139-170 (2016) - [i8]Yu Hin Au, Levent Tunçel:
Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators. CoRR abs/1608.07647 (2016) - 2015
- [j51]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): 459-489 (2015) - [j50]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): 295-316 (2015) - [i7]Ashwin Nayak, Jamie Sikora, Levent Tunçel:
Quantum and classical coin-flipping protocols based on bit-commitment and their point games. CoRR abs/1504.04217 (2015) - [i6]Peruvemba Sundaram Ravi, Levent Tunçel:
Approximation Ratio of LD Algorithm for Multi-Processor Scheduling and the Coffman-Sethi Conjecture. CoRR abs/1505.01005 (2015) - 2014
- [j49]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: 460-469 (2014) - [i5]Ashwin Nayak, Jamie Sikora, Levent Tunçel:
A search for quantum coin-flipping protocols using optimization techniques. CoRR abs/1403.0505 (2014) - [i4]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 abs/1411.2069 (2014) - 2013
- [j48]Marcel Kenji de Carli Silva, Levent Tunçel:
Optimization Problems over Unit-Distance Representations of Graphs. Electron. J. Comb. 20(1): 43 (2013) - [j47]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: 339-344 (2013) - [i3]Peruvemba Sundaram Ravi, Levent Tunçel, Michael Huang:
Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time. CoRR abs/1312.3345 (2013) - [i2]Yu Hin Au, Levent Tunçel:
A Comprehensive Analysis of Polyhedral Lift-and-Project Methods. CoRR abs/1312.5972 (2013) - 2012
- [j46]Levent Tunçel, Henry Wolkowicz:
Strong duality and minimal representations for cone optimization. Comput. Optim. Appl. 53(2): 619-648 (2012) - [j45]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems. J. Optim. Theory Appl. 153(2): 357-376 (2012) - [j44]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): 327-336 (2012) - 2011
- [j43]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): 157-198 (2011) - [j42]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Some advances on Lovász-Schrijver N+(⋅) relaxations of the fractional stable set polytope. Electron. Notes Discret. Math. 37: 189-194 (2011) - [j41]Silvia M. Bianchi, Mariana S. Escalante, Graciela L. Nasini, Levent Tunçel:
Near-perfect graphs with polyhedral N+(G). Electron. Notes Discret. Math. 37: 393-398 (2011) - [j40]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming. J. Optim. Theory Appl. 148(2): 364-389 (2011) - [c2]Yu Hin Au, Levent Tunçel:
Complexity Analyses of Bienstock-Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes. IPCO 2011: 14-26 - [i1]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Sufficient Conditions for Low-rank Matrix Recovery, Translated from Sparse Signal Recovery. CoRR abs/1106.3276 (2011) - 2010
- [j39]Levent Tunçel, Arkadi Nemirovski:
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets. Found. Comput. Math. 10(5): 485-525 (2010)
2000 – 2009
- 2009
- [j38]Lingchen Kong, Levent Tunçel, Naihua Xiu:
Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems. Asia Pac. J. Oper. Res. 26(2): 199-233 (2009) - [j37]Yu Hin Au, Levent Tunçel:
On the polyhedral lift-and-project methods and the fractional stable set polytope. Discret. Optim. 6(2): 206-213 (2009) - [j36]Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Lehman matrices. J. Comb. Theory B 99(3): 531-556 (2009) - [j35]Levent Tunçel:
Optimization algorithms on matrix manifolds. Math. Comput. 78(266): 1233-1236 (2009) - [r1]Levent Tunçel:
Interior Point Methods for Semidefinite Programming. Encyclopedia of Optimization 2009: 1679-1683 - 2008
- [j34]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): 25-41 (2008) - [j33]Chek Beng Chua, Levent Tunçel:
Invariance and efficiency of convex representations. Math. Program. 111(1-2): 113-140 (2008) - [j32]Marina Potaptchik, Levent Tunçel, Henry Wolkowicz:
Large scale portfolio optimization with piecewise linear transaction costs. Optim. Methods Softw. 23(6): 929-952 (2008) - 2007
- [j31]Romy Shioda, Levent Tunçel:
Clustering via minimum volume ellipsoids. Comput. Optim. Appl. 37(3): 247-295 (2007) - [j30]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
- [j29]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) - [j28]László Lipták, Levent Tunçel:
Lift-and-project ranks and antiblocker duality. Oper. Res. Lett. 33(1): 35-41 (2005) - 2004
- [j27]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) - 2003
- [j26]László Lipták, Levent Tunçel:
The stable set problem and the lift-and-project ranks of graphs. Math. Program. 98(1-3): 319-353 (2003) - 2002
- [j25]Masakazu Kojima, Levent Tunçel:
On the finite convergence of successive SDP relaxation methods. Eur. J. Oper. Res. 143(2): 325-341 (2002) - [j24]Masakazu Kojima, Levent Tunçel:
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. J. Glob. Optim. 24(3): 333-348 (2002) - 2001
- [j23]Levent Tunçel:
Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form. Found. Comput. Math. 1(3): 229-254 (2001) - [j22]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) - [j21]Michel X. Goemans, Levent Tunçel:
When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures? Math. Oper. Res. 26(4): 796-815 (2001) - [j20]Gábor Pataki, Levent Tunçel:
On the generic properties of convex optimization problems in conic form. Math. Program. 89(3): 449-457 (2001) - [j19]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): 59-69 (2001) - [j18]Levent Tunçel:
On the Slater condition for the SDP relaxations of nonconvex sets. Oper. Res. Lett. 29(4): 181-186 (2001) - 2000
- [j17]Masakazu Kojima, Levent Tunçel:
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. Math. Program. 89(1): 79-111 (2000) - [j16]Masakazu Kojima, Levent Tunçel:
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. SIAM J. Optim. 10(3): 750-778 (2000)
1990 – 1999
- 1999
- [j15]Tamon Stephen, Levent Tunçel:
On a Representation of the Matching Polytope Via Semidefinite Liftings. Math. Oper. Res. 24(1): 1-7 (1999) - [j14]Levent Tunçel:
Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86(1): 219-223 (1999) - [j13]Levent Tunçel:
On the condition numbers for polyhedra in Karmarkar's form. Oper. Res. Lett. 24(4): 149-155 (1999) - 1998
- [j12]Abbas Seifi, Levent Tunçel:
A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications. Comput. Optim. Appl. 9(2): 107-152 (1998) - [j11]Levent Tunçel:
Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization. Math. Oper. Res. 23(3): 708-718 (1998) - [j10]Osman Güler, Levent Tunçel:
Characterization of the barrier parameter of homogeneous convex cones. Math. Program. 81: 55-76 (1998) - 1997
- [j9]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): 5-19 (1997) - [j8]Motakuri V. Ramana, Levent Tunçel, Henry Wolkowicz:
Strong Duality for Semidefinite Programming. SIAM J. Optim. 7(3): 641-662 (1997) - 1996
- [j7]Levent Tunçel, Michael J. Todd:
Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming. Math. Oper. Res. 21(2): 354-381 (1996) - 1995
- [j6]Levent Tunçel:
On the convergence of primal-dual interior-point methods with wide neighborhoods. Comput. Optim. Appl. 4(2): 139-158 (1995) - 1994
- [j5]Levent Tunçel:
On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems. Algorithmica 11(4): 353-359 (1994) - [j4]Levent Tunçel:
Constant potential primal-dual algorithms: A framework. Math. Program. 66: 145-159 (1994) - [j3]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): 613-625 (1994) - 1993
- [j2]Michael J. Todd, Levent Tunçel:
A New Triangulation for Simplicial Algorithms. SIAM J. Discret. Math. 6(1): 167-180 (1993) - [c1]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: 395-413 - 1992
- [j1]Levent Tunçel, Peter L. Jackson:
On the convexity of a function related to the Wagner-Whitin model. Oper. Res. Lett. 11(4): 255-259 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
