Continuity of set-valued maps revisited in the light of tame geometry

Continuity of set-valued maps is hereby revisited: after recalling some basic concepts of variational analysis and a short description of the State-of-the-Art, we obtain as by-product two Sard type results concerning local minima of scalar and vector valued functions. Our main result though, is inscribed in the framework of tame geometry, stating that a closed-valued semialgebraic set-valued map is almost everywhere continuous (in both topological and measure-theoretic sense). The result –depending on stratification techniques– holds true in a more general setting of o-minimal (or tame) set-valued maps. Some applications are briefly discussed at the end.

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.

Knowledge representation with condensed set-valued attributes

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Dense Continuity and Selections of Set-Valued Mappings

∗ The first and third author were partially supported by National Fund for Scientific Research at the Bulgarian Ministry of Science and Education under grant MM-701/97.

Subdifferentials of Performance Functions and Calculus of Coderivatives of Set-Valued Mappings

The paper contains calculus rules for coderivatives of compositions, sums and intersections of set-valued mappings. The types of coderivatives considered correspond to Dini-Hadamard and limiting Dini-Hadamard subdifferentials in Gˆateaux differentiable spaces, Fréchet and limiting Fréchet subdifferentials in Asplund spaces and approximate subdifferentials in arbitrary Banach spaces. The key element of the unified approach to obtaining various calculus rules for various types of derivatives presented in the paper are simple formulas for subdifferentials of marginal, or performance functions.

Averaging operators and set-valued maps

MSC 2010: 54C35, 54C60.

Approximation of Univariate Set-Valued Functions - an Overview

2000 Mathematics Subject Classification: 26E25, 41A35, 41A36, 47H04, 54C65.

Uniform Convergence of the Newton Method for Aubin Continuous Maps

* This work was supported by National Science Foundation grant DMS 9404431.

Acceleration of Convergence in Dontchev’s Iterative Method for Solving Variational Inclusions

2000 Mathematics Subject Classification: 47H04, 65K10.

Applications of the Fréchet subdifferential

2000 Mathematics Subject Classification: 46A30, 54C60, 90C26.

An Iterative Procedure for Solving Nonsmooth Generalized Equation

2000 Mathematics Subject Classification: 47H04, 65K10.

Corrigendum to “The envelope theorem for multiobjective convex programming via contingent derivatives” [J. Math. Anal. Appl. 372 (1) (2010) 197–207]

The aim of this note is to formulate an envelope theorem for vector convex programs. This version corrects an earlier work, “The envelope theorem for multiobjective convex programming via contingent derivatives” by Jiménez Guerra et al. (2010) [3]. We first propose a necessary and sufficient condition allowing to restate the main result proved in the alluded paper. Second, we introduce a new Lagrange multiplier in order to obtain an envelope theorem avoiding the aforementioned error.

Sensitivity Analysis in Convex Optimization through the Circatangent Derivative

The main goal of this paper is to analyse the sensitivity of a vector convex optimization problem according to variations in the right-hand side. We measure the quantitative behavior of a certain set of Pareto optimal points characterized to become minimum when the objective function is composed with a positive function. Its behavior is analysed quantitatively using the circatangent derivative for set-valued maps. Particularly, it is shown that the sensitivity is closely related to a Lagrange multiplier solution of a dual program.

A natural extension of the classical envelope theorem in vector differential programming

The aim of this paper is to extend the classical envelope theorem from scalar to vector differential programming. The obtained result allows us to measure the quantitative behaviour of a certain set of optimal values (not necessarily a singleton) characterized to become minimum when the objective function is composed with a positive function, according to changes of any of the parameters which appear in the constraints. We show that the sensitivity of the program depends on a Lagrange multiplier and its sensitivity.

Lower semicontinuity of the feasible set mapping of linear systems relative to their domains

This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.