Results 1 to 10 of about 131,495 (123)
Some inequalities for a Stancu type operator via (1,1) box convex functions
In this paper we introduce a Stancu type operator and we prove inequalities of Rașa's type.
Ioan Gavrea, Daniel Ianoși
doaj +8 more sources
Empirical Convergence Theory of Harmony Search Algorithm for Box-Constrained Discrete Optimization of Convex Function [PDF]
The harmony search (HS) algorithm is an evolutionary computation technique, which was inspired by music improvisation. So far, it has been applied to various scientific and engineering optimization problems including project scheduling, structural design, energy system operation, car lane detection, ecological conservation, model parameter calibration,
Jin Hee Yoon, Zong Woo Geem
openaire +2 more sources
Distributed Anytime-Feasible Resource Allocation Subject to Heterogeneous Time-Varying Delays
This paper considers distributed allocation strategies, formulated as a distributed sum-preserving (fixed-sum) allocation of resources over a multi-agent network in the presence of heterogeneous arbitrary time-varying delays.
Mohammadreza Doostmohammadian +7 more
doaj +1 more source
Uncertainty Interpretation of the Machine Learning Survival Model Predictions
A method for interpreting uncertainty of predictions provided by machine learning survival models is proposed. It is called UncSurvEx and aims to determine which features of an analyzed example lead to uncertain predictions of an explainable black-box ...
Lev V. Utkin +5 more
doaj +1 more source
Pell’s equation, sum-of-squares and equilibrium measures on a compact set
We first interpret Pell’s equation satisfied by Chebyshev polynomials for each degree $t$, as a certain Positivstellensatz, which then yields for each integer $t$, what we call a generalized Pell’s equation, satisfied by reciprocals of Christoffel ...
Lasserre, Jean B.
doaj +1 more source
AbstractWe give the integral representation of Popoviciu’s (Mathematica 8:1–85, 1934) box-(m, n)-convex functions. Based on this integral representation, we obtain a characterization of box-(m, n)-convex orders, which we then use in the proofs of the Raşa type, the Hermite–Hadamard type and the Jensen inequalities for box-(m, n)-convex functions as ...
Andrzej Komisarski, Teresa Rajba
openaire +1 more source
Chasing Convex Bodies and Functions with Black-Box Advice
We consider the problem of convex function chasing with black-box advice, where an online decision-maker aims to minimize the total cost of making and switching between decisions in a normed vector space, aided by black-box advice such as the decisions of a machine-learned algorithm.
Christianson, Nicolas +2 more
openaire +2 more sources
Inspired by the distributed economic dispatch problem (EDP) in power system, this paper considers a problem of optimizing a sum of m local convex cost functions on an undirected network of m agents. Each agent in the network privately knows its own local
Yuming Feng +3 more
doaj +1 more source
Learning of Continuous and Piecewise-Linear Functions With Hessian Total-Variation Regularization
We develop a novel 2D functional learning framework that employs a sparsity-promoting regularization based on second-order derivatives. Motivated by the nature of the regularizer, we restrict the search space to the span of piecewise-linear box splines ...
Joaquim Campos +2 more
doaj +1 more source
Minimizing Finite Sums with the Stochastic Average Gradient [PDF]
We propose the stochastic average gradient (SAG) method for optimizing the sum of a finite number of smooth convex functions. Like stochastic gradient (SG) methods, the SAG method's iteration cost is independent of the number of terms in the sum. However,
Bach, Francis +2 more
core +4 more sources

