English
Related papers

Related papers: Convex Relaxations for Gas Expansion Planning

200 papers

Convex relaxations of the AC power flow equations have attracted significant interest in the power systems research community in recent years. The following collection of video lectures provides a brief introduction to the mathematics of AC…

Optimization and Control · Mathematics 2018-07-20 Carleton Coffrin , Line Roald

Optimizing the transient control of gas networks is a highly challenging task. The corresponding model incorporates the combinatorial complexity of determining the settings for the many active elements as well as the non-linear and…

Optimization and Control · Mathematics 2022-06-14 Felix Hennings , Kai Hoppmann-Baum , Janina Zittel

In this letter, we propose a data-driven warm start approach, empowered by artificial neural networks, to boost the efficiency of convex relaxations in optimal gas flow. Case studies show that this approach significantly decreases the…

Optimization and Control · Mathematics 2020-12-21 Haizhou Liu , Lun Yang , Xinwei Shen , Qinglai Guo , Hongbin Sun , Mohammad Shahidehpour

This article presents a new method for computing guaranteed convex and concave relaxations of nonlinear stochastic optimal control problems with final-time expected-value cost functions. This method is motivated by similar methods for…

Optimization and Control · Mathematics 2017-11-27 Yuanxun Shao , Dillard Robertson , Joseph Kirk Scott

In this paper, we introduce methods from convex optimization to solve the multimarginal transport type problems arise in the context of density functional theory. Convex relaxations are used to provide outer approximation to the set of…

Optimization and Control · Mathematics 2018-08-15 Yuehaw Khoo , Lexing Ying

Autonomous microgrid planning is a Mixed-Integer Non Convex decision problem that requires to consider investments in both distribution and generation capacity and represents significant computation challenges. We proposed in a previous…

Optimization and Control · Mathematics 2017-03-21 Benoît Martin , François Glineur , Emmanuel De Jaeger

Tight convex and concave relaxations are of high importance in the field of deterministic global optimization. We present a heuristic to tighten relaxations obtained by the McCormick technique. We use the McCormick subgradient propagation…

Optimization and Control · Mathematics 2017-10-26 Jaromił Najman , Alexander Mitsos

Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite…

Systems and Control · Computer Science 2014-01-10 Subhonmesh Bose , Steven H. Low , Thanchanok Teeraratkul , Babak Hassibi

Flexible transmission line impedances on one hand are a promising control resource for facilitating grid flexibility, but on the other hand add much complexity to the concerned optimization problems. This paper develops a convexification…

Optimization and Control · Mathematics 2022-04-12 Yue Song , David J. Hill , Tao Liu , Tianlun Chen

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy…

Optimization and Control · Mathematics 2025-05-13 Rong-Peng Liu , Wei Sun , Dali Zhou , Yunhe Hou

We maximize the production of biogas in a gradostat at steady state. The physical decision variables are the water, substrate, and biomass entering each tank and the flows through the interconnecting pipes. Our main technical focus is the…

Optimization and Control · Mathematics 2021-02-04 Josh Taylor , Alain Rapaport

Convex optimization is a powerful tool for resource allocation and signal processing in wireless networks. As the network density is expected to drastically increase in order to accommodate the exponentially growing mobile data traffic,…

Information Theory · Computer Science 2015-10-28 Yuanming Shi , Jun Zhang , Brendan O'Donoghue , Khaled B. Letaief

In this paper, we present new convex relaxations for nonconvex quadratically constrained quadratic programming (QCQP) problems. While recent research has focused on strengthening convex relaxations using reformulation-linearization…

Optimization and Control · Mathematics 2017-09-19 Rujun Jiang , Duan Li

In this paper, we propose a convex planning model of integrated heat and electricity systems considering variable mass flow rates. The main challenge comes from the non-convexity of the bilinear terms in the district heating network, i.e.,…

Optimization and Control · Mathematics 2020-11-30 Lirong Deng , Xuan Zhang , Tianshu Yang , Hongbin Sun

We propose a novel method to fit and segment multi-structural data via convex relaxation. Unlike greedy methods --which maximise the number of inliers-- this approach efficiently searches for a soft assignment of points to models by…

Computer Vision and Pattern Recognition · Computer Science 2017-06-07 Paul Amayo , Pedro Pinies , Lina M. Paz , Paul Newman

Pose Graph Optimization involves the estimation of a set of poses from pairwise measurements and provides a formalization for many problems arising in mobile robotics and geometric computer vision. In this paper, we consider the case in…

Robotics · Computer Science 2018-01-09 Luca Carlone , Giuseppe C. Calafiore

Distribution networks are usually multiphase and radial. To facilitate power flow computation and optimization, two semidefinite programming (SDP) relaxations of the optimal power flow problem and a linear approximation of the power flow…

Optimization and Control · Mathematics 2014-06-13 Lingwen Gan , Steven H. Low

AC optimal power flow (AC OPF) is a fundamental problem in power system operations. Accurately modeling the network physics via the AC power flow equations makes AC OPF a challenging nonconvex problem. To search for global optima, recent…

Optimization and Control · Mathematics 2024-04-09 Mohammad Rasoul Narimani , Daniel K. Molzahn , Katherine R. Davis , Mariesa L. Crow

This paper introduces several new algorithms for consensus over the special orthogonal group. By relying on a convex relaxation of the space of rotation matrices, consensus over rotation elements is reduced to solving a convex problem with…

Optimization and Control · Mathematics 2014-10-08 Nikolai Matni , Matanya B. Horowitz

Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail…

Optimization and Control · Mathematics 2014-11-18 Daniel K. Molzahn , Ian A. Hiskens