Levent Tunçel

105 papers B 2Journal 101Unranked 1

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