Generalized augmented Lagrangian problem and approximate optimal solutions in nonlinear programming.
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...
We consider the identification of a distributed parameter in an elliptic variational inequality. On the basis of an optimal control problem formulation, the application of a primal-dual penalization technique enables us to prove the existence of multipliers giving a first order characterization of the optimal solution. Concerning the parameter we consider different regularity requirements. For the numerical realization we utilize a complementarity function, which allows us to rewrite the optimality...
This paper deals with variational inclusions of the form 0 ∈ φ(x) + F(x) where φ is a single-valued function admitting a second order Fréchet derivative and F is a set-valued map from to the closed subsets of . When a solution z̅ of the previous inclusion satisfies some semistability properties, we obtain local superquadratic or cubic convergent sequences.
This paper synopsis a new solution for Permanent Magnets Linear Generator (PMLG) state estimation subject to bounded uncertainty. Therefore, a PMLG modeling method is presented based on an equivalent circuit, wherein a mathematical model of the generator adapted to wave energy conversion is established. Then, using the Linear Matrix Inequality (LMI) optimization and a Lyapunov function, this system's Sliding Mode Observer (SMO) design method is developed. Consequently, the proposed observer can...
We approximate, in the sense of Γ-convergence, free-discontinuity functionals with linear growth in the gradient by a sequence of non-local integral functionals depending on the average of the gradients on small balls. The result extends to higher dimension what we already proved in the one-dimensional case.
In this work we deal with the numerical solution of a Hamilton-Jacobi-Bellman (HJB) equation with infinitely many solutions. To compute the maximal solution – the optimal cost of the original optimal control problem – we present a complete discrete method based on the use of some finite elements and penalization techniques.
We deal with practical aspects of an approach to the numerical realization of optimal shape design problems, which is based on a combination of the fictitious domain method with the optimal control approach. Introducing a new control variable in the right-hand side of the state problem, the original problem is transformed into a new one, where all the calculations are performed on a fixed domain. Some model examples are presented.
We introduce a modification of the Monge–Kantorovitch problem of exponent 2 which accommodates non balanced initial and final densities. The augmented lagrangian numerical method introduced in [6] is adapted to this “unbalanced” problem. We illustrate the usability of this method on an idealized error estimation problem in meteorology.
We introduce a modification of the Monge–Kantorovitch problem of exponent 2 which accommodates non balanced initial and final densities. The augmented Lagrangian numerical method introduced in [6] is adapted to this “unbalanced” problem. We illustrate the usability of this method on an idealized error estimation problem in meteorology.
An optimal control problem governed by a quasilinear parabolic equation with additional constraints is investigated. The optimal control problem is converted to an optimization problem which is solved using a penalty function technique. The existence and uniqueness theorems are investigated. The derivation of formulae for the gradient of the modified function is explainedby solving the adjoint problem.