Shape Optimization with Nonlinear Conjugate Gradient Methods
arXiv:2201.05394 · doi:10.1007/978-3-031-20432-6_9
Abstract
In this chapter, we investigate recently proposed nonlinear conjugate gradient (NCG) methods for shape optimization problems. We briefly introduce the methods as well as the corresponding theoretical background and investigate their performance numerically. The obtained results confirm that the NCG methods are efficient and attractive solution algorithms for shape optimization problems.
References in corpus (6)
- Efficient PDE constrained shape optimization based on Steklov-Poincaré type metrics
- Shape optimization of an electric motor subject to nonlinear magnetostatics
- A Riemannian View on Shape Optimization
- cashocs: A Computational, Adjoint-Based Shape Optimization and Optimal Control Software
- Nonlinear Conjugate Gradient Methods for PDE Constrained Shape Optimization Based on Steklov-Poincaré-Type Metrics
- Shape Sensitivity Analysis for a Microchannel Cooling System