Original title unknown
This paper is concerned with a PDE-constrained optimization problem of induction heating, where the state equations consist of 3D time-dependent heat equations coupled with 3D time-harmonic eddy current equations. The control parameters are given by finite real numbers representing applied alternating voltages which enter the eddy current equations via impressed current. The optimization problem is to find optimal voltages so that, under certain constraints on the voltages and the temperature, a...
This paper is concerned with a PDE-constrained optimization problem of induction heating, where the state equations consist of 3D time-dependent heat equations coupled with 3D time-harmonic eddy current equations. The control parameters are given by finite real numbers representing applied alternating voltages which enter the eddy current equations via impressed current. The optimization problem is to find optimal voltages so that, under certain constraints on the voltages and the temperature, a...
Penalty methods, augmented Lagrangian methods and Nitsche mortaring are well known numerical methods among the specialists in the related areas optimization and finite elements, respectively, but common aspects are rarely available. The aim of the present paper is to describe these methods from a unifying optimization perspective and to highlight some common features of them.
In this article, given a reference feasible trajectory of an optimal control problem, we say that the quadratic growth property for bounded strong solutions holds if the cost function of the problem has a quadratic growth over the set of feasible trajectories with a bounded control and with a state variable sufficiently close to the reference state variable. Our sufficient second-order optimality conditions in Pontryagin form ensure this property and ensure a fortiori that the reference trajectory...
Let be a real Hilbert space, a convex function of class that we wish to minimize under the convex constraint . A classical approach consists in following the trajectories of the generalized steepest descent system (cf. Brézis [5]) applied to the non-smooth function . Following Antipin [1], it is also possible to use a continuous gradient-projection system. We propose here an alternative method as follows: given a smooth convex function whose critical points coincide with and a control...
Let H be a real Hilbert space, a convex function of class that we wish to minimize under the convex constraint S. A classical approach consists in following the trajectories of the generalized steepest descent system (cf. Brézis [CITE]) applied to the non-smooth function . Following Antipin [1], it is also possible to use a continuous gradient-projection system. We propose here an alternative method as follows: given a smooth convex function whose critical points coincide with S and...
Standard facts about separating linear functionals will be used to determine how two cones and and their duals and may overlap. When is linear and and are cones, these results will be applied to and , giving a unified treatment of several theorems of the alternate which explain when contains an interior point of . The case when is the space of Hermitian matrices, is the positive semidefinite matrices, and yields new and known results about the existence of block diagonal...