Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userProbability Distribution-free General Scenario Programming
60
0
0.0
(
0
)
Added by
Qifeng Li
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Authors
Qifeng Li
Ask ChatGPT about the research
No Arabic abstract
This paper presents a novel solution paradigm of general optimization under both exogenous and endogenous uncertainties. This solution paradigm consists of a probability distribution (PD)-free method of obtaining deterministic equivalents and an innovative approach of scenario reduction. First, dislike the existing methods that use scenarios sampled from pre-known PD functions, the PD-free method uses historical measurements of uncertain variables as input to convert the logical models into a type of deterministic equivalents called General Scenario Program (GSP). Our contributions to the PD-free deterministic equivalent construction reside in generalization (making it applicable to general optimization under uncertainty rather than just chance-constrained optimization) and extension (enabling it to the problems under endogenous uncertainty via developing an iterative and a non-iterative frameworks). Second, this paper reveals some unknown properties of the PD-free deterministic equivalent construction, such as the characteristics of active scenarios and repeated scenarios. Base on this discoveries, we propose a concept and methods of strategic scenario selection which can effectively reduce the required number of scenarios as demonstrated in both mathematical analysis and numerical experiments. Numerical experiments are conducted on two typical smart grid optimization problems under exogenous and endogenous uncertainties.
rate research
Read More
This paper addresses the issue of data injection attacks on control systems. We consider attacks which aim at maximizing system disruption while staying undetected in the finite horizon. The maximum possible disruption caused by such attacks is formulated as a non-convex optimization problem whose dual problem is a convex semi-definite program. We show that the duality gap is zero using S-lemma. To determine the optimal attack vector, we formulate a soft-constrained optimization problem using the Lagrangian dual function. The framework of dynamic programming for indefinite cost functions is used to solve the soft-constrained optimization problem and determine the attack vector. Using the Karush-Kuhn-Tucker conditions, we also provide necessary and sufficient conditions under which the obtained attack vector is optimal to the primal problem.
This paper introduces HPIPM, a high-performance framework for quadratic programming (QP), designed to provide building blocks to efficiently and reliably solve model predictive control problems. HPIPM currently supports three QP types, and provides interior point method (IPM) solvers as well (partial) condensing routines. In particular, the IPM for optimal control QPs is intended to supersede the HPMPC solver, and it largely improves robustness while keeping the focus on speed. Numerical experiments show that HPIPM reliably solves challenging QPs, and that it outperforms other state-of-the-art solvers in speed.
Stochastic model predictive control (SMPC) has been a promising solution to complex control problems under uncertain disturbances. However, traditional SMPC approaches either require exact knowledge of probabilistic distributions, or rely on massive scenarios that are generated to represent uncertainties. In this paper, a novel scenario-based SMPC approach is proposed by actively learning a data-driven uncertainty set from available data with machine learning techniques. A systematical procedure is then proposed to further calibrate the uncertainty set, which gives appropriate probabilistic guarantee. The resulting data-driven uncertainty set is more compact than traditional norm-based sets, and can help reducing conservatism of control actions. Meanwhile, the proposed method requires less data samples than traditional scenario-based SMPC approaches, thereby enhancing the practicability of SMPC. Finally the optimal control problem is cast as a single-stage robust optimization problem, which can be solved efficiently by deriving the robust counterpart problem. The feasibility and stability issue is also discussed in detail. The efficacy of the proposed approach is demonstrated through a two-mass-spring system and a building energy control problem under uncertain disturbances.
In this paper we propose a data-driven model for the spread of SARS-CoV-2 and use it to design optimal control strategies of human-mobility restrictions that both curb the epidemic and minimize the economic costs associated with implementing non-pharmaceutical interventions. We develop an extension of the SEIR epidemic model that captures the effects of changes in human mobility on the spread of the disease. The parameters of our data-driven model are learned using a multitask learning approach that leverages both data on the number of deaths across a set of regions, and cellphone data on individuals mobility patterns specific to each region. We propose an optimal control problem on this data-driven model with a tractable solution provided by geometric programming. The result of this framework is a mobility-based intervention strategy that curbs the spread of the epidemic while obeying a budget on the economic cost incurred. Furthermore, in the absence of a straightforward mapping from human mobility data to economic costs, we propose a practical method by which a budget on economic losses incurred may be chosen to eliminate excess deaths due to over-utilization of hospital resources. Our results are demonstrated with numerical simulations using real data from the Philadelphia metropolitan area.
Small-scale Mixed-Integer Quadratic Programming (MIQP) problems often arise in embedded control and estimation applications. Driven by the need for algorithmic simplicity to target computing platforms with limited memory and computing resources, this paper proposes a few approaches to solving MIQPs, either to optimality or suboptimally. We specialize an existing Accelerated Dual Gradient Projection (GPAD) algorithm to effectively solve the Quadratic Programming (QP) relaxation that arise during Branch and Bound (B&B) and propose a generic framework to warm-start the binary variables which reduces the number of QP relaxations. Moreover, in order to find an integer feasible combination of the binary variables upfront, two heuristic approaches are presented: ($i$) without using B&B, and ($ii$) using B&B with a significantly reduced number of QP relaxations. Both heuristic approaches return an integer feasible solution that may be suboptimal but involve a much reduced computation effort. Such a feasible solution can be either implemented directly or used to set an initial upper bound on the optimal cost in B&B. Through different hybrid control and estimation examples involving binary decision variables, we show that the performance of the proposed methods, although very simple to code, is comparable to that of state-of-the-art MIQP solvers.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
