B
Burak Kocuk
Researcher at Sabancı University
Publications - 36
Citations - 817
Burak Kocuk is an academic researcher from Sabancı University. The author has contributed to research in topics: Optimization problem & Relaxation (approximation). The author has an hindex of 9, co-authored 31 publications receiving 638 citations. Previous affiliations of Burak Kocuk include Boğaziçi University & Georgia Institute of Technology.
Papers
More filters
Journal ArticleDOI
Strong SOCP Relaxations for the Optimal Power Flow Problem
TL;DR: This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem that consistently outperforms previously proposed convex quadratic relaxations of the OPF problem and has numerous advantages over existing convex relaxations in the literature.
Journal ArticleDOI
Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
TL;DR: It is shown that even for a 2-bus 1-generator system, the SDP relaxation can have all possible approximation outcomes, which means that the need of developing efficient global optimization methods for the solution of OPF even in the simple but fundamental case of radial networks is demonstrated.
Journal ArticleDOI
New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem
TL;DR: In this article, the authors proposed a new exact formulation for AC OTS and its mixed-integer second-order cone programming relaxation via several types of strong valid inequalities inspired by the recent development for the closely related AC optimal power flow problem.
Journal ArticleDOI
Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem
TL;DR: In this article, a new technique for reformulation of the rank constraints using both principal and non-principal 2-by-2 minors of the involved Hermitian matrix variable and characterize all such minors into three types.
Journal ArticleDOI
Strong SOCP Relaxations for the Optimal Power Flow Problem
TL;DR: In this paper, strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem were proposed, which can be directly used as a warm start in a local solver such as IPOPT.