Related papers: Polynomial approximation on $C^2$-domains
We study the localization of the poles of the best Mobius approximations for locally univalent functions in the unit disk. Sharp geometric bounds for the pole function are established in terms of Pommerenke's linear invariant orders,…
We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…
Let $\Omega\subset{\mathbb R}^2$ be a bounded domain on which Hardy's inequality holds. We prove that $[\exp(u^2)-1]/\delta^2\in L^1(\Omega)$ if $u\in H^1_0(\Omega)$, where $\delta$ denotes the distance to $\partial\Omega$. The…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
We introduce an S.o.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite inequality. Our approach involves utilizing a penalty function framework to directly…
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…
A smooth rigidity inequalitiy provides an explicit lower bound for the $(d+1)$-st derivatives of a smooth function $f$, which holds, if $f$ exhibits certain patterns, forbidden for polynomials of degree $d$. The main goal of the present…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…
In this paper a class of asymmetrical operators of generalised translation is introduced, for each of them generalised moduli of smoothness are introduced, and Jackson's and its converse theorems are proved for those moduli. ----- V…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
This paper mainly studies the gradient-based Jacobi-type algorithms to maximize two classes of homogeneous polynomials with orthogonality constraints, and establish their convergence properties. For the first class of homogeneous…
We obtain asymptotic estimates for the best approximations by trigonometric polynomials in the metric space $C$ $(L_p)$ of classes of periodic functions that can be represented as a convolution of kernels $\Psi_\beta$, which Fourier…
The convergence rates on polynomial interpolation in most cases are estimated by Lebesgue constants. These estimates may be overestimated for some special points of sets for functions of limited regularities. In this paper, by applying the…
We introduce two explicit examples of polynomials orthogonal on the unit circle. Moments and the reflection coefficients are expressed in terms of Jacobi elliptic functions. We find explicit expression for these polynomials in terms of a…
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose less restrictive assumptions on the composite objective functional considering…
Several results on constrained spline smoothing are obtained. In particular, we establish a general result, showing how one can constructively smooth any monotone or convex piecewise polynomial function (ppf) (or any $q$-monotone ppf,…
The article examines Nikolskii and Besov spaces with norms defined using "$L_p$-averaged" mixed moduli of continuity for functions of appropriate orders, instead of mixed moduli of continuity of known orders for certain mixed derivative…
The recovery of multivariate functions and estimating their integrals from finitely many samples is one of the central tasks in modern approximation theory. Marcinkiewicz--Zygmund inequalities provide answers to both the recovery and the…