Related papers: On linear relaxations of OPF problems
In this paper we discuss the existence and regularity of solutions of fractional Lane-Emden systems with weights.
We describe all weights which are appropriated for the unitarization of linear representations of primitive partially ordered sets of finite type.
We show that the linear or quadratic 0/1 program\[P:\quad\min\{ c^Tx+x^TFx : \:A\,x =b;\:x\in\{0,1\}^n\},\]can be formulated as a MAX-CUT problem whose associated graph is simply related to the matrices $\F$ and $\A^T\A$.Hence the whole…
Standard quadratic optimization problems (StQPs) provide a versatile modelling tool in various applications. In this paper, we consider StQPs with a hard sparsity constraint, referred to as sparse StQPs. We focus on various tractable convex…
We introduce the optimality question to the relaxation in multiple control problems described by Sobolev type nonlinear fractional differential equations with nonlocal control conditions in Banach spaces. Moreover, we consider the…
In the paper, some lower bounds for polygamma functions are refined.
We introduce a relaxation for homomorphism problems that combines semidefinite programming with linear Diophantine equations, and propose a framework for the analysis of its power based on the spectral theory of association schemes. We use…
We study the problem of the motion of the free surface of a liquid. We prove existence and stability for the linearized equations.
Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…
Near isometric orthogonal embeddings to lower dimensions are a fundamental tool in data science and machine learning. In this paper, we present the construction of such embeddings that minimizes the maximum distortion for a given set of…
AC optimal power flow (AC~OPF) is a challenging non-convex optimization problem that plays a crucial role in power system operation and control. Recently developed convex relaxation techniques provide new insights regarding the global…
The optimal power flow (OPF) problem determines power generation/demand that minimize a certain objective such as generation cost or power loss. It is nonconvex. We prove that, for radial networks, after shrinking its feasible set slightly,…
We propose a branch flow model for the anal- ysis and optimization of mesh as well as radial networks. The model leads to a new approach to solving optimal power flow (OPF) that consists of two relaxation steps. The first step eliminates…
Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable) convex problems it may not find global minima. We present a class of linear programs that coordinate-wise…
In this paper, we propose a delayed perturbation of Mittag-Leffler type matrix function, which is an extension of the classical Mittag-Leffler type matrix function and delayed Mittag-Leffler type matrix function. With the help of the…
In this study, we approach the analysis of a degenerate nonlinear functional in one dimension, accommodating a degenerate weight $w$. Our investigation focuses on establishing an explicit relaxation formula for a functional exhibiting…
Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover, a type of integer programming (IP) problem. A lattice-gas model on the Erd\"os-R\'enyi random graphs of $\alpha$-uniform…
This paper considers state-of-the-art convex relaxations for the AC power flow equations and introduces new valid cuts based on convex envelopes and lifted nonlinear constraints. These valid linear inequalities strengthen existing…
The pooling problem is a classical NP-hard problem in the chemical process and petroleum industries. This problem is modeled as a nonlinear, nonconvex network flow problem in which raw materials with different specifications are blended in…
We introduce a semidefinite relaxation for optimal control of linear systems with time scaling. These problems are inherently nonconvex, since the system dynamics involves bilinear products between the discretization time step and the…