Conception optimale ou identification de formes, calcul rapide de la dérivée directionnelle de la fonction coût
Ce travail porte sur l'optimisation des lignes d'usinage pour la grande série. Une telle ligne comporte plusieurs postes de travail, chacun étant équipé avec boîtiers multibroches. Un boîtier multibroche exécute plusieurs opérations en parallèle. Lors de la conception en avant-projet, il est nécessaire d'affecter toutes les opérations à des boîtiers et des postes de travail de sorte à minimiser le nombre de postes et de boîtiers utilisés. Pour ce nouveau problème d'équilibrage des lignes de production,...
To overcome the somewhat artificial difficulties in classical optimization theory concerning the existence and stability of minimizers, a new setting of constrained optimization problems (called problems with tolerance) is proposed using given proximity structures to define the neighbourhoods of sets. The infimum and the so-called minimizing filter are then defined by means of level sets created by these neighbourhoods, which also reflects the engineering approach to constrained optimization problems....
The paper deals with the approximation of contact problems of two elastic bodies by finite element method. Using piecewise linear finite elements, some error estimates are derived, assuming that the exact solution is sufficiently smooth. If the solution is not regular, the convergence itself is proven. This analysis is given for two types of contact problems: with a bounded contact zone and with enlarging contact zone.
If the material of the bodies is elastic perfectly plastic, obeying the Hencky's law, the formulation in terms of stresses is more suitable than that in displacements. The Haar-Kármán principle is first extended to the case of a unilateral contact between two bodies without friction. Approximations are proposed by means of piecewise constant triangular finite elements. Convergence of the method is proved for any regular family of triangulations.
In this paper, we propose a new class of adaptive trust region methods for unconstrained optimization problems and develop some convergence properties. In the new algorithms, we use the current iterative information to define a suitable initial trust region radius at each iteration. The initial trust region radius is more reasonable in the sense that the trust region model and the objective function are more consistent at the current iterate. The global convergence, super-linear and quadratic convergence...
In the article an optimal control problem subject to a stationary variational inequality is investigated. The optimal control problem is complemented with pointwise control constraints. The convergence of a smoothing scheme is analyzed. There, the variational inequality is replaced by a semilinear elliptic equation. It is shown that solutions of the regularized optimal control problem converge to solutions of the original one. Passing to the limit in the optimality system of the regularized problem...
Optimization problems with convex but non-smooth cost functional subject to an elliptic partial differential equation are considered. The non-smoothness arises from a L1-norm in the objective functional. The problem is regularized to permit the use of the semi-smooth Newton method. Error estimates with respect to the regularization parameter are provided. Moreover, finite element approximations are studied. A-priori as well as a-posteriori error estimates are developed and confirmed by numerical...
Optimization problems with convex but non-smooth cost functional subject to an elliptic partial differential equation are considered. The non-smoothness arises from a L1-norm in the objective functional. The problem is regularized to permit the use of the semi-smooth Newton method. Error estimates with respect to the regularization parameter are provided. Moreover, finite element approximations are studied. A-priori as well as a-posteriori error estimates are developed and confirmed by numerical...
We provide new sufficient convergence conditions for the convergence of the secant-type methods to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses recurrent functions, and Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than earlier ones and under our convergence hypotheses we can cover cases where earlier conditions...
We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal design, in particular shape and topology optimization, and are most often solved numerically utilizing a finite element approach. Within the FV framework for control in the coefficients problems ...
We present a convergence analysis of a cell-based finite volume (FV) discretization scheme applied to a problem of control in the coefficients of a generalized Laplace equation modelling, for example, a steady state heat conduction. Such problems arise in applications dealing with geometric optimal design, in particular shape and topology optimization, and are most often solved numerically utilizing a finite element approach. Within the FV framework for control in the coefficients problems ...
A discontinuous Galerkin finite element method for an optimal control problem related to semilinear parabolic PDE's is examined. The schemes under consideration are discontinuous in time but conforming in space. Convergence of discrete schemes of arbitrary order is proven. In addition, the convergence of discontinuous Galerkin approximations of the associated optimality system to the solutions of the continuous optimality system is shown. The proof is based on stability estimates at arbitrary time...
This paper characterizes completely the behavior of the logarithmic barrier method under a standard second order condition, strict (multivalued) complementarity and MFCQ at a local minimizer. We present direct proofs, based on certain key estimates and few well–known facts on linear and parametric programming, in order to verify existence and Lipschitzian convergence of local primal-dual solutions without applying additionally technical tools arising from Newton–techniques.