Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 41 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 91 tok/s Pro
Kimi K2 178 tok/s Pro
GPT OSS 120B 474 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Non-convex shape optimization by dissipative Hamiltonian flows (2303.01369v1)

Published 28 Feb 2023 in math.OC, cs.NA, and math.NA

Abstract: Shape optimization with constraints given by partial differential equations (PDE) is a highly developed field of optimization theory. The elegant adjoint formalism allows to compute shape gradients at the computational cost of a further PDE solve. Thus, gradient descent methods can be applied to shape optimization problems. However, gradient descent methods that can be understood as approximation to gradient flows get stuck in local minima, if the optimization problem is non-convex. In machine learning, the optimization in high dimensional non-convex energy landscapes has been successfully tackled by momentum methods, which can be understood as passing from gradient flow to dissipative Hamiltonian flows. In this paper, we adopt this strategy for non-convex shape optimization. In particular, we provide a mechanical shape optimization problem that is motivated by optimal reliability considering also material cost and the necessity to avoid certain obstructions in installation space. We then show how this problem can be solved effectively by port Hamiltonian shape flows.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.