Search arXivSearch

arXiv · 2107.07744

PDE-constrained shape optimization: towards product shape spaces and stochastic models

Abstract

Shape optimization models with one or more shapes are considered in this chapter. Of particular interest for applications are problems in which where a so-called shape functional is constrained by a partial differential equation (PDE) describing the underlying physics. A connection can made between a classical view of shape optimization and the differential-geometric structure of shape spaces. To handle problems where a shape functional depends on multiple shapes, a theoretical framework is presented, whereby the optimization variable can be represented as a vector of shapes belonging to a product shape space. The multi-shape gradient and multi-shape derivative are defined, which allows for a rigorous justification of a steepest descent method with Armijo backtracking. As long as the shapes as subsets of a hold-all domain do not intersect, solving a single deformation equation is enough to provide descent directions with respect to each shape. Additionally, a framework for handling uncertainties arising from inputs or parameters in the PDE is presented. To handle potentially high-dimensional stochastic spaces, a stochastic gradient method is proposed. A model problem is constructed, demonstrating how uncertainty can be introduced into the problem and the objective can be transformed by use of the expectation. Finally, numerical experiments in the deterministic and stochastic case are devised, which demonstrate the effectiveness of the presented algorithms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Caroline Geiersbach, Estefania Loayza-Romero, Kathrin Welker. 2021-07-16. PDE-constrained shape optimization: towards product shape spaces and stochastic models. https://arxiv.org/abs/2107.07744

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC