Global error bounds with fractional exponents

Using the partial order induced by a proper weakly lower semicontinuous function on a reflexive Banach space X we give a sufficient condition for f to have error bounds with fractional exponents. Application is given to identify the set of such exponents for quadratic functions. Received: August 20, 1999 / Accepted: March 20, 2000?Published online July 20, 2000     

Extension of locally pseudocompact group actions

It is shown that: (1) any action of a Moscow group G on a first countable, Dieudonné complete (in particular, on a metrizable) space X can uniquely be extended to an action of the Dieudonné completion γG on X, (2) any action of a locally pseudocompact topological group G on a b _f -space (in particular, on a first countable space) X can uniquely be extended to an action of the Weil completion on the Dieudonné completion γX of X. As a consequence, we obtain that, for each locally pseudocompact topological group G, every G-space with the b _f -property admits an equivariant embedding into a compact Hausdorff G-space. Furthermore, for each pseudocompact group G, every metrizable G-space has a G-invariant metric compatible with its topology. We also give a direct construction of such an invariant metric. Received: June 22, 2000; in final form: May 22, 2001?Published online: June 11, 2002     

Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications

We obtain local estimates of the distance to a set defined by equality constraints under assumptions which are weaker than those previously used in the literature. Specifically, we assume that the constraints mapping has a Lipschitzian derivative, and satisfies a certain 2-regularity condition at the point under consideration. This setting directly subsumes the classical regular case and the twice differentiable 2-regular case, for which error bounds are known, but it is significantly richer than either of these two cases. When applied to a certain equation-based reformulation of the nonlinear complementarity problem, our results yield an error bound under an assumption more general than b-regularity. The latter appears to be the weakest assumption under which a local error bound for complementarity problems was previously available. We also discuss an application of our results to the convergence rate analysis of the exterior penalty method for solving irregular problems. Received: February 2000 / Accepted: November 2000?Published online January 17, 2001     

Error bounds for infinite systems of convex inequalities without Slater’s condition

The feasible set of a convex semi–infinite program is described by a possibly infinite system of convex inequality constraints. We want to obtain an upper bound for the distance of a given point from this set in terms of a constant multiplied by the value of the maximally violated constraint function in this point. Apart from this Lipschitz case we also consider error bounds of H?lder type, where the value of the residual of the constraints is raised to a certain power.?We give sufficient conditions for the validity of such bounds. Our conditions do not require that the Slater condition is valid. For the definition of our conditions, we consider the projections on enlarged sets corresponding to relaxed constraints. We present a condition in terms of projection multipliers, a condition in terms of Slater points and a condition in terms of descent directions. For the Lipschitz case, we give five equivalent characterizations of the validity of a global error bound.?We extend previous results in two directions: First, we consider infinite systems of inequalities instead of finite systems. The second point is that we do not assume that the Slater condition holds which has been required in almost all earlier papers. Received: April 12, 1999 / Accepted: April 5, 2000?Published online July 20, 2000     

On the rank of mixed 0,1 polyhedra

For a polytope in the [0,1] ⁿ cube, Eisenbrand and Schulz showed recently that the maximum Chvátal rank is bounded above by O(n ²logn) and bounded below by (1+ε)n for some ε>0. Chvátal cuts are equivalent to Gomory fractional cuts, which are themselves dominated by Gomory mixed integer cuts. What do these upper and lower bounds become when the rank is defined relative to Gomory mixed integer cuts? An upper bound of n follows from existing results in the literature. In this note, we show that the lower bound is also equal to n. This result still holds for mixed 0,1 polyhedra with n binary variables. Received: March 15, 2001 / Accepted: July 18, 2001?Published online September 17, 2001     

On Uniform Global Error Bounds for Convex Inequalities

This paper studies the existence of a uniform global error bound when a convex inequality g 0, where g is a closed proper convex function, is perturbed. The perturbation neighborhoods are defined by small arbitrary perturbations of the epigraph of its conjugate function. Under certain conditions, it is shown that for sufficiently small arbitrary perturbations the perturbed system is solvable and there exists a uniform global error bound if and only if g satisfies the Slater condition and the solution set is bounded or its recession function satisfies the Slater condition. The results are used to derive lower bounds on the distance to ill-posedness.     

Representation,interpolation, and reiteration theorems for generalized approximation spaces

We show that the representation theorem for classical approximation spaces can be generalized to spaces A(X,l ^q (ℬ))={f∈X:{E _n (f)}∈l ^q (ℬ)} in which the weighted l ^q -space l ^q (ℬ) can be (more or less) arbitrary. We use this theorem to show that generalized approximation spaces can be viewed as real interpolation spaces (defined with K-functionals or main-part K-functionals) between couples of quasi-normed spaces which satisfy certain Jackson and Bernstein-type inequalities. Especially, interpolation between an approximation space and the underlying quasi-normed space leads again to an approximation space. Together with a general reiteration theorem, which we also prove in the present paper, we obtain formulas for interpolation of two generalized approximation spaces. Received: December 6, 2001; in final form: April 2, 2002?Published online: March 14, 2003     

A continuation theorem with applications to periodically forced Liénard equations in the presence of a separatrix

In this paper we prove a result on the existence of periodic motions for the periodically forced Liénard differential equation x ^″+f(x)x ^′+g(x)=e(t) in a situation where the phase portrait of the associated autonomous equation is similar to that of a centre limited by an unbounded separatrix. The existence result, which is based on a degree theoretic continuation theorem, enables us to treat some interesting cases not previously considered in the literature. Received: April 27, 2000 Published online: December 19, 2001     

The Kato-type spectrum and local spectral theory

Let T ∈ ℒ(X) be a bounded operator on a complex Banach space X. If V is an open subset of the complex plane such that λ-T is of Kato-type for each λ ∈ V, then the induced mapping f(z) ↦ (z-T)f(z) has closed range in the Fréchet space of analytic X-valued functions on V. Since semi-Fredholm operators are of Kato-type, this generalizes a result of Eschmeier on Fredholm operators and leads to a sharper estimate of Nagy’s spectral residuum of T. Our proof is elementary; in particular, we avoid the sheaf model of Eschmeier and Putinar and the theory of coherent analytic sheaves.     

Coefficient Quantization in Banach Spaces

Let (e _i ) be a dictionary for a separable infinite-dimensional Banach space X. We consider the problem of approximation by linear combinations of dictionary elements with quantized coefficients drawn usually from a ‘finite alphabet’. We investigate several approximation properties of this type and connect them to the Banach space geometry of X. The existence of a total minimal system with one of these properties, namely the coefficient quantization property, is shown to be equivalent to X containing c ₀. We also show that, for every ε>0, the unit ball of every separable infinite-dimensional Banach space X contains a dictionary (x _i ) such that the additive group generated by (x _i ) is (3+ε)⁻¹-separated and 1/3-dense in X.      

A note on localized directional weak lower semi-continuity

In minimization problems for functionals f : M → R, M ? E a subset of some infinite dimensional Banach space E, we typically have to rely on weak (sequential) lower semi-continuity of f on the whole space E even if M is a proper subset of E. The main reason for this lack of 'localized' weak lower semi-continuity seems to be that it is not known how to get and/or to characterize weak sequential lower semi-continuity on a subset M without knowing it on the whole space. As a first step to overcome this difficulty we propose the concept of 'localized directional weak sequential lower semi-continuity' and offer a way to implement it, namely in terms of conditions on the Gateaux derivative f′ of f (weak K-monotonicity). This allows to formulate a criterium and new sufficient conditions for the existence of a minimizer.

We conclude with a discussion of applications to the variational approach to the solution of (systems of) nonlinear partial differential equations where we focus on the case of integral functionals of vector fields for which the integrand is not assumed to be quasi-convex.     

Embedding c<Subscript>0</Subscript> in bvca(Σ, <Emphasis Type="Italic">X</Emphasis>)

If (Ω,Σ) is a measurable space and X a Banach space, we provide sufficient conditions on Σ and X in order to guarantee that bvca(Σ, X) the Banach space of all X-valued countably additive measures of bounded variation equipped with the variation norm, contains a copy of c₀ if and only if X does. This work was supported by the project MTM2005-01182 of the Spanish Ministry of Education and Science, co-financed by the European Community (Feder projects).     

On the limit laws of the second order for additive functionals of Harris recurrent Markov chains

Let {X _n } _{n ≥0} be a Harris recurrent Markov chain with state space E and invariant measure π. The law of the iterated logarithm and the law of weak convergence are given for the additive functionals of the form

Sufficient conditions for error bounds and linear regularity in Banach spaces

In this paper, we study error bounds for lower semicontinuous functions defined on Banach space and linear regularity for finitely many closed subset in Banach spaces. By using Clarke＇s subd- ifferentials and Ekeland variational principle, we establish several sufficient conditions ensuring error bounds and linear regularity in Banach spaces.     

Oscillation and asymptotic behaviour of a class of higher-order non-linear difference equations

The dynamical characteristics of scalar difference equations of the form?x _{n +1}=f ₁(x _{n −τ1})+f ₂(x _{n −τ2}), n=0,1,2,...,?are investigated. A necessary and sufficient condition is obtained for all positive solutions to be oscillatory about a unique positive equilibrium point and sufficient criteria for the global attractivity of the equilibrium are established. Also, the stability and periodicity of more general equations are studied via comparison with the corresponding properties of an associated first-order non-linear equation. Received: September 5, 2001; in final form: March 7, 2002?Published online: April 14, 2003     

On the location of fixed points on pairs of spaces

Let f: (X, A)→(X, A) be an admissible selfmap of a pair of metrizable ANR's. A Nielsen number of the complement Ñ(f; X, A) and a Nielsen number of the boundary ñ(f; X, A) are defined. Ñ(f; X, A) is a lower bound for the number of fixed points on C1(X - A) for all maps in the homotopy class of f. It is usually possible to homotope f to a map which is fixed point free on Bd A, but maps in the homotopy class of f which have a minimal fixed point set on X must have at least ñ(f; X, A) fixed points on Bd A. It is shown that for many pairs of compact polyhedra these lower bounds are the best possible ones, as there exists a map homotopic to f with a minimal fixed point set on X which has exactly Ñ(f; X - A) fixed points on C1(X−A) and ñ(f; X, A) fixed points on Bd A. These results, which make the location of fixed points on pairs of spaces more precise, sharpen previous ones which show that the relative Nielsen number N(f; X, A) is the minimum number of fixed points on all of X for selfmaps of (X, A), as well as results which use Lefschetz fixed point theory to find sufficient conditions for the existence of one fixed point on C1(X−A).     

Some remarks on the Fefferman-Stein inequality

We investigate the Fefferman-Stein inequality related to a function f and the sharp maximal function f ^# on a Banach function space X. It is proved that this inequality is equivalent to a certain boundedness property of the Hardy-Littlewood maximal operator M. The latter property is shown to be self-improving. We apply our results in several directions. First, we show the existence of nontrivial spaces X for which the lower operator norm of M is equal to 1. Second, in the case when X is the weighted Lebesgue space L ^p (w), we obtain a new approach to the results of Sawyer and Yabuta concerning the C _p condition.     

Self-regular functions and new search directions for linear and semidefinite optimization

In this paper, we introduce the notion of a self-regular function. Such a function is strongly convex and smooth coercive on its domain, the positive real axis. We show that any such function induces a so-called self-regular proximity function and a corresponding search direction for primal-dual path-following interior-point methods (IPMs) for solving linear optimization (LO) problems. It is proved that the new large-update IPMs enjoy a polynomial ?(n log) iteration bound, where q≥1 is the so-called barrier degree of the kernel function underlying the algorithm. The constant hidden in the ?-symbol depends on q and the growth degree p≥1 of the kernel function. When choosing the kernel function appropriately the new large-update IPMs have a polynomial ?(lognlog) iteration bound, thus improving the currently best known bound for large-update methods by almost a factor . Our unified analysis provides also the ?(log) best known iteration bound of small-update IPMs. At each iteration, we need to solve only one linear system. An extension of the above results to semidefinite optimization (SDO) is also presented. Received: March 2000 / Accepted: December 2001?Published online April 12, 2002     

On convergence of the Gauss-Newton method for convex composite optimization

The local quadratic convergence of the Gauss-Newton method for convex composite optimization f=h∘F is established for any convex function h with the minima set C, extending Burke and Ferris’ results in the case when C is a set of weak sharp minima for h. Received: July 24, 1998 / Accepted: November 29, 2000?Published online September 3, 2001     

Banach space properties sufficient for normal structure

In this paper we establish lower bounds for the weakly convergent sequence coefficient WCS(X) of a Banach space X, in terms of some well known moduli and coefficients. By mean of these bounds we identify several properties, of geometrical nature, which imply normal structure. We show that these properties are strictly more general than other previously known sufficient conditions for normal structure.