Results 51 to 60 of about 130 (118)
Abstract We revisit the partial C1,α$\mathrm{C}^{1,\alpha }$ regularity theory for minimizers of non‐parametric integrals with emphasis on sharp dependence of the Hölder exponent α$\alpha$ on structural assumptions for general zero‐order terms. A particular case of our conclusions carries over to the parametric setting of Massari's regularity theorem ...
Thomas Schmidt, Jule Helena Schütt
wiley +1 more source
The preservation of the property of the quasiconvexity of higher order by Bernstein's operators
Not available.
Radu Păltănea
doaj +2 more sources
Lipschitz decompositions of domains with bilaterally flat boundaries
Abstract We study classes of domains in Rd+1,d⩾2$\mathbb {R}^{d+1},\ d \geqslant 2$ with sufficiently flat boundaries that admit a decomposition or covering of bounded overlap by Lipschitz graph domains with controlled total surface area. This study is motivated by the following result proved by Peter Jones as a piece of his proof of the Analyst's ...
Jared Krandel
wiley +1 more source
QoE-Oriented Streaming Power Allocation in LEO Satellite Networks
Low Earth Orbit (LEO) satellite networks are expected to support global multimedia services in future sixth-generation (6G) systems, where streaming media constitutes a major traffic type with stringent Quality of Experience (QoE) requirements.
Huazhi Feng +4 more
doaj +1 more source
Comparative Statics With Adjustment Costs and the Le Chatelier Principle
We develop a theory of monotone comparative statics for models with adjustment costs. We show that comparative‐statics conclusions may be drawn under the usual ordinal complementarity assumptions on the objective function, assuming very little about costs: only a mild monotonicity condition is required.
Eddie Dekel +2 more
wiley +1 more source
An extension of the proximal point algorithm beyond convexity. [PDF]
Grad SM, Lara F.
europepmc +1 more source
BOUNDS ON THE CONDITIONAL AND AVERAGE TREATMENT EFFECT WITH UNOBSERVED CONFOUNDING FACTORS. [PDF]
Yadlowsky S +4 more
europepmc +1 more source
A note on the quasiconvex Jensen divergences and the quasiconvex Bregman divergences derived thereof
19 pages, 3 figures, 1 ...
Frank Nielsen, Gaëtan Hadjeres
openaire +2 more sources
We define quasiconvex programming, a form of generalized linear programming in which one seeks the point minimizing the pointwise maximum of a collection of quasiconvex functions. We survey algorithms for solving quasiconvex programs either numerically or via generalizations of the dual simplex method from linear programming, and describe varied ...
openaire +2 more sources
Detecting quasiconvexity: Algorithmic aspects
The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$. This provides a practical, not just theoretical, procedure for solving the occurrence problem for such subgroups.
openaire +2 more sources

