A Random Evolution Inclusion of Subdifferential Type in Hilbert Spaces

In this paper we study a nonlinear evolution inclusion of subdifferential type in Hilbert spaces. The perturbation term is Hausdorff continuous in the state variable and has closed but not necessarily convex values. Our result is a stochastic generalization of an existence theorem proved by Kravvaritis and Papageorgiou in [6].

Somme Ponctuelle D'operateurs Maximaux Monotones

∗ Cette recherche a été partiellement subventionnée, en ce qui concerne le premier et le dernier auteur, par la bourse OTAN CRG 960360 et pour le second auteur par l’Action Intégrée 95/0849 entre les universités de Marrakech, Rabat et Montpellier.

Epiconvergence D'une Suite De Sommes En Niveaux De Fonctions Convexes

We consider the problem of minimizing the max of two convex functions from both approximation and sensitivity point of view.This lead up to study the epiconvergence of a sequence of level sums of convex functions and the related dual problems.

Stability of the Iteration Method for non Expansive Mappings

The general iteration method for nonexpansive mappings on a Banach space is considered. Under some assumption of fast enough convergence on the sequence of (“almost” nonexpansive) perturbed iteration mappings, if the basic method is τ−convergent for a suitable topology τ weaker than the norm topology, then the perturbed method is also τ−convergent. Application is presented to the gradient-prox method for monotone inclusions in Hilbert spaces.

Strong-weak Stackelberg Problems in Finite Dimensional Spaces

We are concerned with two-level optimization problems called strongweak Stackelberg problems, generalizing the class of Stackelberg problems in the strong and weak sense. In order to handle the fact that the considered two-level optimization problems may fail to have a solution under mild assumptions, we consider a regularization involving ε-approximate optimal solutions in the lower level problems. We prove the existence of optimal solutions for such regularized problems and present some approximation results when the parameter ǫ goes to zero. Finally, as an example, we consider an optimization problem associated to a best bound given in [2] for a system of nondifferentiable convex inequalities.

Sufficient Conditions of Optimality for Control Pproblem Governed by Variational Inequalities

* This work was completed while the author was visiting the University of Limoges. Support from the laboratoire “Analyse non-linéaire et Optimisation” is gratefully acknowledged.

Monitoring static shape memory polymers using a fiber Bragg grating as a vector-bending sensor

We propose and demonstrate a technique for monitoring the recovery deformation of the shape-memory polymers (SMP) using a surface-attached fiber Bragg grating (FBG) as a vector-bending sensor. The proposed sensing scheme could monitor the pure bending deformation for the SMP sample. When the SMP sample undergoes concave or convex bending, the resonance wavelength of the FBG will have red-shift or blue-shift according to the tensile or compressive stress gradient along the FBG. As the results show, the bending sensitivity is around 4.07  nm/cm−1. The experimental results clearly indicate that the deformation of such an SMP sample can be effectively monitored by the attached FBG not just for the bending curvature but also the bending direction.

Structuring of Ranked Models

Prognostic procedures can be based on ranked linear models. Ranked regression type models are designed on the basis of feature vectors combined with set of relations defined on selected pairs of these vectors. Feature vectors are composed of numerical results of measurements on particular objects or events. Ranked relations defined on selected pairs of feature vectors represent additional knowledge and can reflect experts' opinion about considered objects. Ranked models have the form of linear transformations of feature vectors on a line which preserve a given set of relations in the best manner possible. Ranked models can be designed through the minimization of a special type of convex and piecewise linear (CPL) criterion functions. Some sets of ranked relations cannot be well represented by one ranked model. Decomposition of global model into a family of local ranked models could improve representation. A procedures of ranked models decomposition is described in this paper.

Fractional Powers of Almost Non-Negative Operators

Mathematics Subject Classification: Primary 47A60, 47D06.

On Two Saigo’s Fractional Integral Operators in the Class of Univalent Functions

2000 Mathematics Subject Classification: Primary 26A33, 30C45; Secondary 33A35

Spectrum of Functions for the Dunkl Transform on R^d

Mathematics Subject Classification: 42B10

Impulsive Fractional Differential Inclusions Involving the Caputo Fractional Derivative

Mathematics Subject Classification: 26A33, 34A37.

A generalized Drucker–Prager viscoplastic yield surface model for asphalt concrete

A generalized Drucker–Prager (GD–P) viscoplastic yield surface model was developed and validated for asphalt concrete. The GD–P model was formulated based on fabric tensor modified stresses to consider the material inherent anisotropy. A smooth and convex octahedral yield surface function was developed in the GD–P model to characterize the full range of the internal friction angles from 0° to 90°. In contrast, the existing Extended Drucker–Prager (ED–P) was demonstrated to be applicable only for a material that has an internal friction angle less than 22°. Laboratory tests were performed to evaluate the anisotropic effect and to validate the GD–P model. Results indicated that (1) the yield stresses of an isotropic yield surface model are greater in compression and less in extension than that of an anisotropic model, which can result in an under-prediction of the viscoplastic deformation; and (2) the yield stresses predicted by the GD–P model matched well with the experimental results of the octahedral shear strength tests at different normal and confining stresses. By contrast, the ED–P model over-predicted the octahedral yield stresses, which can lead to an under-prediction of the permanent deformation. In summary, the rutting depth of an asphalt pavement would be underestimated without considering anisotropy and convexity of the yield surface for asphalt concrete. The proposed GD–P model was demonstrated to be capable of overcoming these limitations of the existing yield surface models for the asphalt concrete.

Motzkin Decomposable Sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. We have provided several characterizations of the larger class of closed convex sets, Motzkin decomposable, in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed. Another result establishes that a closed convex set is Motzkin decomposable if and only if the set of extreme points of its intersection with the linear subspace orthogonal to its lineality is bounded. We characterize the class of the extended functions whose epigraphs are Motzkin decomposable sets showing, in particular, that these functions attain their global minima when they are bounded from below. Calculus of Motzkin decomposable sets and functions is provided.

Approximating the MaxMin and MinMax Area Triangulations using Angular Constraints

* A preliminary version of this paper was presented at XI Encuentros de Geometr´ia Computacional, Santander, Spain, June 2005.