Levent Tunçel

According to our database1, Levent Tunçel authored at least 75 papers between 1992 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations.
SIAM J. Discret. Math., 2020

Primal-Dual Interior-Point Methods for Domain-Driven Formulations.
Math. Oper. Res., 2020

Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture.
Inf. Process. Lett., 2020

Matchings, hypergraphs, association schemes, and semidefinite optimization.
CoRR, 2020

Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP.
SIAM J. Optim., 2019

Facially Dual Complete (Nice) Cones and Lexicographic Tangents.
SIAM J. Optim., 2019

Domain-Driven Solver (DDS): a MATLAB-based Software Package for Convex Optimization Problems in Domain-Driven Form.
CoRR, 2019

A Utility Theory Based Interactive Approach to Robustness in Linear Optimization.
J. Glob. Optim., 2018

Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators.
Discret. Optim., 2018

Primal-dual entropy-based interior-point algorithms for linear optimization.
RAIRO Oper. Res., 2017

An axiomatic duality framework for the theta body and related convex corners.
Math. Program., 2017

Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs.
Math. Program., 2017

Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems.
SIAM J. Optim., 2016

A Comprehensive Analysis of Polyhedral Lift-and-Project Methods.
SIAM J. Discret. Math., 2016

Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime.
J. Sched., 2016

Perturbed sums-of-squares theorem for polynomial optimization and its applications.
Optim. Methods Softw., 2016

A search for quantum coin-flipping protocols using optimization techniques.
Math. Program., 2016

Efficient heuristic algorithms for maximum utility product pricing problems.
Comput. Oper. Res., 2016

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

Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope.
Discret. Appl. Math., 2014

Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs.
Electron. Notes Discret. Math., 2013

Worst-Case Performance Analysis of Some Approximation Algorithms for Minimizing Makespan and Flow-Time.
CoRR, 2013

Optimization Problems over Unit-Distance Representations of Graphs.
Electron. J. Comb., 2013

Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems.
Math. Program., 2012

Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems.
J. Optim. Theory Appl., 2012

Strong duality and minimal representations for cone optimization.
Comput. Optim. Appl., 2012

Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming.
J. Optim. Theory Appl., 2011

Near-perfect graphs with polyhedral N<sub>+</sub>(G).
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

Maximum utility product pricing models and algorithms based on reservation price.
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

Self-Concordant Barriers for Convex Approximations of Structured Convex Sets.
Found. Comput. Math., 2010

Interior Point Methods for Semidefinite Programming.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Optimization algorithms on matrix manifolds.
Math. Comput., 2009

Lehman matrices.
J. Comb. Theory, Ser. B, 2009

On the polyhedral lift-and-project methods and the fractional stable set polytope.
Discret. Optim., 2009

Vector-Valued Implicit Lagrangian for Symmetric Cone complementarity Problems.
Asia Pac. J. Oper. Res., 2009

Large scale portfolio optimization with piecewise linear transaction costs.
Optim. Methods Softw., 2008

Invariance and efficiency of convex representations.
Math. Program., 2008

Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra.
Discret. Appl. Math., 2008

Foreword: Special issue on large-scale nonlinear and semidefinite programming.
Math. Program., 2007

Clustering via minimum volume ellipsoids.
Comput. Optim. Appl., 2007

Lift-and-project ranks and antiblocker duality.
Oper. Res. Lett., 2005

"Cone-free" primal-dual path-following and potential-reduction polynomial time interior-point methods.
Math. Program., 2005

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers.
Math. Program., 2004

The stable set problem and the lift-and-project ranks of graphs.
Math. Program., 2003

Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems.
J. Glob. Optim., 2002

On the finite convergence of successive SDP relaxation methods.
Eur. J. Oper. Res., 2002

On the Slater condition for the SDP relaxations of nonconvex sets.
Oper. Res. Lett., 2001

Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems.
Math. Program., 2001

On the generic properties of convex optimization problems in conic form.
Math. Program., 2001

On Homogeneous Convex Cones, The Carathéodory Number, and the Duality Mapping.
Math. Oper. Res., 2001

When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
Math. Oper. Res., 2001

Generalization of Primal-Dual Interior-Point Methods to Convex Optimization Problems in Conic Form.
Found. Comput. Math., 2001

Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets.
SIAM J. Optim., 2000

Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
Math. Program., 2000

On the condition numbers for polyhedra in Karmarkar's form.
Oper. Res. Lett., 1999

Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard.
Math. Program., 1999

On a Representation of the Matching Polytope Via Semidefinite Liftings.
Math. Oper. Res., 1999

Characterization of the barrier parameter of homogeneous convex cones.
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

Strong Duality for Semidefinite Programming.
SIAM J. Optim., 1997

On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms.
Comput. Optim. Appl., 1997

Asymptotic Behavior of Interior-Point Methods: A View From Semi-Infinite Programming.
Math. Oper. Res., 1996

On the convergence of primal-dual interior-point methods with wide neighborhoods.
Comput. Optim. Appl., 1995

Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms.
SIAM J. Optim., 1994

Constant potential primal-dual algorithms: A framework.
Math. Program., 1994

On the Complexity of Preflow-Push Algorithms for Maximum-Flow Problems.
Algorithmica, 1994

A New Triangulation for Simplicial Algorithms.
SIAM J. Discret. Math., 1993

A linear programming and rounding approach to max 2-sat.
Proceedings of the Cliques, 1993

On the convexity of a function related to the Wagner-Whitin model.
Oper. Res. Lett., 1992