Related papers: Optimal sine and sawtooth inequalities
A unique sink orientation (USO) is an orientation of the edges of a hypercube such that each face has a unique sink. Many optimization problems like linear programs reduce to USOs, in the sense that each vertex corresponds to a possible…
In this paper we prove some exponential inequalities involving the sinc function. We analyze and prove inequalities with constant exponents as well as inequalities with certain polynomial exponents. Also, we establish intervals in which…
In this note, we obtain an exact formula for the $q$-adic valuation of $\sigma_k(n)$ where $q$ is an odd prime, allowing us to derive an explicit upper bound which is asymptotically better than the previous bound obtained by Zhao when $n$…
We study optimization algorithms for the finite sum problems frequently arising in machine learning applications. First, we propose novel variants of stochastic gradient descent with a variance reduction property that enables linear…
The note concerns the $\bar\partial$ problem on product domains in $\mathbb C^2$. We show that there exists a bounded solution operator from $C^{k, \alpha}$ into itself, $k\in \mathbb Z^+\cup \{0\}, 0<\alpha< 1$. The regularity result is…
The task of learning to pick a single preferred example out a finite set of examples, an "optimal choice problem", is a supervised machine learning problem with complex, structured input. Problems of optimal choice emerge often in various…
In this paper, we are interested in shape optimization problems involving the ge ometry (normal, curvatures) of the surfaces. We consider a class of hypersurface s in $\mathbb{R}^{n}$ satisfying a uniform ball condition and we prove the…
Given a finite subset $\Sigma\subset\mathbb{R}$ and a positive real number $q<1$ we study topological and measure-theoretic properties of the self-similar set $K(\Sigma;q)=\big\{\sum_{n=0}^\infty…
We consider the inverse optimization problem associated with the polynomial program f^*=\min \{f(x): x\in K\}$ and a given current feasible solution $y\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution.…
The Sinc approximation has shown high efficiency for numerical methods in many fields. Conformal maps play an important role in the success, i.e., appropriate conformal map must be employed to elicit high performance of the Sinc…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…
The total complexity (measured as the total number of gradient computations) of a stochastic first-order optimization algorithm that finds a first-order stationary point of a finite-sum smooth nonconvex objective function $F(w)=\frac{1}{n}…
The optimization version of the cavity method for single instances, called Max-Sum, has been applied in the past to the Minimum Steiner Tree Problem on Graphs and variants. Max-Sum has been shown experimentally to give asymptotically…
We consider the valuation problem of an (insurance) company under partial information. Therefore we use the concept of maximizing discounted future dividend payments. The firm value process is described by a diffusion model with constant…
We present an $n\Delta^{O(k^2)}$ time algorithm to obtain an optimal solution for $1$-dimensional cutting stock problem: the bin packing problem of packing $n$ items onto unit capacity bins under the restriction that the number of item…
The general inverse kinematics (IK) problem of a manipulator, namely that of acquiring the self-motion manifold (SMM) of all admissible joint angles for a desired end-effector pose, plays a vital role in robotics modeling, planning and…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
We find the optimal constant $C$ such that \begin{equation*} \|f_1*f_2*\dots*f_{k}\|_{\infty}\geq C\prod_{i=1}^{k}\|f_i\|_1 \end{equation*} for functions $f_i:\{0,1\}^d\to\mathbb{R}$. As applications, we derive bounds for Sidon sets on…
We present in this paper two different classes of general $K$-splitting algorithms for solving finite-dimensional convex optimization problems. Under the assumption that the function being minimized has a Lipschitz continuous gradient, we…
In this paper we established a new Simpson type conformable fractional integral equality for convex functions. Based on this identity, some results related to Simpson-like type inequalities are obtained. These results are then applied to…