English
Related papers

Related papers: Properties of Generalized Polyhedral Convex Multif…

200 papers

Extension problems for polynomial valuations on different cones of convex functions are investigated. It is shown that for the classes of functions under consideration, the extension problem reduces to a simple geometric obstruction on the…

Functional Analysis · Mathematics 2024-08-14 Jonas Knoerr , Jacopo Ulivelli

Based on Colombeau's theory of algebras of generalized functions we introduce the concepts of generalized functions taking values in differentiable manifolds as well as of generalized vector bundle homomorphisms. We study their basic…

Functional Analysis · Mathematics 2007-05-23 Michael Kunzinger

In the paper we show the existence of different types of peak functions in classes of $\mathbb C$-convex domains. As one of tools used in this context is a result on preserving the regularity of $\mathbb C$-convex domains under projection.

Complex Variables · Mathematics 2017-10-03 Peter Pflug , Wlodzimierz Zwonek

We study the local and global versions of the convexity, which is closely related to the problem of extending a convex function on a non-convex domain to a convex function on the convex hull of the domain and beyond the convex hull. We also…

Classical Analysis and ODEs · Mathematics 2013-08-08 Min Yan

Given a strictly positive measure, we characterize inner semicontinuous solid convex-valued mappings for which continuous functions which are selections almost everywhere are selections. This class contains continuous mappings as well as…

Optimization and Control · Mathematics 2013-08-23 Ari-Pekka Perkkiö

This paper addresses the study and applications of polyhedral duality of locally convex topological vector (LCTV) spaces. We first revisit the classical Rockafellar's proper separation theorem for two convex sets one which is polyhedral and…

Optimization and Control · Mathematics 2021-09-21 Dang Van Cuong , Boris Mordukhovich , Nguyen Mau Nam , Sandine Gary

Geometrically convex functions constitute an interesting class of functions obtained by replacing the arithmetic mean with the geometric mean in the definition of convexity. As recently suggested, geometric convexity may be a sensible…

Risk Management · Quantitative Finance 2024-03-12 Mücahit Aygün , Fabio Bellini , Roger J. A. Laeven

The present paper is concerned with Lipschitz properties of convex mappings. One considers the general context of mappings defined on an open convex subset $\Omega$ of a locally convex space $X$ and taking values in a locally convex space…

Functional Analysis · Mathematics 2017-01-12 S. Cobzaş

A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…

Optimization and Control · Mathematics 2025-04-22 Ningji Wei

In this paper we introduce Hausdorff locally convex algebra topologies on subalgebras of the whole algebra of nonlinear generalized functions. These topologies are strong duals of Fr\'echet-Schwartz space topologies and even strong duals of…

Functional Analysis · Mathematics 2014-03-21 J. Aragona , J. F. Colombeau , S. O. Juriaans

The g-convexity of functions on manifolds is a generalization of the convexity of functions on Rn. It plays an essential role in both differential geometry and non-convex optimization theory. This paper is concerned with g-convex smooth…

Differential Geometry · Mathematics 2024-09-24 Yu Wang , Ke Ye

This paper considers projection and convolution operations for integrally convex functions, which constitute a fundamental function class in discrete convex analysis. It is shown that the class of integrally convex functions is stable under…

Optimization and Control · Mathematics 2018-08-09 Satoko Moriguchi , Kazuo Murota

Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays…

Optimization and Control · Mathematics 2014-03-13 Frank Heyde , Carola Schrage

In this paper we study some relationships between polyhedral convex sets (PCS) and generalized polyhedral convex sets (GPCS). In particular, we clarify by a counterexample that the necessary and sufficient conditions for the separation of a…

Optimization and Control · Mathematics 2022-12-26 Nguyen Ngoc Luan , Nguyen Mau Nam , Nguyen Nang Thieu , Nguyen Dong Yen

The generalized divided differences are introduced. They are applied to investigate some properties characterizing generalized higher-order convexity. Among others some support-type property is proved.

Functional Analysis · Mathematics 2008-07-28 Szymon Wasowicz

The main problem considered in the present paper is to single out classes of convex sets, whose convexity property is preserved under nonlinear smooth transformations. Extending an approach due to B.T. Polyak, the present study focusses on…

Optimization and Control · Mathematics 2019-06-06 Amos Uderzo

Motivated by a long-standing conjecture of Polya and Szeg\"o about the Newtonian capacity of convex bodies, we discuss the role of concavity inequalities in shape optimization, and we provide several counterexamples to the…

Optimization and Control · Mathematics 2011-02-10 Dorin Bucur , Ilaria Fragalà , Jimmy Lamboley

The purpose of this paper is to provide a set of sufficient conditions so that the normalized form of the Fox-Wright functions have certain geometric properties like close-to-convexity, univalency, convexity and starlikeness inside the unit…

Classical Analysis and ODEs · Mathematics 2019-03-14 Khaled Mehrez

In this paper we established new integral inequalities which are more general results for coordinated convex functions on the coordinates by using some classical inequalities.

Classical Analysis and ODEs · Mathematics 2011-07-21 M. Emin Ozdemir , Cetin Yildiz , Ahmet Ocak Akdemir

Submodular set-functions have many applications in combinatorial optimization, as they can be minimized and approximately maximized in polynomial time. A key element in many of the algorithms and analyses is the possibility of extending the…

Machine Learning · Computer Science 2016-02-24 Francis Bach