Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

01/27/2021
by   Johannes J. Brust, et al.
0

For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. This article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2022

Fast Krasnosel'skii-Mann algorithm with a convergence rate of the fixed point iteration of o(1/k)

The Krasnosel'skii-Mann (KM) algorithm is the most fundamental iterative...
research
11/02/2021

Equivalent Versions of Total Flow Analysis

Total Flow Analysis (TFA) is a method for conducting the worst-case anal...
research
10/02/2020

Hidden automatic sequences

An automatic sequence is a letter-to-letter coding of a fixed point of a...
research
12/16/2020

Exponential Convergence Rate for the Asymptotic Optimality of Whittle Index Policy

We evaluate the performance of Whittle index policy for restless Markovi...
research
09/18/2019

Fixed Point Analysis of Douglas-Rachford Splitting for Ptychography and Phase Retrieval

Douglas-Rachford Splitting (DRS) methods based on the proximal point alg...
research
06/16/2022

Optimization-Derived Learning with Essential Convergence Analysis of Training and Hyper-training

Recently, Optimization-Derived Learning (ODL) has attracted attention fr...
research
11/22/2021

Feature extraction of machine learning and phase transition point of Ising model

We study the features extracted by the Restricted Boltzmann Machine (RBM...

Please sign up or login with your details

Forgot password? Click here to reset