Results 1 to 10 of about 60,982 (263)
Upper and lower bounds for the Bregman divergence [PDF]
Journal of Inequalities and Applications, 2019 In this paper we study upper and lower bounds on the Bregman divergence ΔFξ(y,x):=F(y)−F(x)−〈ξ,y−x〉 $\Delta_{\mathcal {F}}^{\xi }(y,x):=\mathcal {F}(y)-\mathcal {F}(x)- \langle \xi , y-x \rangle$ for some convex functional F $\mathcal {F}$ on a normed ...
Benjamin Sprung
doaj +8 more sources
Estimation of upper and lower bounds of Gini coefficient by fuzzy data [PDF]
Data in Brief, 2020 The data presented in this paper are used to examine the uncertainty in macroeconomic variables and their impact on the Gini coefficient. Annual data for the period 2017 - 1996 are taken from the Bank of Iran website https://www.cbi.ir.
Reza Ashraf Ganjoei +3 more
doaj +2 more sources
Upper and Lower Bounds for Capital and Wages
Economía Teoría y Práctica, 2012 El artículo estudia la división de un sistema de producción en los departamentos I y II e introduce una división posterior del departamento II en un sector homotético y otro complementario.
Alberto Benítez Sánchez +1 more
doaj +5 more sources
Quantum SDP-Solvers: Better upper and lower bounds [PDF]
Quantum, 2020 Brandão and Svore \cite{brandao2016QSDPSpeedup} recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms of the dimension $n$ of the problem ...
Joran van Apeldoorn +3 more
doaj +1 more source
Upper and Lower Bounds for Matrix Discrepancy
Journal of Fourier Analysis and Applications, 2022 The aim of this paper is to study the matrix discrepancy problem. Assume that $ξ_1,\ldots,ξ_n$ are independent scalar random variables with finite support and $\mathbf{u}_1,\ldots,\mathbf{u}_n\in \mathbb{C}^d$. Let $\mathcal{C}_0$ be the minimal constant for which the following holds: \[ {\rm Disc}(\mathbf{u}_1\mathbf{u}_1^*,\ldots,\mathbf{u}_n\mathbf ...
Jiaxin Xie, Zhiqiang Xu, Ziheng Zhu
openaire +3 more sources
“Lion and Man”: Upper and Lower Bounds [PDF]
ORSA Journal on Computing, 1992 Given a lion and a man, their initial positions, and restrictions on their ranges and speeds, how quickly can the lion get within a given distance from the man? We consider the case in which the lion and man are restricted to the interior of a circle and each is limited to the same speed. INFORMS Journal on Computing, ISSN 1091-9856, was published as
Laurent Alonso +2 more
openaire +1 more source
Asian Option Pricing Based on the Standardized Logarithm of Geometric Average [PDF]
فصلنامه پژوهشهای اقتصادی ایران, 2015 An Asian option (or average value option) is a special type of option contract. Its payoff is determined by the average underlying price over some pre-set period of time. Asian option is hard to price analytically and numerically.
Abdolrahim Badamchizadeh, Narges Heydari
doaj +1 more source
Upper and lower bounds for $F_v(4,4;5)$ [PDF]
The Electronic Journal of Combinatorics, 2010 In this note we give a computer assisted proof showing that the unique $(5,3)$-Ramsey graph is the unique $K_5$-free graph of order 13 giving $F_v(3,4;5) \leq 13$, then we prove that $17 \leq F_v(2,2,2, 4; 5) \leq F_v(4, 4; 5) \leq 23$. This improves the previous best bounds $16 \leq F_v(4, 4; 5) \leq 25$ provided by Nenov and Kolev.
Xiaodong Xu 0006 +2 more
openaire +2 more sources
Lower Bounds and Upper Bounds for MaxSAT [PDF]
, 2012 This paper presents several ways to compute lower and upperbounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be ...
Federico Heras +2 more
openaire +2 more sources
Inverse Minimum Cut Problem with Lower and Upper Bounds
Mathematics, 2020 The inverse minimum cut problem is one of the classical inverse optimization researches. In this paper, the inverse minimum cut with a lower and upper bounds problem is considered. The problem is to change both, the lower and upper bounds on arcs so that
Adrian Deaconu, Laura Ciupala
doaj +1 more source