Comparison of FETI-based domain decomposition methods for topology optimization problems

11/23/2021
by   Tomáš Medřický, et al.
0

We critically assess the performance of several variants of dual and dual-primal domain decomposition strategies in problems with fixed subdomain partitioning and high heterogeneity in stiffness coefficients typically arising in topology optimization of modular structures. Our study considers Total FETI and FETI Dual-Primal methods along with three enhancements: k-scaling, full orthogonalization of the search directions, and considering multiple search-direction at once, which gives us twelve variants in total. We test these variants both on academic examples and snapshots of topology optimization iterations. Based on the results, we conclude that (i) the original methods exhibit very slow convergence in the presence of severe heterogeneity in stiffness coefficients, which makes them practically useless, (ii) the full orthogonalization enhancement helps only for mild heterogeneity, and (iii) the only robust method is FETI Dual-Primal with multiple search direction and k-scaling.

READ FULL TEXT

page 5

page 6

research
01/02/2022

Primal-Dual Method for Optimization Problems with Changing Constraints

We propose a modified primal-dual method for general convex optimization...
research
01/13/2022

Chambolle-Pock's Primal-Dual Method with Mismatched Adjoint

The primal-dual method of Chambolle and Pock is a widely used algorithm ...
research
04/24/2020

Computing multiple solutions of topology optimization problems

Topology optimization problems often support multiple local minima due t...
research
03/21/2017

Stochastic Primal Dual Coordinate Method with Non-Uniform Sampling Based on Optimality Violations

We study primal-dual type stochastic optimization algorithms with non-un...
research
09/14/2017

Random matrix approach for primal-dual portfolio optimization problems

In this paper, we revisit the portfolio optimization problems of the min...
research
08/09/2018

Improved linear programming methods for checking avoiding sure loss

We review the simplex method and two interior-point methods (the affine ...
research
11/17/2020

Simple Iterative Methods for Linear Optimization over Convex Sets

We give simple iterative methods for computing approximately optimal pri...

Please sign up or login with your details

Forgot password? Click here to reset