Calmness of the Feasible Set Mapping for Linear Inequality Systems

In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system’s data.

Approximate algorithms for credal networks with binary variables

This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contain only binary variables. Such networks can represent incomplete or vague beliefs, lack of data, and disagreements among experts; they can also encode models based on belief functions and possibilistic measures. All algorithms for approximate inference in this paper rely on exact inferences in credal networks based on polytrees with binary variables, as these inferences have polynomial complexity. We are inspired by approximate algorithms for Bayesian networks; thus the Loopy 2U algorithm resembles Loopy Belief Propagation, while the Iterated Partial Evaluation and Structured Variational 2U algorithms are, respectively, based on Localized Partial Evaluation and variational techniques. (C) 2007 Elsevier Inc. All rights reserved.

Branching processes and computational collapse of discretized unimodal mappings

In computer simulations of smooth dynamical systems, the original phase space is replaced by machine arithmetic, which is a finite set. The resulting spatially discretized dynamical systems do not inherit all functional properties of the original systems, such as surjectivity and existence of absolutely continuous invariant measures. This can lead to computational collapse to fixed points or short cycles. The paper studies loss of such properties in spatial discretizations of dynamical systems induced by unimodal mappings of the unit interval. The problem reduces to studying set-valued negative semitrajectories of the discretized system. As the grid is refined, the asymptotic behavior of the cardinality structure of the semitrajectories follows probabilistic laws corresponding to a branching process. The transition probabilities of this process are explicitly calculated. These results are illustrated by the example of the discretized logistic mapping.

Non-compact generalized variational inequalities for quasi-monotone and hemi-continuous operators with applications

Some results are obtained for non-compact cases in topological vector spaces for the existence problem of solutions for some set-valued variational inequalities with quasi-monotone and lower hemi-continuous operators, and with quasi-semi-monotone and upper hemi-continuous operators. Some applications are given in non-reflexive Banach spaces for these existence problems of solutions and for perturbation problems for these set-valued variational inequalities with quasi-monotone and quasi-semi-monotone operators.

Sequential estimation of multipath MIMO-OFDM channels

Wireless “MIMO” systems, employing multiple transmit and receive antennas, promise a significant increase of channel capacity, while orthogonal frequency-division multiplexing (OFDM) is attracting a good deal of attention due to its robustness to multipath fading. Thus, the combination of both techniques is an attractive proposition for radio transmission. The goal of this paper is the description and analysis of a new and novel pilot-aided estimator of multipath block-fading channels. Typical models leading to estimation algorithms assume the number of multipath components and delays to be constant (and often known), while their amplitudes are allowed to vary with time. Our estimator is focused instead on the more realistic assumption that the number of channel taps is also unknown and varies with time following a known probabilistic model. The estimation problem arising from these assumptions is solved using Random-Set Theory (RST), whereby one regards the multipath-channel response as a single set-valued random entity.Within this framework, Bayesian recursive equations determine the evolution with time of the channel estimator. Due to the lack of a closed form for the solution of Bayesian equations, a (Rao–Blackwellized) particle filter (RBPF) implementation ofthe channel estimator is advocated. Since the resulting estimator exhibits a complexity which grows exponentially with the number of multipath components, a simplified version is also introduced. Simulation results describing the performance of our channel estimator demonstrate its effectiveness.

Iteration of closed geodesics in stationary Lorentzian manifolds

Following the lines of Bott in (Commun Pure Appl Math 9:171-206, 1956), we study the Morse index of the iterates of a closed geodesic in stationary Lorentzian manifolds, or, more generally, of a closed Lorentzian geodesic that admits a timelike periodic Jacobi field. Given one such closed geodesic gamma, we prove the existence of a locally constant integer valued map Lambda(gamma) on the unit circle with the property that the Morse index of the iterated gamma(N) is equal, up to a correction term epsilon(gamma) is an element of {0,1}, to the sum of the values of Lambda(gamma) at the N-th roots of unity. The discontinuities of Lambda(gamma) occur at a finite number of points of the unit circle, that are special eigenvalues of the linearized Poincare map of gamma. We discuss some applications of the theory.

A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

On the solvability of implicit differential inclusions

In the paper, the set-valued covering mappings are studied. The statements on solvability, solution estimates, and well-posedness of inclusions with conditionally covering mappings are proved. The results obtained are applied to the investigation of differential inclusions unsolved for the unknown function. The statements on solvability, solution estimates, and well-posedness of these inclusions are derived.

Sharp comparison and maximum principles via horizontal normal mapping in the Heisenberg group

In this paper we solve a problem raised by Gutiérrez and Montanari about comparison principles for H−convex functions on subdomains of Heisenberg groups. Our approach is based on the notion of the sub-Riemannian horizontal normal mapping and uses degree theory for set-valued maps. The statement of the comparison principle combined with a Harnack inequality is applied to prove the Aleksandrov-type maximum principle, describing the correct boundary behavior of continuous H−convex functions vanishing at the boundary of horizontally bounded subdomains of Heisenberg groups. This result answers a question by Garofalo and Tournier. The sharpness of our results are illustrated by examples.

On the stability of the Motzkin representation of closed convex sets

A set is called Motzkin decomposable when it can be expressed as the Minkowski sum of a compact convex set with a closed convex cone. This paper analyzes the continuity properties of the set-valued mapping associating to each couple (C,D) formed by a compact convex set C and a closed convex cone D its Minkowski sum C + D. The continuity properties of other related mappings are also analyzed.

The Use of the Relative Interior in Integration with Nonconvex Data

Introducing an appropriate inclusion between approximate minima associated with two nonconvex functions, we derive explicit relations between the closed convex hulls of these functions. The formula we obtain goes beyond the so-called epi-pointed property of functions which is usually concerned with such a topic.

Stability in Linear Optimization Under Perturbations of the Left-Hand Side Coefficients

This paper studies stability properties of linear optimization problems with finitely many variables and an arbitrary number of constraints, when only left hand side coefficients can be perturbed. The coefficients of the constraints are assumed to be continuous functions with respect to an index which ranges on certain compact Hausdorff topological space, and these properties are preserved by the admissible perturbations. More in detail, the paper analyzes the continuity properties of the feasible set, the optimal set and the optimal value, as well as the preservation of desirable properties (boundedness, uniqueness) of the feasible and of the optimal sets, under sufficiently small perturbations.

Spline Subdivision Schemes for Compact Sets. A Survey

Dedicated to the memory of our colleague Vasil Popov January 14, 1942 – May 31, 1990 * Partially supported by ISF-Center of Excellence, and by The Hermann Minkowski Center for Geometry at Tel Aviv University, Israel

Generalized Variational Inequalities for Upper Hemicontinuous and Demi Operators with Applications to Fixed Point Theorems in Hilbert Spaces

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

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.