Limites et fonctions d'ensemble
Si studia il comportamento limite di successioni di problemi variazionali nonlineari con condizioni al contorno di Dirichlet su aperti variabili. I principali strumenti usati in questa ricerca sono le nozioni di -convergenza e di -capacità nonlineare.
If the minimum problem () is the limit, in a variational sense, of a sequence of minimum problems with obstacles of the type then () can be written in the form without any additional constraint.
Se il problema di minimo è il limite, in senso variazionale, di una successione di problemi di minimo con ostacoli del tipo allora può essere scritto nella forma dove è un conveniente rappresentante di e è una misura non negativa.
Given a locally finite open covering of a normal space X and a Hausdorff topological vector space E, we characterize all continuous functions f: X → E which admit a representation with and a partition of unity subordinate to . As an application, we determine the class of all functions f ∈ C(||) on the underlying space || of a Euclidean complex such that, for each polytope P ∈ , the restriction attains its extrema at vertices of P. Finally, a class of extremal functions on the metric space...
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
The aim of the paper is to provide a linearization approach to the -control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the approach and the associated linear formulations. This seems to be the most appropriate tool for treating problems in continuous and lower semicontinuous setting.
The aim of the paper is to provide a linearization approach to the See PDF-control problems. We begin by proving a semigroup-type behaviour of the set of constraints appearing in the linearized formulation of (standard) control problems. As a byproduct we obtain a linear formulation of the dynamic programming principle. Then, we use the See PDF approach and the associated linear formulations. This seems to be the most appropriate tool for treating See PDF problems in continuous and lower semicontinuous...
The subject of this paper is the rigorous derivation of reduced models for a thin plate by means of Γ-convergence, in the framework of finite plasticity. Denoting by ε the thickness of the plate, we analyse the case where the scaling factor of the elasto-plastic energy per unit volume is of order ε2α−2, with α ≥ 3. According to the value of α, partially or fully linearized models are deduced, which correspond, in the absence of plastic deformation, to the Von Kármán plate theory and the linearized...
We provide a rigorous justification of the classical linearization approach in plasticity. By taking the small-deformations limit, we prove via -convergence for rate-independent processes that energetic solutions of the quasi-static finite-strain elastoplasticity system converge to the unique strong solution of linearized elastoplasticity.
We give necessary and sufficient conditions which characterize the Young measures associated to two oscillating sequences of functions, un on and vn on satisfying the constraint . Our study is motivated by nonlinear effects induced by homogenization. Techniques based on equimeasurability and rearrangements are employed.
We are concerned with the Lipschitz modulus of the optimal set mapping associated with canonically perturbed convex semi-infinite optimization problems. Specifically, the paper provides a lower and an upper bound for this modulus, both of them given exclusively in terms of the problem’s data. Moreover, the upper bound is shown to be the exact modulus when the number of constraints is finite. In the particular case of linear problems the upper bound (or exact modulus) adopts a notably simplified...