Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Optimization and Control

arXiv:2101.11740 (math)
[Submitted on 27 Jan 2021 (v1), last revised 17 Jan 2022 (this version, v3)]

Title:Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

Authors:Johannes J. Brust, Mihai Anitescu
View PDF
Abstract: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.
Subjects: Optimization and Control (math.OC); Systems and Control (eess.SY); Computation (stat.CO)
Report number: ANL/MCS-P9431-0121
Cite as: arXiv:2101.11740 [math.OC]
  (or arXiv:2101.11740v3 [math.OC] for this version)
  https://doi.org/10.48550/arXiv.2101.11740
Journal reference: IEEE Trans. Pow. Sys. 37(6), 2022
Related DOI: https://doi.org/10.1109/TPWRS.2022.3146873

Submission history

From: Johannes Brust [view email]
[v1] Wed, 27 Jan 2021 23:31:56 UTC (5,633 KB)
[v2] Thu, 12 Aug 2021 14:45:24 UTC (5,715 KB)
[v3] Mon, 17 Jan 2022 23:49:38 UTC (5,736 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
math.OC
< prev   |   next >
new | recent | 2021-01
Change to browse by:
cs
cs.SY
eess
eess.SY
math
stat
stat.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)