Related papers: Inequalities between remainders of quadratures
We investigate quadrature rules for measures supported on real algebraic and rational curves, focusing on the {odd-degree} case \(2s-1\). Adopting an optimization viewpoint, we minimize suitable penalty functions over the space of…
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…
The purpose of this paper is to show stability of order preserving/reversing transforms on the class of non-negative convex functions in ${\mathbb R}^n$, and its subclass, the class of non-negative convex functions attaining $0$ at the…
Classical results show that gradient descent converges linearly to minimizers of smooth strongly convex functions. A natural question is whether there exists a locally nearly linearly convergent method for nonsmooth functions with quadratic…
Recent work on the quantization of Maxwell theory has used a non-covariant class of gauge-averaging functionals which include explicitly the effects of the extrinsic-curvature tensor of the boundary, or covariant gauges which, unlike the…
We investigate the asymptotic behavior of sequences generated by the proximal point algorithm for convex functions in complete geodesic spaces with curvature bounded above. Using the notion of resolvents of such functions, which was…
A framework is presented to compute approximations of an integral $I(f)=\displaystyle \int_a^b f(x) dx$ from a pair of companion rules and its associate rule. We show that an associate rule is a weighted mean of two companion rules. In…
We consider the problem of finding critical points of functions that are non-convex and non-smooth. Studying a fairly broad class of such problems, we analyze the behavior of three gradient-based methods (gradient descent, proximal update,…
We revisit the classical dual ascent algorithm for minimization of convex functionals in the presence of linear constraints, and give convergence results which apply even for non-convex functionals. We describe limit points in terms of the…
In this work, we analyze two of the most fundamental algorithms in geodesically convex optimization: Riemannian gradient descent and (possibly inexact) Riemannian proximal point. We quantify their rates of convergence and produce different…
The Eigendecomposition of quadratic forms (symmetric matrices) guaranteed by the spectral theorem is a foundational result in applied mathematics. Motivated by a shared structure found in inferential problems of recent interest---namely…
This short study consists of two parts, firstly we obtain some inequalities on Caputo Fractional derivatives using the elementary inequalities. Secondly we establish several new inequalities including Caputo fractional derivatives for…
We establish various extensions of the convexity Dines theorem for a (joint-range) pair of inhomogeneous quadratic functions. If convexity fails we describe those rays for which the sum of the joint-range and the ray is convex. These…
The light trajectory in the gravitational field of one body at rest with monopole and quadrupole structure is determined in the second post-Newtonian (2PN) approximation. The terms in the geodesic equation for light rays are separated into…
The main goal of the paper is to prove the sandwich theorem for geodesic convex functions in a complete Riemannian manifold. Then by using this theorem we have proved an inequality in a manifold with bounded sectional curvature. Finally, we…
Randomized quadratures for integrating functions in Sobolev spaces of order $\alpha \ge 1$, where the integrability condition is with respect to the Gaussian measure, are considered. In this function space, the optimal rate for the…
We establish Maximum Principles which apply to vectorial approximate minimizers of the general integral functional of Calculus of Variations. Our main result is a version of the Convex Hull Property. The primary advance compared to results…
A new version of the Hadwiger theorem on convex functions is established and an explicit representation of functional intrinsic volumes is found using new functional Cauchy-Kubota formulas. In addition, connections between functional…
We consider the problem of minimizing the average of a large number of smooth but possibly non-convex functions. In the context of most machine learning applications, each loss function is non-negative and thus can be expressed as the…
Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…