Weak regularity of functions and sets in Asplund spaces

In this paper, we study a new concept of weak regularity of functions and sets in Asplund spaces. We show that this notion includes prox-regular functions, functions whose subdifferential is weakly submonotone and amenable functions in infinite dimension. We establish also that weak regularity is equivalent to Mordukhovich regularity in finite dimension. Finally, we give characterizations of the weak regularity of epi-Lipschitzian sets in terms of their local representations.     

Geometric Condition Measures and Smoothness Condition Measures for Closed Convex Sets and Linear Regularity of Infinitely Many Closed Convex Sets

In this paper, we study geometric condition measures and smoothness condition measures of closed convex sets, bounded linear regularity, and linear regularity. We show that, under certain conditions, the constant for the linear regularity of infinitely many closed convex sets can be characterized by the geometric condition measure of the intersection or by the smoothness condition measure of the intersection. We study also the bounded linear regularity and present some interesting properties of the general linear regularity problem.The author is grateful to the referees for valuable and constructive suggestions. In particular, she thanks a referee for drawing her attention to Corollary 5.14 of Ref. 3, which inspired her to derive Theorem 4.2 and Corollary 4.2 in the revision of this paper.     

Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets

Motivated by the subsmoothness of a closed set introduced by Aussel et al. (2005) [8], we introduce and study the uniform subsmoothness of a collection of infinitely many closed subsets in a Banach space. Under the uniform subsmoothness assumption, we provide an interesting subdifferential formula on distance functions and consider uniform metric regularity for a kind of multifunctions frequently appearing in optimization and variational analysis. Different from the existing works, without the restriction of convexity, we consider several fundamental notions in optimization such as the linear regularity, CHIP, strong CHIP and property (G) for a collection of infinitely many closed sets. We establish relationships among these fundamental notions for an arbitrary collection of uniformly subsmooth closed sets. In particular, we extend duality characterizations of the linear regularity for a collection of closed convex sets to the nonconvex setting.     

Regularity of Sets with Quasiminimal Boundary Surfaces in Metric Spaces

This paper studies regularity of perimeter quasiminimizing sets in metric measure spaces with a doubling measure and a Poincaré inequality. The main result shows that the measure-theoretic boundary of a quasiminimizing set coincides with the topological boundary. We also show that such a set has finite Minkowski content and apply the regularity theory to study rectifiability issues related to quasiminimal sets in the strong A _∞-weighted Euclidean case.     

Stationarity and Regularity of Infinite Collections of Sets

This article investigates extremality, stationarity, and regularity properties of infinite collections of sets in Banach spaces. Our approach strongly relies on the machinery developed for finite collections. When dealing with an infinite collection of sets, we examine the behavior of its finite subcollections. This allows us to establish certain primal-dual relationships between the stationarity/regularity properties some of which can be interpreted as extensions of the Extremal principle. Stationarity criteria developed in the article are applied to proving intersection rules for Fréchet normals to infinite intersections of sets in Asplund spaces.     

Regular relations and strictly completely regular ordered spaces

The classical theorem of Zareckiı̆ about regular relations is slightly extended and an intrinsic characterization of regularity is given. Based on the extended Zareckiı̆ theorem and the intrinsic characterization of regularity, we give a characterization of the strict complete regularity of ordered spaces by means of a certain regular relation between the closed and the open upper sets. As an application, it is shown that a quasicontinuous domain endowed with the Lawson topology is strictly completely regular, provided that the Lawson-open lower sets are contained in the lower topology. By means of regular relations we present a new proof of the strict Tychonoff embedding theorem for strictly completely regular ordered spaces.     

Linear regularity and ?-regularity of nonconvex sets

In this paper, we discuss some sufficient conditions for the linear regularity and bounded linear regularity (and their variations) of finitely many closed (not necessarily convex) sets in a normed vector space. The accompanying necessary conditions are also given in the setting of Asplund spaces.     

Local linear convergence of approximate projections onto regularized sets

The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von Neumann has been shown to converge locally at a linear rate dependent on the regularity modulus of the intersection. In many applications, however, the sets in question come from inexact measurements that are matched to idealized models. It is unlikely that any such problems in applications will enjoy metrically regular intersection, let alone set intersection. We explore a regularization strategy that generates an intersection with the desired regularity properties. The regularization, however, can lead to a significant increase in computational complexity. In a further refinement, we investigate and prove linear convergence of an approximate alternating projection algorithm. The analysis provides a regularization strategy that fits naturally with many ill-posed inverse problems, and a mathematically sound stopping criterion for extrapolated, approximate algorithms. The theory is demonstrated on the phase retrieval problem with experimental data. The conventional early termination applied in practice to unregularized, consistent problems in diffraction imaging can be justified fully in the framework of this analysis providing, for the first time, proof of convergence of alternating approximate projections for finite dimensional, consistent phase retrieval problems.     

Collet, Eckmann and Hölder

We prove that Collet-Eckmann condition for rational functions, which requires exponential expansion only along the critical orbits, yields the H?lder regularity of Fatou components. This implies geometric regularity of Julia sets with non-hyperbolic and critically-recurrent dynamics. In particular, polynomial Collet-Eckmann Julia sets are locally connected if connected, and their Hausdorff dimension is strictly less than 2. The same is true for rational Collet-Eckmann Julia sets with at least one non-empty fully invariant Fatou component. Oblatum 22-III-1996 & 15-VII-1997     

Regularity of functions smooth along foliations, and elliptic regularity

We produce two sets of results arising in the analysis of the degree of smoothness of a function that is known to be smooth along the leaves of one or more foliations. These foliations might arise from Anosov systems, and while each leaf is smooth, the leaves might vary in a nonsmooth fashion. One set of results gives microlocal regularity of such a function away from the conormal bundle of a foliation. The other set of results gives local regularity of solutions to a class of elliptic systems with fairly rough coefficients. Such a regularity theory is motivated by one attack on the foliation regularity problem.     

Strong CHIP, normality, and linear regularity of convex sets

We extend the property (N) introduced by Jameson for closed convex cones to the normal property for a finite collection of convex sets in a Hilbert space. Variations of the normal property, such as the weak normal property and the uniform normal property, are also introduced. A dual form of the normal property is derived. When applied to closed convex cones, the dual normal property is the property (G) introduced by Jameson. Normality of convex sets provides a new perspective on the relationship between the strong conical hull intersection property (strong CHIP) and various regularity properties. In particular, we prove that the weak normal property is a dual characterization of the strong CHIP, and the uniform normal property is a characterization of the linear regularity. Moreover, the linear regularity is equivalent to the fact that the normality constant for feasible direction cones of the convex sets at is bounded away from 0 uniformly over all points in the intersection of these convex sets.

     

The free boundary problem of a semiconductor in thermal equilibrium

The quasi-hydrodynamic model for semiconductor devices in thermal equilibrium admits in general solutions for which the electron or hole density vanish. These sets are called vacuum sets. In this paper estimates on the vacuum sets and a first step in the regularity of the free boundary of these sets are presented. Numerical examples, including error estimates for linear finite elements, for the devices diode, bipolar transistor and thyristor indicate that the free boundary is more regular than theoretically predicted.     

Regular Relations and Normality of Topologies

A characterization of the normality of a topological space and a new proof of the Urysohn's lemma are given by the regularity of the inclusion relation between closed and open sets.     

Set regularities and feasibility problems

Mathematical Programming - We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for...     

概率约束规划逼近最优解集的稳定性和最优值的连续性

在原始规划可行集上引入了正则的概念,并在此正则条件下,研究了更一般的概率约束规划问题的稳定性.在一定的条件下,得到了概率约束规划逼近最优解集的稳定性和最优值的连续性,从而对近似求解这类问题提供了某种理论依据.     

On the regularity of the boundary of the integral funnel of a differential inclusion

We prove regularity theorems under two substantially distinct sets of assumptions for the right-hand side of the differential inclusion and the initial set.     

Regular and non-regular point sets: Properties and reconstruction

In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants, which are polygonal approximations of curves and surfaces satisfying a new regularity condition. This new condition, which is an extension of the popular notion of r-sampling to the practical case of discrete shapes, seems much more realistic than previously proposed conditions based on properties of the underlying continuous shapes. Indeed, contrary to previous sampling criteria, our regularity condition can be checked on the basis of the samples alone and can be turned into a provably correct curve and surface reconstruction algorithm. Our reconstruction methods can also be applied to non-regular and unorganized point sets, revealing a larger part of the inner structure of such point sets than past approaches. Several real-size reconstruction examples validate the new method.     

Hilbertian convex feasibility problem: Convergence of projection methods

The classical problem of finding a point in the intersection of countably many closed and convex sets in a Hilbert space is considered. Extrapolated iterations of convex combinations of approximate projections onto subfamilies of sets are investigated to solve this problem. General hypotheses are made on the regularity of the sets and various strategies are considered to control the order in which the sets are selected. Weak and strong convergence results are established within thisbroad framework, which provides a unified view of projection methods for solving hilbertian convex feasibility problems. This work was supported by the National Science Foundation under Grant MIP-9308609.     

Inexact Iterative Bregman Method for Optimal Control Problems

In this article, we investigate an inexact iterative regularization method based on generalized Bregman distances of an optimal control problem with control constraints. We show robustness and convergence of the inexact Bregman method under a regularity assumption, which is a combination of a source condition and a regularity assumption on the active sets. We also take the discretization error into account. Numerical results are presented to demonstrate the algorithm.     

Entropy of Absolute Convex Hulls in Hilbert Spaces

The metric entropy of absolute convex hulls of sets in Hilbertspaces is studied for the general case when the metric entropyof the sets is arbitrary. Under some regularity assumptions,the results are sharp. 2000 Mathematical Subject Classification41A46 (primary), 60G15 (secondary).