Related papers: Obstacle problems generated by the estimates of sq…

The Bregman distance is a central tool in convex optimization, particularly in first-order gradient descent and proximal-based algorithms. Such methods enable optimization of functions without Lipschitz continuous gradients by leveraging…

For p>1 we find the Bellman function of two variables associated with the dyadic maximal operator on Rn.Actually we do that in the more general setting of tree-like maximal operators.We provide a simple and elementary proof,different from…

This paper considers stochastic optimization problems whose objective functions involve powers of random variables. For example, consider the classic Stochastic lp Load Balancing Problem (SLBp): There are $m$ machines and $n$ jobs, and…

Given two martingales on the filtration generated by two dimensional Brownian motion, we want to estimate the $L^p$ norm of the subordinated one if we have some extra orthogonality property available. We construct several new Bellman…

We face a rigidity problem for the fractional $p$-Laplace operator to extend to this new framework some tools useful for the linear case. It is known that $(-\Delta)^s(1-|x|^{2})^s_+$ and $-\Delta_p(1-|x|^{\frac{p}{p-1}})$ are constant…

I. M. Milin proposed, in his 1971 paper, a system of inequalities for the logarithmic coefficients of normalized univalent functions on the unit disk of the complex plane. This is known as the Lebedev-Milin conjecture and implies the…

It is demonstrated that multiplier methods naturally yield better constants in strong converse inequalities for the Bernstein-Durrmeyer operator. The absolute constants obtained in some of the inequalities are independent of the weight and…

A representation of the sharp constant in a pointwise estimate of the gradient of a harmonic function in a multidimensional half-space is obtained under the assumption that function's boundary values belong to $L^p$. This representation is…

We prove the existence and uniqueness of solution of quasilinear stochastic partial differential equations with obstacle (OSPDEs in short) in degenerate case. Using De Giorgi's iteration, we deduce the $L^p-$estimates for the time-space…

Some approaches to solving challenging dynamic programming problems, such as Q-learning, begin by transforming the Bellman equation into an alternative functional equation, in order to open up a new line of attack. Our paper studies this…

We compute the exact John--Nirenberg constant of ${\rm BMO}^p((0,1))$ for $1\le p\le 2,$ which has been known only for $p=1$ and $p=2.$ We also show that this constant is attained in the weak-type John--Nirenberg inequality and obtain a…

Considering the weighted concept of majorization, Sherman obtained generalization of majorization inequality for convex functions known as Sherman's inequality. We extend Sherman's result to the class of n-strongly convex functions using…

We prove a weak-type (1, 1) inequality involving conditioned versions of square functions for martingales in noncommutative $L^p$-spaces associated with finite von Neumann algebras. As application, we determine the optimal orders for the…

By using some deep tools from microlocal analysis, the authors of the papers (Ann. of Math., 165 (2007), 567--591, J. Amer. Math. Soc., 23 (2010), 655--691; Invent. Math., 178 (2009), 119--171; Duke Math. J., 158(2011), 83--120) have…

In this expository article we collect and discuss some recent results on different consequences of a Sharp Reverse H\"older Inequality for $A_{\infty}$ weights. For two given operators $T$ and $S$, we study $L^p(w)$ bounds of…

We apply modern techniques of dyadic harmonic analysis to obtain sharp estimates for the Bergman projection in weighted Bergman spaces. Our main theorem focuses on the Bergman projection on the Hartogs triangle. The estimates of the…

We consider least squares approximation of a function of one variable by a continuous, piecewise-linear approximand that has a small number of breakpoints. This problem was notably considered by Bellman who proposed an approximate algorithm…

We present a simple Bellman function proof of a bilinear estimate for elliptic operators in divergence form with real coefficients and with nonnegative potentials. The constants are dimension-free. The $p$-range of applicability of this…

A family of sharp $L^p$ Sobolev inequalities is established by averaging the length of $i$-dimensional projections of the gradient of a function. Moreover, it is shown that each of these new inequalities directly implies the classical $L^p$…

We provide an alternative proof and expression of the Bellman function of the dyadic maximal operator in connection with the Dyadic Carleson Imbedding Theorem, which appears in [10]. We also evaluate the Bellman function of four variables…