A Mean Value Theorem for non Differentiable Mappings in Banach Spaces

We prove that if f is a real valued lower semicontinuous function on a Banach space X and if there exists a C^1, real valued Lipschitz continuous function on X with bounded support and which is not identically equal to zero, then f is Lipschitz continuous of constant K provided all lower subgradients of f are bounded by K. As an application, we give a regularity result of viscosity supersolutions (or subsolutions) of Hamilton-Jacobi equations in infinite dimensions which satisfy a coercive condition. This last result slightly improves some earlier work by G. Barles and H. Ishii.

Some Mean-Value Theorems of the Cauchy Type

2000 Mathematics Subject Classification: Primary 26A24, 26D15; Secondary 41A05

A Clarke–Ledyaev Type Inequality for Certain Non–Convex Sets

We consider the question whether the assumption of convexity of the set involved in Clarke-Ledyaev inequality can be relaxed. In the case when the point is outside the convex hull of the set we show that Clarke-Ledyaev type inequality holds if and only if there is certain geometrical relation between the point and the set.

Introduction to the Maple Power Tool Intpakx

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006

Efficient Control in Multistage Stochastic Optimization Problem

AMS subject classification: 90C31, 90A09, 49K15, 49L20.

On Majorization for Matrices

In this paper, we give several results for majorized matrices by using continuous convex function and Green function. We obtain mean value theorems for majorized matrices and also give corresponding Cauchy means, as well as prove that these means are monotonic. We prove positive semi-definiteness of matrices generated by differences deduced from majorized matrices which implies exponential convexity and log-convexity of these differences and also obtain Lypunov's and Dresher's type inequalities for these differences.

The Value of Knowing that You Do Not Know

The value of knowing about data availability and system accessibility is analyzed through theoretical models of Information Economics. When a user places an inquiry for information, it is important for the user to learn whether the system is not accessible or the data is not available, rather than not have any response. In reality, various outcomes can be provided by the system: nothing will be displayed to the user (e.g., a traffic light that does not operate, a browser that keeps browsing, a telephone that does not answer); a random noise will be displayed (e.g., a traffic light that displays random signals, a browser that provides disorderly results, an automatic voice message that does not clarify the situation); a special signal indicating that the system is not operating (e.g., a blinking amber indicating that the traffic light is down, a browser responding that the site is unavailable, a voice message regretting to tell that the service is not available). This article develops a model to assess the value of the information for the user in such situations by employing the information structure model prevailing in Information Economics. Examples related to data accessibility in centralized and in distributed systems are provided for illustration.

On a Singular Value Problem for the Fractional Laplacian on the Exterior of the Unit Ball

2000 Mathematics Subject Classification: Primary 26A33; Secondary 47G20, 31B05

Anti-Periodic Boundary Value Problem for Impulsive Fractional Integro Differential Equations

MSC 2010: 34A37, 34B15, 26A33, 34C25, 34K37