Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
From MaRDI portal
Publication:6060145
Abstract: In this work, we consider two-stage quadratic optimization problems under ellipsoidal uncertainty. In the first stage, one needs to decide upon the values of a subset of optimization variables (control variables). In the second stage, the uncertainty is revealed and the rest of the optimization variables (state variables) are set up as a solution to a known system of possibly non-linear equations. This type of problem occurs, for instance, in optimization for dynamical systems, such as electric power systems as well as gas and water networks. We propose a convergent iterative algorithm to build a sequence of approximately robustly feasible solutions with an improving objective value. At each iteration, the algorithm optimizes over a subset of the feasible set and uses affine approximations of the second-stage equations while preserving the non-linearity of other constraints. We implement our approach and demonstrate its performance on Matpower instances. This paper focuses on quadratic problems, but the approach is suitable for more general setups.
Recommendations
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
- On the power of robust solutions in two-stage stochastic and adaptive optimization problems
- Exact conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- On robust optimization of two-stage systems
- On the robustness and scalability of semidefinite relaxation for optimal power flow problems
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Two-stage network constrained robust unit commitment problem
- Lagrangian duality and branch-and-bound algorithms for optimal power flow
Cites work
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A primal-dual lifting scheme for two-stage robust optimization
- A survey of adjustable robust optimization
- Adjustable robust solutions of uncertain linear programs
- Affinely adjustable robust linear complementarity problems
- Chance-constrained optimal power flow: risk-aware network control under uncertainty
- Computing robust basestock levels
- Convex Restriction of Power Flow Feasibility Sets
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- scientific article; zbMATH DE number 3227205 (Why is no real title available?)
- Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
- Polynomial optimization for water networks: global solutions for the valve setting problem
- Robust optimization
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- Strong NP-hardness of AC power flows feasibility
- Tractable approximations of sets defined with quantifiers
- Transversality and alternating projections for nonconvex sets
Cited in
(2)
This page was built for publication: Two-Stage Robust Quadratic Optimization with Equalities and Its Application to Optimal Power Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060145)
