English
Related papers

Related papers: A sharpening of a problem on Bernstein polynomials…

200 papers

Bernstein inequalities and inverse theorems are a recent development in the theory of radial basis function(RBF) approximation. The purpose of this paper is to extend what is known by deriving $L^p$ Bernstein inequalities for RBF networks…

Classical Analysis and ODEs · Mathematics 2013-05-29 John Paul Ward

We consider various inequalities for polynomials, with an emphasis on the most fundamental inequalities of approximation theory. In the sequel a key role is played by the generalized Minkowski functional \alpha(K,x), already being used by…

Classical Analysis and ODEs · Mathematics 2007-05-23 Szilard Gy. Revesz

We introduce deterministic perturbation schemes for the recently proposed random directions stochastic approximation (RDSA) [17], and propose new first-order and second-order algorithms. In the latter case, these are the first second-order…

Optimization and Control · Mathematics 2019-03-29 Prashanth L A , Shalabh Bhatnagar , Nirav Bhavsar , Michael Fu , Steven I. Marcus

In this paper we point out a converse result of the celebrated Jensen inequality for differentiable convex mappings of several variables and apply it to counterpart well-known analytic inequalities. Applications to Shannon's and Renyi's…

Classical Analysis and ODEs · Mathematics 2007-05-23 Sever Silvestru Dragomir

We consider the pointwise weighted approximation by Bernstein operators with inner singularities. The related weight functions are weights $\bar{w}(x)=|x-\xi|^\alpha(0<\xi<1,\ \alpha>0).$ In this paper we give direct and inverse results of…

Functional Analysis · Mathematics 2011-05-25 Wen-ming Lu , Lin Zhang

In the preprint of 1993 the author formulated some conjectures on monotonicity of ratios for exponential series remainders. They are equivalent to conjectures on monotonicity of a ratio of Kummer hypergeometric functions and presumably not…

Classical Analysis and ODEs · Mathematics 2015-01-13 S. M. Sitnik

We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein polynomials by the $r$th Ditzian-Totik modulus of smoothness $\omega_\phi^{r}(f,t)_w$ where $\phi$ is…

Functional Analysis · Mathematics 2010-08-27 Wen-Ming Lu , Lin Zhang

Matrix versions of some basic convexity inequalities are given. Further results on the same topic are proved in the recent papers on arxiv: 1. Hermitian operators and convex functions, 2. A concavity inequality for symmetric norms, 3.…

Functional Analysis · Mathematics 2007-05-23 Jean-Christophe Bourin

We obtain convolution inequalities in Lebesgue and Lorentz spaces with power weights when the functions involved are assumed to be radially symmetric. We also present applications of these results to inequalities for Riesz potentials of…

Classical Analysis and ODEs · Mathematics 2013-08-01 Pablo L. De Nápoli , Irene Drelichman

We provide comparison principles for convex functions through its proximal mappings. Consequently, we prove that the norm of the proximal operator determines a convex the function up to a constant. A new characterization of Lipschitzianity…

Optimization and Control · Mathematics 2020-07-30 Emilio Vilches

We generalize an inequality conjectured by Pohst in 1977 and recently proved by the author and independently by Battistoni and Molteni. This new inequality improves a bound for the regulator in terms of the discriminant for totally real…

Number Theory · Mathematics 2025-09-23 Gabriel Raposo

In order to give a unified generalization of the BW inequality and the DDVV inequality, Lu and Wenzel proposed three Conjectures 1, 2, 3 and an open Question 1 in 2016. In this paper we discuss further these conjectures and put forward…

Differential Geometry · Mathematics 2020-02-11 Jianquan Ge , Fagui Li , Zhiqin Lu , Yi Zhou

We prove that for a probability measure on $\mathbb{R}^n$, the Poincar\'e inequality for convex functions is equivalent to the weak transportation inequality with a quadratic-linear cost. This generalizes recent results by Gozlan et al. and…

Probability · Mathematics 2019-06-18 Radosław Adamczak , Michał Strzelecki

In this paper, using some aspects of convex functions, we refine discrete Jensen's inequality via weight functions. Then, using these results, we give some applications in different abstract spaces and obtain some new interesting…

Numerical Analysis · Mathematics 2007-05-23 Jamal Rooin

In this paper we study nonconvex penalization using Bernstein functions. Since the Bernstein function is concave and nonsmooth at the origin, it can induce a class of nonconvex functions for high-dimensional sparse estimation problems. We…

Machine Learning · Statistics 2013-12-18 Zhihua Zhang

We generalize the inequality being a counterpart of the several complex variables version of the Suita conjecture. For this aim higher order generalizations of the Bergman kernel are introduced. As a corollary some new partial results on…

Complex Variables · Mathematics 2018-11-08 Wlodzimierz Zwonek , Zbigniew Blocki

In a recent work of the authors, we showed some general inequalities governing numerical radius inequalities using convex functions. In this article, we present results that complement the aforementioned inequalities. In particular, the new…

Functional Analysis · Mathematics 2019-07-10 Hamid Reza moradi , Mohammad Sababheh

Proceeding the study of local properties of analytic functions started in [Br] we prove new dimensionless inequalities for such functions in terms of their Chebyshev degree. As a consequence, we obtain the reverse Holder inequalities for…

Complex Variables · Mathematics 2007-05-23 A. Brudnyi

The Bernstein approximation problem is to determine whether or not the space of all polynomials is dense in a given weighted $C_0$-space on the real line. A theorem of L. de Branges characterizes non--density by existence of an entire…

Complex Variables · Mathematics 2012-07-24 Anton Baranov , Harald Woracek

We propose a first order algorithm, a modified version of FISTA, to solve an optimization problem with an objective function that is a sum of a possibly nonconvex function, with Lipschitz continuous gradient, and a convex function which can…

Optimization and Control · Mathematics 2025-08-20 Chee-Khian Sim