Structure Exploiting Interior Point Methods

07/11/2019
by   Juraj Kardoš, et al.
0

Interior point methods are among the most popular techniques for large scale nonlinear optimization, owing to their intrinsic ability of scaling to arbitrary large problem sizes. Their efficiency has attracted in recent years a lot of attention due to increasing demand for large scale optimization in industry and engineering. A parallel interior point method is discussed that exploits the intrinsic structure of large-scale nonlinear optimization problems so that the solution process can employ massively parallel high-performance computing infastructures. Since the overall performance of interior point methods relies heavily on scalable sparse linear algebra solvers, particular emphasis is given to the underlying algorithms for the distributed solution of the associated sparse linear systems obtained at each iteration from the linearization of the optimality conditions. The interior point algorithm is implemented in a object-oriented parallel IPM solver and applied for the solution of large scale optimal control problems solved in a daily basis for the secure transmission and distribution of electricity in modern power grids.

READ FULL TEXT
research
02/15/2021

Chronos: A general purpose classical AMG solver for High Performance Computing

The numerical simulation of the physical systems has become in recent ye...
research
01/29/2020

Reduced-Space Interior Point Methods in Power Grid Problems

Due to critical environmental issues, the power systems have to accommod...
research
05/17/2018

Parallel and Distributed Successive Convex Approximation Methods for Big-Data Optimization

Recent years have witnessed a surge of interest in parallel and distribu...
research
12/09/2021

A Preconditioned Inexact Active-Set Method for Large-Scale Nonlinear Optimal Control Problems

We provide a global convergence proof of the recently proposed sequentia...
research
09/25/2020

Compressed Basis GMRES on High Performance GPUs

Krylov methods provide a fast and highly parallel numerical tool for the...
research
10/24/2015

Fast and Scalable Lasso via Stochastic Frank-Wolfe Methods with a Convergence Guarantee

Frank-Wolfe (FW) algorithms have been often proposed over the last few y...
research
01/10/2019

Harnessing the Power of Serverless Runtimes for Large-Scale Optimization

The event-driven and elastic nature of serverless runtimes makes them a ...

Please sign up or login with your details

Forgot password? Click here to reset