Constraint interface preconditioning for topology optimization problems

DOI10.1137/140980387MaRDI QIDQ6266469arXivFDO

Authors Michal Kočvara, Daniel Loghin, J. Turner

Publication date 15 October 2015

Published in arXiv

Full work available at URL https://doi.org/10.1137/140980387

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Iterative numerical methods for linear systems (65F10) Numerical optimization and variational techniques (65K10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Interior-point methods (90C51)

arXiv classification

math.NAmath.OC

Abstract: The discretization of constrained nonlinear optimization problems arising in the field of topology optimization yields algebraic systems which are challenging to solve in practice, due to pathological ill-conditioning, strong nonlinearity and size. In this work we propose a methodology which brings together existing fast algorithms, namely, interior-point for the optimization problem and a novel substructuring domain decomposition method for the ensuing large-scale linear systems. The main contribution is the choice of interface preconditioner which allows for the acceleration of the domain decomposition method, leading to performance independent of problem size.

This page was built for publication: Constraint interface preconditioning for topology optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6266469)