2014 Power Systems Computation Conference 2014
DOI: 10.1109/pscc.2014.7038374
|View full text |Cite
|
Sign up to set email alerts
|

Structured nonconvex optimization of large-scale energy systems using PIPS-NLP

Abstract: We present PIPS-NLP, a software library for the solution of large-scale structured nonconvex optimization problems on high-performance computers. We discuss the features of the implementation in the context of electrical power and gas network systems. We illustrate how different model structures arise in these domains and how these can be exploited to achieve high computational efficiency. Using computational studies from security-constrained ACOPF and line-pack dispatch in natural gas networks, we demonstrate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
5
2
1

Relationship

2
6

Authors

Journals

citations
Cited by 46 publications
(45 citation statements)
references
References 12 publications
0
45
0
Order By: Relevance
“…There has been recently a lot of interest in the development of efficient methods for stochastic optimal control problems such as stochastic gradient methods [23], the alternating directions method of multipliers (ADMM) [24] and various decomposition methods which can lead to parallelizable methods [25,26] (the most popular being the stochastic dual approximate dynamic programming [27], the progressive hedging approach [28] and dynamic programming [29]). There have been proposed parallelizable interior point algorithms for two-stage stochastic optimal control problems such as [30,31,32,33] and an ad hoc interior point solver for multi-stage problems [34]. However, interior point algorithms involve complex steps and are not suitable for an implementation on GPUs which can make the most of the capabilities of the hardware.…”
Section: State Of the Artmentioning
confidence: 99%
“…There has been recently a lot of interest in the development of efficient methods for stochastic optimal control problems such as stochastic gradient methods [23], the alternating directions method of multipliers (ADMM) [24] and various decomposition methods which can lead to parallelizable methods [25,26] (the most popular being the stochastic dual approximate dynamic programming [27], the progressive hedging approach [28] and dynamic programming [29]). There have been proposed parallelizable interior point algorithms for two-stage stochastic optimal control problems such as [30,31,32,33] and an ad hoc interior point solver for multi-stage problems [34]. However, interior point algorithms involve complex steps and are not suitable for an implementation on GPUs which can make the most of the capabilities of the hardware.…”
Section: State Of the Artmentioning
confidence: 99%
“…When we are interested in finding local solutions , one can use an interior point solver and exploit the underlying linear algebra when computing Newton (search) steps . It is well‐known that the linear algebra system of problem (0.16) (a similar approach can be applied to (0.17)) can be permuted to the following block‐bordered‐diagonal (BBD) form: true[KπB1TB2TB|Ω|TB1K1B2K2B|Ω|K|Ω|true]true[ΔwπΔw1Δw2Δw|Ω|true]=true[rπr1r2r|Ω|true], where Δwπ=(Δπ,Δnormalλπ), Δwξ=(Δyξ,Δnormalλξ) are the Newton steps, Kπ=Wπ Kξ=true[WξJξTJξtrue], ...…”
Section: Computational Toolsmentioning
confidence: 99%
“…To do this, it leverages a hierarchical graph abstraction wherein nodes and edges can be associated with individual JuMP scenario problems that are linked together (e.g., by using non‐anticipativity constraints) . Given a graph structure with models and connections, Plasmo can produce either a pure (flattened) optimization model to be solved using off‐the‐shelf optimization solvers such as IPOPT or it can communicate graph structures to structure‐exploiting solvers such as PIPS‐NLP and SNGO . Modeling and solution capabilities for stochastic programs are also provided by the popular Python‐based package PySP …”
Section: Computational Toolsmentioning
confidence: 99%
“…We solved the coupled and uncoupled models using a 24-hour time horizon with 1-hour time resolu- We solve the NLP using the interior-point optimization solver PIPS-NLP [9], which uses the filter line-search algorithm implemented in IPOPT [22]. PIPS-NLP is used to experiment with different linear algebra solvers and modeling interfaces.…”
Section: Model Solutionmentioning
confidence: 99%