Non-convex shape optimization by dissipative Hamiltonian flows

被引:0
|
作者
Bolten, M. [1 ]
Doganay, O. T. [1 ]
Gottschalk, H. [2 ]
Klamroth, K. [1 ]
机构
[1] Univ Wuppertal, Sch Math & Nat Sci, IMACM, Wuppertal, Germany
[2] Tech Univ Berlin, Inst Math, Berlin, Germany
关键词
Shape optimization; non-convexity; momentum; dissipative Hamiltonian flows; FAILURE PROBABILITY; ASYMPTOTIC ANALYSIS; HEAVY-BALL; CONVERGENCE; SYSTEMS; DESIGN; ALGORITHM; EQUATIONS; IPIANO;
D O I
10.1080/0305215X.2024.2304135
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Shape optimization is important for improving the performance of mechanical components. In the past, gradient based optimization methods using the elegant adjoint formalism dominated the field. Gradient descent optimization, however, tends to get stuck in local minima if the optimization problem is non-convex. In this article, an improved approach to shape optimization is proposed that is capable of overcoming local minima. It is motivated by gradient based training methods in machine learning, which involve momentum. Here, the momentum method is derived from the formalism of dissipative Hamiltonian flows, which generalize gradient flows. While gradient descent can be seen as an Euler scheme discretization of the gradient flow, a symplectic Euler scheme is proposed in this article to discretize the Hamiltonian dynamics for the momentum method. To show the efficiency of the method, it is applied to a shape optimization problem involving ceramic components, with reliability, volume and avoidance of construction space constraints as target functions. Construction space constraints lead to manifestly non-convex shape optimization problems. Numerical experiments demonstrate that the proposed method solves these non-convex problems more efficiently than the traditional gradient descent approach.
引用
收藏
页数:20
相关论文
共 50 条
  • [1] Non-Convex Optimization: A Review
    Trehan, Dhruv
    [J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND CONTROL SYSTEMS (ICICCS 2020), 2020, : 418 - 423
  • [2] Non-convex scenario optimization
    Garatti, Simone
    Campi, Marco C.
    [J]. MATHEMATICAL PROGRAMMING, 2024,
  • [3] Non-Convex Distributed Optimization
    Tatarenko, Tatiana
    Touri, Behrouz
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2017, 62 (08) : 3744 - 3757
  • [4] DUALITY IN NON-CONVEX OPTIMIZATION
    TOLAND, JF
    [J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1978, 66 (02) : 399 - 415
  • [5] Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter
    Allen-Zhu, Zeyuan
    [J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 70, 2017, 70
  • [6] Parallel continuous non-convex optimization
    Holmqvist, K
    Migdalas, A
    Pardalos, PM
    [J]. PARALLEL COMPUTING IN OPTIMIZATION, 1997, 7 : 471 - 527
  • [7] Replica Exchange for Non-Convex Optimization
    Dong, Jing
    Tong, Xin T.
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [8] Replica exchange for non-convex optimization
    Dong, Jing
    Tong, Xin T.
    [J]. Journal of Machine Learning Research, 2021, 22
  • [9] Gradient Methods for Non-convex Optimization
    Prateek Jain
    [J]. Journal of the Indian Institute of Science, 2019, 99 : 247 - 256
  • [10] Network localization by non-convex optimization
    Saha, Ananya
    Sau, Buddhadeb
    [J]. MOBIMWAREHN'17: PROCEEDINGS OF THE 7TH ACM WORKSHOP ON MOBILITY, INTERFERENCE, AND MIDDLEWARE MANAGEMENT IN HETNETS, 2017,