On the E-Epigraph of an E-Convex Function

In Ref 1, Yang shows that some of the results obtained in Ref. 2 on E-convex programming are incorrect, but does not prove that the results which make the connection between an E-convex function and its E-epigraph are incorrect. In this note, we show that the results obtained in Ref. 2 concerning the characterization of an E-convex function f in terms of its E-epigraph are incorrect. Afterward, some characterizations of E-convex functions using a different notion of epigraph are given.     

On Geodesic <Emphasis Type="Italic">E</Emphasis>-Convex Sets,Geodesic <Emphasis Type="Italic">E</Emphasis>-Convex Functions and <Emphasis Type="Italic">E</Emphasis>-Epigraphs

In this paper, we introduce a new class of sets and a new class of functions called geodesic E-convex sets and geodesic E-convex functions on a Riemannian manifold. The concept of E-quasiconvex functions on R ⁿ is extended to geodesic E-quasiconvex functions on Riemannian manifold and some of its properties are investigated. Afterwards, we generalize the notion of epigraph called E-epigraph and discuss a characterization of geodesic E-convex functions in terms of its E-epigraph. Some properties of geodesic E-convex sets are also studied.     

E-凸函数的若干特征

讨论了一类广义的凸集和凸函数:E-凸集和E-凸函数的若干性质,并给出E-凸函数的一个判别准则．     

Nonlinear programming with E-preinvex and local E-preinvex functions

In this paper, we extend the class of E-convex sets, E-convex and E-quasiconvex functions introduced by [Youness, E.A., 1999. E-convex sets, E-convex functions and E-convex programming. Journal of Optimization Theory and Applications 102, 439–450], respectively by [Syau, Yu-Ru, Lee, E. Stanley, 2005. Some properties of E-convex functions. Applied Mathematics Letters 18, 1074–1080] to E-invex set, E-preinvex, E-prequasiinvex and corresponding local concepts. Some properties of these classes are studied. As an application of our results, we consider the nonlinear programming problem for which, we establish that, under mild conditions, a local minimum is a global minimum.     

Two Characterizations of Super-Reflexive Banach Spaces by the Behaviour of Differences of Convex Functions

A function defined on a Banach space X is called Δ-convex if it can be represented as a difference of two continuous convex functions. In this work we study the relationship between some geometrical properties of a Banach space X and the behaviour of the class of all Δ-convex functions defined on it. More precisely, we provide two new characterizations of super-reflexivity in terms Δ-convex functions.     

A note on three-parameter families and generalized convex functions

The concept of generalized convex functions introduced by Beckenbach [E.F. Beckenbach, Generalized convex functions, Bull. Amer. Math. Soc. 43 (1937) 363–371] is extended to the two-dimensional case. Using three-parameter families, we define generalized convex (midconvex, M-convex) functions and show some continuity properties of them.     

Proximity theorems of discrete convex functions

A proximity theorem is a statement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in a certain neighborhood of a solution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for L-convex and M-convex functions, this paper establishes proximity theorems for larger classes of discrete convex functions, L₂-convex functions and M₂-convex functions, that are relevant to the polymatroid intersection problem and the submodular flow problem.Mathematics Subject Classification (2000): 90C27, 05B35     

Epigraph of operator functions

It is known that a real function f is convex if and only if the set E(f) = {(x, y) ∈ ? × ?; f (x) ≤ y}, the epigraph of f is a convex set in ?². We state an extension of this result for operator convex functions and C^?-convex sets as well as operator log-convex functions and C^?-log-convex sets. Moreover, the C^?-convex hull of a Hermitian matrix has been represented in terms of its eigenvalues.     

Strict Topologies as Topological Algebras

Let X be a completely regular Hausdorff space, C_b(X) the space of all scalar-valued bounded continuous functions on X with strict topologies. We prove that these are locally convex topological algebras with jointly continuous multiplication. Also we find the necessary and sufficient conditions for these algebras to be locally m-convex.     

Optimality criteria in E-convex programming

Necessary and sufficient optimality criteria in nonlinear programming are discussed for a class of E-convex programming problems which is considered more general than a class of convex programming problems. We also modify the Fritz John and the Kuhn–Tucker problems to E-Fritz John and E-Kuhn–Tucker problems.     

Convex Sets in Lexicographic Products of Graphs

Geodesic convex sets, Steiner convex sets, and J-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002).     

Sur la Topologie m -Convexe d’une algèbre localement A -convexe

In a locallyA-convex algebra (E, τ) we consider the associatedm-convex topologym(τ). We show that the completion ofE with respect tom(τ) is always a locallyA-convex algebra contained in the complete locally convex space obtained from (E, τ). The topologym(τ) is also used to characterize locally boundedly multiplicatively convex algebras among locallyA-convex ones.

     

Six Kinds of Roughly Convex Functions

This paper considers six kinds of roughly convex functions, namely: δ-convex, midpoint δ-convex, ρ-convex, γ-convex, lightly γ-convex, and midpoint γ-convex functions. The relations between these concepts are presented. It is pointed out that these roughly convex functions have two optimization properties: each r-local minimizer is a global minimizer, and if they assume their maximum on a bounded convex domain D (in a Hilbert space), then they do so at least at one r-extreme point of D, where r denotes the roughness degree of these functions. Furthermore, analytical properties are investigated, such as boundedness, continuity, and conservation properties.     

Convex-compact sets and Banach discs

Every relatively convex-compact convex subset of a locally convex space is contained in a Banach disc. Moreover, an upper bound for the class of sets which are contained in a Banach disc is presented. If the topological dual E′ of a locally convex space E is the σ(E′,E)-closure of the union of countably many σ(E′,E)-relatively countably compacts sets, then every weakly (relatively) convex-compact set is weakly (relatively) compact.     

Sur la Topologiem-Convexe d’une algèbre localementA-convexe

In a locallyA-convex algebra (E, τ) we consider the associatedm-convex topologym(τ). We show that the completion ofE with respect tom(τ) is always a locallyA-convex algebra contained in the complete locally convex space obtained from (E, τ). The topologym(τ) is also used to characterize locally boundedly multiplicatively convex algebras among locallyA-convex ones.     

Weighted Algebras of Vector‐Valued Continuous Functions

In this paper we present a systematic study of the algebras CV (X, E) and CV₀(X, E) of continuous functions with weight conditions given by a Nachbin family V and with values in a locally convex algebra E. Some relevant examples (and counterexamples to some assertions in the literature) are provided.     

Quantitative isoperimetric inequalities for a class of nonconvex sets

Quantitative versions (i.e., taking into account a suitable “distance” of a set from being a sphere) of the isoperimetric inequality are obtained, in the spirit of Fuglede (Trans Am Math Soc 314:619–638, 1989) and Fusco et al. (Ann Math 168:941–980, 2008) for a class of not necessarily convex sets called φ-convex sets. Our work is based on geometrical results on φ-convex sets, obtained using methods of both nonsmooth analysis and geometric measure theory.     

Outer Γ-Convexity in Vector Spaces

A subset S of some vector space X is said to be outer Γ-convex w.r.t. some given balanced subset Γ ? X if for all x ₀, x ₁ ? S there exists a closed subset Λ ? [0,1] such that {x _λ | λ ? Λ} ? S and [x ₀, x ₁] ? {x _λ | λ ? Λ} + 0.5 Γ, where x _λ: = (1 ? λ)x ₀ + λ x ₁. A real-valued function f:D → ? defined on some convex D ? X is called outer Γ-convex if for all x ₀, x ₁ ? D there exists a closed subset Λ ? [0,1] such that [x ₀, x ₁] ? {x _λ | λ ? Λ} + 0.5 Γ and f(x _λ) ≤ (1 ? λ)f(x ₀) + λ f(x ₁) holds for all λ ? Λ. Outer Γ-convex functions possess some similar optimization properties as these of convex functions, e.g., lower level sets of outer Γ-convex functions are outer Γ-convex and Γ-local minimizers are global minimizers. Some properties of outer Γ-convex sets and functions are presented, among others a simplex property of outer Γ-convex sets, which is applied for establishing a separation theorem and for proving the existence of modified subgradients of outer Γ-convex functions.     

DIEUDONNÉ—KÖTHE DUALITY FOR VECTOR—VALUED FUNCTION SPACES: LOCALIZATION OF BOUNDED SETS AND BARRELLEDNESS

Abstract

We study Dieudonné-Köthe spaces of Lusin-measurable functions with values in a locally convex space. Let Λ be a solid locally convex lattice of scalar-valued measurable functions defined on a measure space Ω. If E is a locally convex space, define Λ {E} as the space of all Lusinmeasurable functions f: Ω → E such that q(f(·)) is a function in Λ for every continuous seminorm q on E. The space Λ {E} is topologized in a natural way and we study some aspects of the locally convex structure of A {E}; namely, bounded sets, completeness, duality and barrelledness. In particular, we focus on the important case when Λ and E are both either metrizable or (DF)-spaces and derive good permanence results for reflexivity when the density condition holds.