Generalized convex functionals and some duality results

The purpose of this paper is to discuss some generalizations of convex functionals and obtain some applications to optimality and duality     

Minimization of convex functionals over frame operators

We present results about minimization of convex functionals defined over a finite set of vectors in a finite-dimensional Hilbert space, that extend several known results for the Benedetto-Fickus frame potential. Our approach depends on majorization techniques. We also consider some perturbation problems, where a positive perturbation of the frame operator of a set of vectors is realized as the frame operator of a set of vectors which is close to the original one.     

Minimization of entropy functionals

Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Primal attainment, dual equalities, dual attainment and characterizations of the minimizers are obtained with weak constraint qualifications. These results improve several aspects of the literature on the subject.     

Optimality conditions and duality in multiple objective programming involving semilocally convex and related functions

A nonlinear multiple objective programming problem is considered where the functions involved are nondifferentiable. By considering the concept of weak minima, the Fritz John type and Karush-Kuhn- Tucker type necessary optimality conditions and Wolfe and Mond-Weir type duality results are given in terms of the right differentials of the functions. The duality results are stated by using the concepts of generalized semilocally convex functions     

Minimization of functionals generating curvature operators

Problems of minimization of functionals, related to curvature operators of order m, are formulated. Existence theorems for the minimizer are proved.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 182, pp. 29–37, 1990.     

The role of duality in optimization problems involving entropy functionals with applications to information theory

We consider infinite-dimensional optimization problems involving entropy-type functionals in the objective function as well as as in the constraints. A duality theory is developed for such problems and applied to the reliability rate function problem in information theory.This research was supported by ONR Contracts N00014-81-C-0236 and N00014-82-K-0295 with the Center for Cybernetics Studies, University of Texas, Austin, Texas. The first author was partly supported by NSF.     

On constrained maxima of convex functions

This paper states and proves Kuhn-Tucker necessary conditions for a maximum point of a convex function subject to convex constraints. Also presented are conditions which imply that the optimal policy set of this type program is a continuous point-to-set mapping of the resource vector.     

Second-order subgradients of convex integral functionals

The purpose of this work is twofold: on the one hand, we study the second-order behaviour of a nonsmooth convex function defined over a reflexive Banach space . We establish several equivalent characterizations of the set , known as the second-order subdifferential of at relative to . On the other hand, we examine the case in which is the functional integral associated to a normal convex integrand . We extend a result of Chi Ngoc Do from the space to a possible nonreflexive Banach space . We also establish a formula for computing the second-order subdifferential .

     

Boundedness and continuity of additive and convex functionals

Summary It is shown that for any real Baire topological vector spaceX the set classesA(X):={T : for any open and convex setD T, every Jensen-convex functional, defined onD and bounded from above onT, is continuous} andB(X):={T : every additive functional onX, bounded from above onT, is continuous} are equal. This generalizes a result of Marcin E. Kuczma (1970) who has shown the equalityA( ⁿ )=B( ⁿ ) However, the infinite dimensional case requires completely different methods; therefore, even in the caseX = ⁿ we obtain a new (and perhaps simpler) proof than that given by M. E. Kuczma.     

Norm duality for convex processes and applications

One can associate two norms with a Banach space convex process. These norms are dual to each other and the norm of a process agrees with the dual norm of its adjoint. This norm duality provides an extremely general and simple way of establishing surjectivity or boundedness properties of homogeneous (linear or convex) inequality systems.This research was partially supported by the Natural Sciences and Engineering Research Council of Canada.     

Minimization of integral functionals depending on lipschitz domains

In this paper is solved a minimization problem for what is essentially an integral functional depending on domains which verify an uniform cone property with a fixed parameter θ by extending the techniques land results of O. Caligaris and P. Oliva ‘1’ for convex sets. A Dirichlet condition and an obstacle are considered.     

Sections and projections of nested convex bodies

Aequationes mathematicae - One of the most important problems in Geometric Tomography is to establish properties of a given convex body if we know some properties over its sections or its...     

Linear functionals and the duality principle for harmonic functions

Let ${\mathcal H}$ be the class of complex‐valued harmonic functions in the unit disk |z| < 1 and ${\mathcal H}_1$ the set of all functions $f\in {\mathcal H}$ such that f(0) = 0, f_z(0) = 1 and $f_{\overline{z}}(0)=0$. For $V \subset {\mathcal H}_1$, its dual V* is where * denotes the Hadamard product for harmonic functions. The set V is a dual class if V = W* for some $W \subset {\mathcal H}_1.$ In the present paper, the duality principle is extended to ${\mathcal H}_1$ by means of the Hadamard product. Counterparts of the dual classes are introduced and their structural properties studied.     

Limit theorems for functionals of convex hulls

Summary In [4] a central limit theorem for the number of vertices of the convex hull of a uniform sample from the interior of a convex polygon is derived. This is done by approximating the process of vertices of the convex hull by the process of extreme points of a Poisson point process and by considering the latter process of extreme points as a Markov process (for a particular parametrization). We show that this method can also be applied to derive limit theorems for the boundary length and for the area of the convex hull. This extents results of Rényi and Sulanke (1963) and Buchta (1984), and shows that the boundary length and the area have a strikingly different probabilistic behavior.     

On duality theory of convex semi-infinite programming

In this article we discuss weak and strong duality properties of convex semi-infinite programming problems. We use a unified framework by writing the corresponding constraints in a form of cone inclusions. The consequent analysis is based on the conjugate duality approach of embedding the problem into a parametric family of problems parameterized by a finite-dimensional vector.