Structure-exploiting interior point methods
From MaRDI portal
Publication:3300491
Abstract: 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.
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- An augmented incomplete factorization approach for computing the Schur complement in stochastic optimization
- An inertia-free filter line-search algorithm for large-scale nonlinear programming
- scientific article; zbMATH DE number 1183039 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Nonlinear programming without a penalty function.
- On the Implementation of a Primal-Dual Interior Point Method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- PARDISO: a high-performance serial and parallel sparse linear solver in semiconductor device simulation
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming
Cited in
(9)- Structure exploitation in an interior-point method for fully discretized, state constrained optimal control problems
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models
- Exploiting structure in parallel implementation of interior point methods for optimization
- Solving security constrained optimal power flow problems by a structure exploiting interior point method
- Exploiting hardware capabilities in interior point methods
- Parallel Processing and Applied Mathematics
- Accelerating condensed interior-point methods on SIMD/GPU architectures
- Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
This page was built for publication: Structure-exploiting interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300491)
