Efficient and accurate separable models for discrete material optimization: A continuous perspective

02/10/2023
by   Peter Gangl, et al.
0

Multi-material design optimization problems can, after discretization, be solved by the iterative solution of simpler sub-problems which approximate the original problem at an expansion point to first order. In particular, models constructed from convex separable first order approximations have a long and successful tradition in the design optimization community and have led to powerful optimization tools like the prominently used method of moving asymptotes (MMA). In this paper, we introduce several new separable approximations to a model problem and examine them in terms of accuracy and fast evaluation. The models can, in general, be nonconvex and are based on the Sherman-Morrison-Woodbury matrix identity on the one hand, and on the mathematical concept of topological derivatives on the other hand. We show a surprising relation between two models originating from these two – at a first sight – very different concepts. Numerical experiments show a high level of accuracy for two of our proposed models while also their evaluation can be performed efficiently once enough data has been precomputed in an offline phase. Additionally it is demonstrated that suboptimal decisions can be avoided using our most accurate models.

READ FULL TEXT

page 17

page 18

page 23

page 25

page 31

page 33

page 36

page 38

research
11/21/2016

Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity Problems

In this work we show how sublabel-accurate multilabeling approaches can ...
research
12/23/2021

Integrating Material Selection with Design Optimization via Neural Networks

The engineering design process often entails optimizing the underlying g...
research
06/13/2019

Non-convex optimization via strongly convex majoirziation-minimization

In this paper, we introduce a class of nonsmooth nonconvex least square ...
research
10/24/2018

Nonconvex and Nonsmooth Sparse Optimization via Adaptively Iterative Reweighted Methods

We present a general formulation of nonconvex and nonsmooth sparse optim...
research
07/08/2022

Tightening Discretization-based MILP Models for the Pooling Problem using Upper Bounds on Bilinear Terms

Discretization-based methods have been proposed for solving nonconvex op...
research
12/06/2017

Bivariate Separable-Dimension Glyphs can Improve Visual Analysis of Holistic Features

We introduce the cause of the inefficiency of bivariate glyphs by defini...

Please sign up or login with your details

Forgot password? Click here to reset