The following pages link to Tunçel, Levent (Q163017):
Displaying 50 items.
- (Q173844) (redirect page) (← links)
- A search for quantum coin-flipping protocols using optimization techniques (Q263220) (← links)
- (Q342311) (redirect page) (← links)
- Efficient heuristic algorithms for maximum utility product pricing problems (Q342312) (← links)
- \(s\)-goodness for low-rank matrix recovery (Q369686) (← links)
- Existence and uniqueness of solutions for homogeneous cone complementarity problems (Q430953) (← links)
- Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems (Q431004) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← links)
- Maximum utility product pricing models and algorithms based on reservation price (Q535296) (← links)
- Polyhedral and semidefinite programming methods in combinatorial optimization (Q611309) (← links)
- Self-concordant barriers for convex approximations of structured convex sets (Q707744) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- Clarke generalized Jacobian of the projection onto symmetric cones (Q833023) (← links)
- On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
- Lehman matrices (Q1025999) (← links)
- On the convexity of a function related to the Wagner-Whitin model (Q1197915) (← links)
- Characterization of the barrier parameter of homogeneous convex cones (Q1290599) (← links)
- On the condition numbers for polyhedra in Karmarkar's form (Q1306351) (← links)
- On the complexity of preflow-push algorithms for maximum-flow problems (Q1322568) (← links)
- Constant potential primal-dual algorithms: A framework (Q1340053) (← links)
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms (Q1360218) (← links)
- A constant-potential infeasible-start interior-point algorithm with computational experiments and applications (Q1383829) (← links)
- The stable set problem and the lift-and-project ranks of graphs (Q1424302) (← links)
- On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046) (← links)
- Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators (Q1662113) (← links)
- A utility theory based interactive approach to robustness in linear optimization (Q1753136) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- On the convergence of primal-dual interior-point methods with wide neighborhoods (Q1804577) (← links)
- Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard (Q1806034) (← links)
- Some fundamental properties of successive convex relaxation methods on LCP and related problems (Q1810868) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers (Q1881562) (← links)
- Lift-and-project ranks and antiblocker duality (Q1886795) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Optimization problems over unit-distance representations of graphs (Q1953430) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- Total dual dyadicness and dyadic generating sets (Q2164668) (← links)
- On the spectral structure of Jordan-Kronecker products of symmetric and skew-symmetric matrices (Q2226438) (← links)
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (Q2340339) (← links)
- Clustering via minimum volume ellipsoids (Q2385541) (← links)
- Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra (Q2462348) (← links)
- Invariance and efficiency of convex representations (Q2467162) (← links)
- Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization (Q2757561) (← links)
- On a Representation of the Matching Polytope Via Semidefinite Liftings (Q2757579) (← links)
- A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) (← links)
- Perturbed sums-of-squares theorem for polynomial optimization and its applications (Q2811486) (← links)
- Some advances on Lovász-Schrijver relaxations of the fractional stable set polytope (Q2840707) (← links)
