The theory of generic differentiability of convex functions on Banach spaces is by now a well-explored part of infinite-dimensional geometry. All the attempts to solve this kind of problem have in common, as a working hypothesis, one special feature of the finite-dimensional case. Namely, convex functions are always considered to be defined on convex sets with nonempty interior. But typically, ...

In the plane, we study the transform R f of integrating a unknown function f over circles centered at a given curve . This is a simplified model of SAR, when the radar is not directed but has other applications, like thermoacoustic tomography, for example. We study the problem of recovering the wave front set WF.f /. If the visible singularities of f hit once, we show that WF.f / cannot be reco...

We consider collective choice with agents possessing strictly monotone, strictly convex and continuous preferences over a compact and convex constraint set contained in Rþ. If it is non-empty the core will lie on the efficient boundary of the constraint set and any policy not in the core is beaten by some policy on the efficient boundary. It is possible to translate the collective choice proble...

In this paper, we show that the Chvátal-Gomory closure of any compact convex set is a rational polytope. This resolves an open question of Schrijver [17] for irrational polytopes1, and generalizes the same result for the case of rational polytopes [17], rational ellipsoids [8] and strictly convex bodies [7].

We consider linearly independent families of Hermitian matrices {A1, . . . , Am} so thatWk(A) is convex. It is shown that m can reach the upper bound 2k(n− k) + 1. A key idea in our study is relating the convexity of Wk(A) to the problem of constructing rank k orthogonal projections under linear constraints determined by A. The techniques are extended to study the convexity of other generalized...

we first obtain some properties of a fundamentally nonexpansive self-mapping on a nonempty subset of a banach space and next show that if the banach space is having the opial condition, then the fixed points set of such a mapping with the convex range is nonempty. in particular, we establish that if the banach space is uniformly convex, and the range of such a mapping is bounded, closed and con...

and Applied Analysis 3 It is worth noting that if α 0, then the definitions of α-well-posedness, αwell-posedness in the generalized sense, L-α-well-posedness, and L-α-well-posedness in the generalized sense for MQVLI , respectively, reduce to those of the well-posedness, well-posedness in the generalized sense, L-well-posedness, and L-well-posedness in the generalized sense for MQVLI in 20 . We...

Let $ H$ be a Hilbert space and $C$ be a closed, convex and nonempty subset of $H$. Let $T:C rightarrow H$ be a non-self and non-expansive mapping. V. Colao and G. Marino with particular choice of the sequence  ${alpha_{n}}$ in Krasonselskii-Mann algorithm, ${x}_{n+1}={alpha}_{n}{x}_{n}+(1-{alpha}_{n})T({x}_{n}),$ proved both weak and strong converging results. In this paper, we generalize thei...

We consider composite loss functions for multiclass prediction comprising a proper (i.e., Fisherconsistent) loss over probability distributions and an inverse link function. We establish conditions for their (strong) convexity and explore the implications. We also show how the separation of concerns afforded by using this composite representation allows for the design of families of losses with...

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...