Source code for cashocs._optimization.shape_optimization.shape_optimization_problem

# Copyright (C) 2020-2024 Sebastian Blauth
#
# This file is part of cashocs.
#
# cashocs is free software: you can redistribute it and/or modify
# it under the terms of the GNU General Public License as published by
# the Free Software Foundation, either version 3 of the License, or
# (at your option) any later version.
#
# cashocs is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with cashocs.  If not, see <https://www.gnu.org/licenses/>.

"""Shape optimization problem."""

from __future__ import annotations

import functools
import subprocess  # nosec B404
from typing import Callable, Dict, List, Optional, TYPE_CHECKING, Union

import dolfin.function.argument
import fenics
import numpy as np

try:
    import ufl_legacy as ufl
except ImportError:
    import ufl

from cashocs import _exceptions
from cashocs import _forms
from cashocs import _loggers
from cashocs import _pde_problems
from cashocs import _utils
from cashocs import geometry
from cashocs import io
from cashocs._optimization import cost_functional
from cashocs._optimization import line_search as ls
from cashocs._optimization import optimization_algorithms
from cashocs._optimization import optimization_problem
from cashocs._optimization import verification
from cashocs._optimization.shape_optimization import mesh_constraint_manager
from cashocs._optimization.shape_optimization import shape_variable_abstractions
from cashocs.geometry import mesh_testing

if TYPE_CHECKING:
    from cashocs import _typing


CallableFunction = type(lambda: ())


[docs] class ShapeOptimizationProblem(optimization_problem.OptimizationProblem): r"""A shape optimization problem. This class is used to define a shape optimization problem, and to solve it subsequently. For a detailed documentation, we refer to the :ref:`tutorial <tutorial_index>`. For easier input, when consider single (state or control) variables, these do not have to be wrapped into a list. Note, that in the case of multiple variables these have to be grouped into ordered lists, where ``state_forms``, ``bcs_list``, ``states``, ``adjoints`` have to have the same order (i.e. ``[y1, y2]`` and ``[p1, p2]``, where ``p1`` is the adjoint of ``y1`` and so on). """ @functools.singledispatchmethod # type: ignore def __init__( self, state_forms: Union[List[ufl.Form], ufl.Form], bcs_list: Union[ List[List[fenics.DirichletBC]], List[fenics.DirichletBC], fenics.DirichletBC, ], cost_functional_form: Union[ List[_typing.CostFunctional], _typing.CostFunctional ], states: Union[List[fenics.Function], fenics.Function], adjoints: Union[List[fenics.Function], fenics.Function], boundaries: fenics.MeshFunction, config: Optional[io.Config] = None, shape_scalar_product: Optional[ufl.Form] = None, initial_guess: Optional[List[fenics.Function]] = None, ksp_options: Optional[Union[_typing.KspOption, List[_typing.KspOption]]] = None, adjoint_ksp_options: Optional[ Union[_typing.KspOption, List[_typing.KspOption]] ] = None, gradient_ksp_options: Optional[ Union[_typing.KspOption, List[_typing.KspOption]] ] = None, desired_weights: Optional[List[float]] = None, temp_dict: Optional[Dict] = None, initial_function_values: Optional[List[float]] = None, preconditioner_forms: Optional[Union[List[ufl.Form], ufl.Form]] = None, pre_callback: Optional[Callable] = None, post_callback: Optional[Callable] = None, linear_solver: Optional[_utils.linalg.LinearSolver] = None, adjoint_linear_solver: Optional[_utils.linalg.LinearSolver] = None, newton_linearizations: Optional[Union[ufl.Form, List[ufl.Form]]] = None, ) -> None: """Initializes self. Args: state_forms: The weak form of the state equation (user implemented). Can be either a single UFL form, or a (ordered) list of UFL forms. bcs_list: The list of :py:class:`fenics.DirichletBC` objects describing Dirichlet (essential) boundary conditions. If this is ``None``, then no Dirichlet boundary conditions are imposed. cost_functional_form: UFL form of the cost functional. Can also be a list of summands of the cost functional states: The state variable(s), can either be a :py:class:`fenics.Function`, or a list of these. adjoints: The adjoint variable(s), can either be a :py:class:`fenics.Function`, or a (ordered) list of these. boundaries: A :py:class:`fenics.MeshFunction` that indicates the boundary markers. config: The config file for the problem, generated via :py:func:`cashocs.load_config`. Alternatively, this can also be ``None``, in which case the default configurations are used, except for the optimization algorithm. This has then to be specified in the :py:meth:`solve <cashocs.OptimalControlProblem.solve>` method. The default is ``None``. shape_scalar_product: The bilinear form for computing the shape gradient (or gradient deformation). This has to use :py:class:`fenics.TrialFunction` and :py:class:`fenics.TestFunction` objects to define the weak form, which have to be in a :py:class:`fenics.VectorFunctionSpace` of continuous, linear Lagrange finite elements. Moreover, this form is required to be symmetric. initial_guess: List of functions that act as initial guess for the state variables, should be valid input for :py:func:`fenics.assign`. Defaults to ``None``, which means a zero initial guess. ksp_options: A list of dicts corresponding to command line options for PETSc, used to solve the state systems. If this is ``None``, then the direct solver mumps is used (default is ``None``). adjoint_ksp_options: A list of dicts corresponding to command line options for PETSc, used to solve the adjoint systems. If this is ``None``, then the same options as for the state systems are used (default is ``None``). gradient_ksp_options: A list of dicts corresponding to command line options for PETSc, used to compute the (shape) gradient. If this is ``None``, either a direct or an iterative method is used (depending on the configuration, section OptimizationRoutine, key gradient_method). desired_weights: A list of values for scaling the cost functional terms. If this is supplied, the cost functional has to be given as list of summands. The individual terms are then scaled, so that term `i` has the magnitude of `desired_weights[i]` for the initial iteration. In case that `desired_weights` is `None`, no scaling is performed. Default is `None`. temp_dict: This is a private parameter of the class, required for remeshing. This parameter must not be set by the user and should be ignored. Using this parameter may result in unintended side effects. initial_function_values: This is a privatve parameter of the class, required for remeshing. This parameter must not be set by the user and should be ignored. Using this parameter may result in unintended side effects. preconditioner_forms: The list of forms for the preconditioner. The default is `None`, so that the preconditioner matrix is the same as the system matrix. pre_callback: A function (without arguments) that will be called before each solve of the state system post_callback: A function (without arguments) that will be called after the computation of the gradient. linear_solver: The linear solver (KSP) which is used to solve the linear systems arising from the discretized PDE. adjoint_linear_solver: The linear solver (KSP) which is used to solve the (linear) adjoint system. newton_linearizations: A (list of) UFL forms describing which (alternative) linearizations should be used for the (nonlinear) state equations when solving them (with Newton's method). The default is `None`, so that the Jacobian of the supplied state forms is used. """ super().__init__( state_forms, bcs_list, cost_functional_form, states, adjoints, config=config, initial_guess=initial_guess, ksp_options=ksp_options, adjoint_ksp_options=adjoint_ksp_options, gradient_ksp_options=gradient_ksp_options, desired_weights=desired_weights, temp_dict=temp_dict, initial_function_values=initial_function_values, preconditioner_forms=preconditioner_forms, pre_callback=pre_callback, post_callback=post_callback, linear_solver=linear_solver, adjoint_linear_solver=adjoint_linear_solver, newton_linearizations=newton_linearizations, ) if shape_scalar_product is None: deformation_space: fenics.FunctionSpace = fenics.VectorFunctionSpace( self.db.geometry_db.mesh, "CG", 1 ) else: deformation_space = shape_scalar_product.arguments()[0].ufl_function_space() self.db.function_db.control_spaces = [deformation_space] self.db.function_db.gradient = [ fenics.Function(self.db.function_db.control_spaces[0]) ] self.db.parameter_db.problem_type = "shape" if self.config.getboolean("ShapeGradient", "global_deformation"): self.db.geometry_db.init_transfer_matrix() # Initialize the remeshing behavior, and a temp file self.do_remesh = self.config.getboolean("Mesh", "remesh") self._remesh_init() self.boundaries: fenics.MeshFunction = boundaries self.shape_scalar_product: ufl.Form = shape_scalar_product if self.shape_scalar_product is not None: self.uses_custom_scalar_product = True if self.uses_custom_scalar_product and self.config.getboolean( "ShapeGradient", "use_p_laplacian" ): _loggers.warning( ( "You have supplied a custom scalar product and set the parameter " "``use_p_laplacian`` in the config file." "cashocs will use the supplied scalar product and not the " "p-Laplacian to compute the shape gradient." ) ) self.shape_regularization = _forms.shape_regularization.ShapeRegularization( self.db ) self.form_handler: _forms.ShapeFormHandler = _forms.ShapeFormHandler( self, self.db, self.shape_regularization ) if self.db.parameter_db.temp_dict: self.db.parameter_db.temp_dict["Regularization"] = { "mu_volume": self.shape_regularization.volume_regularization.mu, "mu_surface": self.shape_regularization.surface_regularization.mu, "mu_curvature": self.shape_regularization.curvature_regularization.mu, "mu_barycenter": self.shape_regularization.barycenter_regularization.mu, } a_priori_tester = mesh_testing.APrioriMeshTester(self.db.geometry_db.mesh) intersection_tester = mesh_testing.IntersectionTester(self.db.geometry_db.mesh) # pylint: disable=protected-access self.mesh_handler: geometry._MeshHandler = geometry._MeshHandler( self.db, self.form_handler, a_priori_tester, intersection_tester ) self.state_spaces = self.db.function_db.state_spaces self.adjoint_spaces = self.db.function_db.adjoint_spaces self.gradient_problem = _pde_problems.ShapeGradientProblem( self.db, self.form_handler, self.state_problem, self.adjoint_problem ) self.reduced_cost_functional = cost_functional.ReducedCostFunctional( self.db, self.form_handler, self.state_problem ) self.constraint_manager: mesh_constraint_manager.ConstraintManager = ( mesh_constraint_manager.ConstraintManager( self.config, self.mesh_handler.mesh, self.boundaries, self.db.function_db.control_spaces[0], ) ) self.optimization_variable_abstractions = ( shape_variable_abstractions.ShapeVariableAbstractions( self, self.db, self.constraint_manager ) ) if bool(desired_weights is not None): self._scale_cost_functional() self.__init__( # type: ignore # pylint: disable=unnecessary-dunder-call state_forms, bcs_list, cost_functional_form, states, adjoints, boundaries, config=config, shape_scalar_product=shape_scalar_product, initial_guess=initial_guess, ksp_options=ksp_options, adjoint_ksp_options=adjoint_ksp_options, gradient_ksp_options=gradient_ksp_options, desired_weights=None, temp_dict=temp_dict, initial_function_values=self.initial_function_values, preconditioner_forms=preconditioner_forms, pre_callback=pre_callback, post_callback=post_callback, linear_solver=linear_solver, adjoint_linear_solver=adjoint_linear_solver, newton_linearizations=newton_linearizations, ) @__init__.register(CallableFunction) def _(self, mesh_parametrization: Callable, mesh_name: str) -> None: """Initializes self. Version for remeshing. Args: mesh_parametrization: A custom function, which takes the path to the mesh file as argument and returns either just the positional arguments or the positional and keyword arguments for the standard __init__ implementation. mesh_name: The path to the initial mesh file. """ self.mesh_parametrization: Callable = mesh_parametrization self.mesh_name = mesh_name arguments = self.mesh_parametrization(self.mesh_name) if len(arguments) == 2: args, kwargs = arguments elif len(arguments) == 1: args = arguments kwargs = {} else: raise _exceptions.CashocsException( "For remeshing, the mesh_parametrization function" " must either return one or two objects." ) if hasattr(self, "db") and self.db.parameter_db.temp_dict: kwargs["temp_dict"] = self.db.parameter_db.temp_dict self.__init__( # type: ignore # pylint: disable=unnecessary-dunder-call *args, **kwargs ) def _remesh_init(self) -> None: """Initializes self for remeshing.""" if self.do_remesh: if not self.db.parameter_db.is_remeshed: self.db.parameter_db.temp_dict.update( { "gmsh_file": self.config.get("Mesh", "gmsh_file"), "geo_file": self.config.get("Mesh", "geo_file"), "OptimizationRoutine": { "iteration_counter": 0, "gradient_norm_initial": 0.0, }, "output_dict": {}, } ) def _erase_pde_memory(self) -> None: """Resets the memory of the PDE problems so that new solutions are computed. This sets the value of has_solution to False for all relevant PDE problems, where memory is stored. """ super()._erase_pde_memory() self.mesh_handler.bbtree.build(self.mesh_handler.mesh) self.form_handler.update_scalar_product() self.gradient_problem.has_solution = False def _setup_solver(self) -> optimization_algorithms.OptimizationAlgorithm: line_search_type = self.config.get("LineSearch", "method").casefold() if line_search_type == "armijo": line_search: ls.LineSearch = ls.ArmijoLineSearch(self.db, self) elif line_search_type == "polynomial": line_search = ls.PolynomialLineSearch(self.db, self) else: raise _exceptions.CashocsException("This code cannot be reached.") if self.config.getboolean("ShapeGradient", "global_deformation"): self.global_deformation_vector = line_search.global_deformation_vector self.global_deformation_function = line_search.deformation_function if self.algorithm.casefold() == "gradient_descent": solver: optimization_algorithms.OptimizationAlgorithm = ( optimization_algorithms.GradientDescentMethod( self.db, self, line_search ) ) elif self.algorithm.casefold() == "lbfgs": solver = optimization_algorithms.LBFGSMethod(self.db, self, line_search) elif self.algorithm.casefold() == "conjugate_gradient": solver = optimization_algorithms.NonlinearCGMethod( self.db, self, line_search ) elif self.algorithm.casefold() == "none": raise _exceptions.InputError( "cashocs.OptimalControlProblem.solve", "algorithm", "You did not specify a solution algorithm in your config file. " "You have to specify one in the solve " "method. Needs to be one of 'gradient_descent' ('gd'), " "'lbfgs' ('bfgs'), or 'conjugate_gradient' ('cg').", ) else: raise _exceptions.CashocsException("This code cannot be reached.") return solver
[docs] def solve( self, algorithm: Optional[str] = None, rtol: Optional[float] = None, atol: Optional[float] = None, max_iter: Optional[int] = None, ) -> None: r"""Solves the optimization problem by the method specified in the config file. Args: algorithm: Selects the optimization algorithm. Valid choices are ``'gradient_descent'`` or ``'gd'`` for a gradient descent method, ``'conjugate_gradient'``, ``'nonlinear_cg'``, ``'ncg'`` or ``'cg'`` for nonlinear conjugate gradient methods, and ``'lbfgs'`` or ``'bfgs'`` for limited memory BFGS methods. This overwrites the value specified in the config file. If this is ``None``, then the value in the config file is used. Default is ``None``. rtol: The relative tolerance used for the termination criterion. Overwrites the value specified in the config file. If this is ``None``, the value from the config file is taken. Default is ``None``. atol: The absolute tolerance used for the termination criterion. Overwrites the value specified in the config file. If this is ``None``, the value from the config file is taken. Default is ``None``. max_iter: The maximum number of iterations the optimization algorithm can carry out before it is terminated. Overwrites the value specified in the config file. If this is ``None``, the value from the config file is taken. Default is ``None``. Notes: If either ``rtol`` or ``atol`` are specified as arguments to the ``.solve`` call, the termination criterion changes to: - a purely relative one (if only ``rtol`` is specified), i.e., .. math:: || \nabla J(u_k) || \leq \texttt{rtol} || \nabla J(u_0) ||. - a purely absolute one (if only ``atol`` is specified), i.e., .. math:: || \nabla J(u_K) || \leq \texttt{atol}. - a combined one if both ``rtol`` and ``atol`` are specified, i.e., .. math:: || \nabla J(u_k) || \leq \texttt{atol} + \texttt{rtol} || \nabla J(u_0) || """ super().solve(algorithm=algorithm, rtol=rtol, atol=atol, max_iter=max_iter) self.solver = self._setup_solver() try: self.solver.run() except BaseException as e: if len(self.db.parameter_db.remesh_directory) > 0: self._clear_remesh_directory() raise e self.solver.post_processing()
def _clear_remesh_directory(self) -> None: _loggers.debug("An exception was raised, deleting the created temporary files.") if ( not self.config.getboolean("Debug", "remeshing") and fenics.MPI.rank(fenics.MPI.comm_world) == 0 ): subprocess.run( # nosec B603, B607 ["rm", "-r", self.db.parameter_db.remesh_directory], check=False ) fenics.MPI.barrier(fenics.MPI.comm_world)
[docs] def compute_shape_gradient(self) -> List[fenics.Function]: """Solves the Riesz problem to determine the shape gradient. This can be used for debugging, or code validation. The necessary solutions of the state and adjoint systems are carried out automatically. Returns: A list containing the shape gradient. """ self.gradient_problem.solve() return self.db.function_db.gradient
[docs] def supply_shape_derivative(self, shape_derivative: ufl.Form) -> None: """Overrides the shape derivative of the reduced cost functional. This allows users to implement their own shape derivative and use cashocs as a solver library only. Args: shape_derivative: The shape_derivative of the reduced cost functional. """ if ( not shape_derivative.arguments()[0].ufl_function_space() == self.db.function_db.control_spaces[0] ): shape_derivative = ufl.replace( shape_derivative, {shape_derivative.arguments()[0]: self.form_handler.test_vector_field}, ) ( self.form_handler.modified_scalar_product, self.form_handler.assembler, ) = self.form_handler.setup_assembler( self.form_handler.riesz_scalar_product, shape_derivative, self.form_handler.bcs_shape, ) self.has_custom_derivative = True
[docs] def supply_custom_forms( self, shape_derivative: ufl.Form, adjoint_forms: Union[ufl.Form, List[ufl.Form]], adjoint_bcs_list: Union[ fenics.DirichletBC, List[fenics.DirichletBC], List[List[fenics.DirichletBC]] ], ) -> None: """Overrides both adjoint system and shape derivative with user input. This allows the user to specify both the shape_derivative of the reduced cost functional and the corresponding adjoint system, and allows them to use cashocs as a solver. Args: shape_derivative: The shape derivative of the reduced (!) cost functional. adjoint_forms: The UFL forms of the adjoint system(s). adjoint_bcs_list: The list of Dirichlet boundary conditions for the adjoint system(s). """ self.supply_shape_derivative(shape_derivative) self.supply_adjoint_forms(adjoint_forms, adjoint_bcs_list)
[docs] def get_vector_field(self) -> dolfin.function.argument.Argument: """Returns the TestFunction for defining shape derivatives. Returns: The TestFunction object. """ return self.form_handler.test_vector_field
[docs] def gradient_test( self, h: Optional[fenics.Function] = None, rng: Optional[np.random.RandomState] = None, ) -> float: """Performs a Taylor test to verify that the computed shape gradient is correct. Args: h: The direction used to compute the directional derivative. If this is ``None``, then a random direction is used (default is ``None``). rng: A numpy random state for calculating a random direction Returns: The convergence order from the Taylor test. If this is (approximately) 2 or larger, everything works as expected. """ return verification.shape_gradient_test(self, h, rng)