Results 11 to 20 of about 850,517 (217)

Coxeter group in Hilbert geometry [PDF]

open access: yes, 2015
A theorem of Tits - Vinberg allows to build an action of a Coxeter group $\Gamma$ on a properly convex open set $\Omega$ of the real projective space, thanks to the data $P$ of a polytope and reflection across its facets.
Marquis, Ludovic
core   +1 more source

Smooth convex extensions of convex functions [PDF]

open access: yesCalculus of Variations and Partial Differential Equations, 2019
Final ...
Azagra, Daniel, Mudarra, Carlos
openaire   +4 more sources

On φ-convexity of convex functions

open access: yesLinear Algebra and its Applications, 1998
AbstractWe construct a non-trivial set φ of extended-real valued functions on Rn, containing all affine functions, such that an extended-real valued function f on Rn is convex if and only if it is φ-convex in the sense of Dolecki and Kurcyusz, i.e., the (pointwise) supremum of some subset of φ. Also, we prove a new sandwich theorem.
Ivan Singer   +1 more
openaire   +2 more sources

Terracini convexity [PDF]

open access: yesMathematical Programming, 2022
AbstractWe present a generalization of the notion of neighborliness to non-polyhedral convex cones. Although a definition of neighborliness is available in the non-polyhedral case in the literature, it is fairly restrictive as it requires all the low-dimensional faces to be polyhedral.
James Saunderson, Venkat Chandrasekaran
openaire   +4 more sources

Convex congruences [PDF]

open access: yesSoft Computing, 2016
For an algebra [Formula: see text] belonging to a quasivariety [Formula: see text], the quotient [Formula: see text] need not belong to [Formula: see text] for every [Formula: see text]. The natural question arises for which [Formula: see text]. We consider algebras [Formula: see text] of type (2, 0) where a partial order relation is determined by the ...
Ivan Chajda, Helmut Länger
openaire   +2 more sources

On representations of the feasible set in convex optimization [PDF]

open access: yes, 2009
We consider the convex optimization problem $\min \{f(x) : g_j(x)\leq 0, j=1,...,m\}$ where $f$ is convex, the feasible set K is convex and Slater's condition holds, but the functions $g_j$ are not necessarily convex.
A. Ben-Tal   +8 more
core   +4 more sources

Schur-Convexity of Averages of Convex Functions [PDF]

open access: yesJournal of Inequalities and Applications, 2011
The object is to give an overview of the study of Schur-convexity of various means and functions and to contribute to the subject with some new results. First, Schur-convexity of the generalized integral and weighted integral quasi-arithmetic mean is studied.
Roqia Ghulam   +3 more
openaire   +4 more sources

Inequalities via s−convexity and log −convexity

open access: yesTopological Algebra and its Applications, 2017
Abstract In this paper, we obtain some new inequalities for functions whose second derivatives’ absolute value is s−convex and log −convex. Also, we give some applications for numerical integration.
ÖZDEMİR, MUHAMET EMİN   +2 more
openaire   +5 more sources

Characterization of tropical hemispaces by (P,R)-decompositions [PDF]

open access: yes, 2013
We consider tropical hemispaces, defined as tropically convex sets whose complements are also tropically convex, and tropical semispaces, defined as maximal tropically convex sets not containing a given point.
Akian   +30 more
core   +5 more sources

Near Convexity, Metric Convexity, and Convexity

open access: yesRocky Mountain Journal of Mathematics, 2007
It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex.
openaire   +3 more sources

Home - About - Disclaimer - Privacy