Abstract
A standard approach to the minimization of an objective function in the presence of equality constraints in Mathematical Programming or of a state equation in Control Theory is the introduction of Lagrange multipliers or an adjoint state, that is, a linear penalization of the equality constraints or the state equation. The initial minimization problem is equivalent to the minimax of the associated Lagrangian. This approach can also be used to compute the one-sided directional derivative with respect to the control or the shape or topology of a family of sets. It is sufficient to consider a Lagrangian parametrized by a positive parameter t > 0 as t goes to 0. This involves the introduction of some forms of equation for the multiplier or the adjoint state at t > 0. The simplest one is the standard adjoint, but other forms of closely related adjoint such as the quasi adjoint in Serovaiskii (Mat Zametki 54(2):85–95, 159, 1993; translation in Math Notes 54(1–2):825–832, 1994) and Kogut et al. (Z Anal Anwend (J Anal Appl) 34(2):199–219, 2015) or the new averaged adjoint in Sturm (On shape optimization with non-linear partial differential equations, Doctoral thesis, Technische Universiltat of Berlin, 2014; SIAM J Control Optim 53(4):2017–2039, 2015) can be considered. In general, the various forms of adjoints coincide at t = 0. For instance, by using the averaged adjoint, the minimax problem need not be related to a saddle point as in Correa-Seeger (Nonlinear Anal Theory Methods Appl 9:13–22, 1985) and the so-called dual problem need not make sense.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have