2 citations · 2 across the 9 of their papers we have counts for
7 papers · 1 filter
Supermodularity and valid inequalities for quadratic optimization with indicators
Alper Atamturk, Andres Gomez
We study the minimization of a rank-one quadratic with indicators and show that the underlying set function obtained by projecting out the continuous variables is supermodular. Alt…
Penalized Semidefinite Programming for Quadratically-Constrained Quadratic Optimization
Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei +1
In this paper, we give a new penalized semidefinite programming approach for non-convex quadratically-constrained quadratic programs (QCQPs). We incorporate penalty terms into the…
Submodular Function Minimization and Polarity
Alper Atamturk, Vishnu Narayanan
Using polarity, we give an outer polyhedral approximation for the epigraph of set functions. For a submodular function, we prove that the corresponding polar relaxation is exact; h…
A Bound Strengthening Method for Optimal Transmission Switching in Power Systems
Salar Fattahi, Javad Lavaei, Alper Atamturk
This paper studies the optimal transmission switching (OTS) problem for power systems, where certain lines are fixed (uncontrollable) and the remaining ones are controllable via on…
A Spatial Branch-and-Cut Method for Nonconvex QCQP with Bounded Complex Variables
Chen Chen, Alper Atamturk, Shmuel S. Oren
We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added…
Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
Alper Atamturk, Birce Tezel, Simge Kucukyavuz
Capacitated fixed-charge network flows are used to model a variety of problems in telecommunication, facility location, production planning and supply chain management. In this pap…