Zobrazeno 1 - 10
of 2 786
pro vyhledávání: '"Sublinear function"'
Publikováno v:
European Journal of Operational Research. 298:45-58
The feasibility problem is at the core of the modeling of many problems in various areas, and the quasi-convex function usually provides a precise representation of reality in many fields such as economics, finance and management science. In this pap
Autor:
Hiro Ito, Kyohei Chiba
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :131-141
Publikováno v:
European Journal of Operational Research. 297:268-279
Typical online learning methods have brought fruitful achievements based on the framework of online convex optimization. Meanwhile, nonconvex loss functions also received numerous attentions for their merits of noise-resiliency and sparsity. Current
Autor:
Xue Ding
Publikováno v:
AIMS Mathematics, Vol 7, Iss 2, Pp 1664-1677 (2022)
Let $ \{X_n, n\geq 1\} $ be a sequence of independent and identically distributed random variables in a sublinear expectation $ (\Omega, \mathcal H, {\mathbb {\widehat{E}}}) $ with a capacity $ {\mathbb V} $ under $ {\mathbb {\widehat{E}}} $. In this
Autor:
Zdeněk Dvořák
Publikováno v:
Journal of Graph Theory. 100:270-280
Consider a graph G with an assignment of costs to vertices. Even if G and all its subgraphs admit balanced separators of sublinear size, G may only admit a balanced separator of sublinear cost after deleting a small set Z of exceptional vertices. We
Publikováno v:
Angewandte Chemie International Edition. 60:26226-26232
In terms of molecules and specific reaction examples, organic chemistry features an impressive, exponential growth. However, new reaction classes/types that fuel this growth are being discovered at a much slower and only linear (or even sublinear) ra
Publikováno v:
IEEE Transactions on Automatic Control. 66:5049-5064
In this article, we study constrained online convex optimization (OCO) in the presence of feedback delays, where a decision maker chooses sequential actions without knowing the loss functions and constraint functions a priori . The loss/constraint fu
Autor:
Thorsten Theobald, Helen Naumann
Publikováno v:
Vietnam Journal of Mathematics. 50:447-468
Sublinear circuits are generalizations of the affine circuits in matroid theory, and they arise as the convex-combinatorial core underlying constrained non-negativity certificates of exponential sums and of polynomials based on the arithmetic-geometr
Publikováno v:
Journal of the Egyptian Mathematical Society, Vol 29, Iss 1, Pp 1-14 (2021)
The authors present necessary and sufficient conditions for the oscillation of a class of second order non-linear neutral dynamic equations with non-positive neutral coefficients by using Krasnosel’skii’s fixed point theorem on time scales. The n
Publikováno v:
IEEE Transactions on Automatic Control. 66:4620-4635
Distributed bandit online convex optimization with time-varying coupled inequality constraints is considered, motivated by a repeated game between a group of learners and an adversary. The learners attempt to minimize a sequence of global loss functi