TY - CONF
T1 - A bound on the minimum rank of solutions to sparse linear matrix equations
T2 - 2016 American Control Conference (ACC)
Y1 - 2016/08//
SP - 6501
EP - 6506
A1 - Raphael Louca
A1 - Subhonmesh Bose
A1 - Eilyan Bitar
KW - RM14-002
AB - We derive a new upper bound on the minimum rank of matrices belonging to an affine slice of the positive semidefinite cone, when the affine slice is defined according to a system of sparse linear matrix equations. It is shown that a feasible matrix whose rank is no greater than said bound can be computed in polynomial time. The bound depends on both the number of linear matrix equations and their underlying sparsity pattern. For certain problem families, this bound is shown to improve upon well known bounds in the literature. Several examples are provided to illustrate the efficacy of this bound.
JF - 2016 American Control Conference (ACC)
PB - IEEE
CY - Boston, MA, USA
DO - 10.1109/ACC.2016.7526693
ER -
TY - CONF
T1 - A hierarchy of polyhedral approximations of robust semidefinite programs
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 7056
EP - 7062
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - Robust semidefinite programs are NP-hard in general. In contrast, robust linear programs admit equivalent reformulations as finite-dimensional convex programs provided that the problem data are parameterized affinely in the uncertain parameters; and that the underlying uncertainty set is described by an affine slice of a proper cone. In this paper, we propose a hierarchy of inner and outer polyhedral approximations to the positive semidefinite (PSD) cone that are exact in the limit. We apply these polyhedral approximations to the PSD cone to obtain a computationally tractable hierarchy of inner and outer approximations to the robust semidefinite program, which are similarly exact in the limit. We investigate the strengths and limitations of the proposed approach with a detailed numerical study.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7799356
ER -
TY - CONF
T1 - Stochastic AC optimal power flow with affine recourse
T2 - 2016 IEEE 55th Conference on Decision and Control (CDC)
Y1 - 2016/12//
SP - 2431
EP - 2436
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - With the increasing penetration of intermittent renewable energy sources into the electric power grid, there is an emerging need to develop stochastic optimization methods to enable the reliable and efficient operation of power systems having a large fraction of their power supplied form uncertain resources. In this paper, we formulate the stochastic AC optimal power flow (OPF) problem as a two-stage stochastic program with robust constraints. This problem amounts to an infinite-dimensional nonconvex optimization problem. We develop a finite-dimensional inner approximation as a semidefinite program. Its solution yields an affine recourse policy that is guaranteed to be feasible for the stochastic AC OPF problem.
JF - 2016 IEEE 55th Conference on Decision and Control (CDC)
PB - IEEE
CY - Las Vegas, NV, USA
DO - 10.1109/CDC.2016.7798626
ER -
TY - CONF
T1 - Acyclic semidefinite approximations of quadratically constrained quadratic programs
T2 - 2015 American Control Conference (ACC)
Y1 - 2015/07//
SP - 5925
EP - 5930
A1 - Raphael Louca
A1 - Eilyan Bitar
KW - RM14-002
AB - Quadratically constrained quadratic programs (QCQPs) belong to a class of nonconvex optimization problems that are NP-hard in general. Recent results have shown that QCQPs having acyclic graph structure can be solved in polynomial time, provided that their constraints satisfy a certain technical condition. In this paper, we consider complex QCQPs with arbitrary graph structure and investigate the extent to which it is possible to apply structured perturbations on the problem data to yield acyclic QCQPs having optimal solutions satisfying certain approximation guarantees. Specifically, we provide sufficient conditions under which the perturbed QCQP can be solved in polynomial time to yield a feasible solution to the original QCQP and derive an explicit bound on the performance of said solution in the worst case.
JF - 2015 American Control Conference (ACC)
PB - IEEE
CY - Chicago, IL, USA
DO - 10.1109/ACC.2015.7172269
ER -