In this article we generalize the convolution quadrature (CQ) method, which aims at approximating fractional calculus, to case for distributed order calculus. Our method is a natural expansion that approximation formulas, convergence results and correction technique reduce cases CQ if weight function $ \mu(\alpha) defined by \delta(\alpha-\alpha_0) $. Further, explore new structure of solution ...

In this work we address the problem of convex optimization in a multi-agent setting where objective is to minimize mean local cost functions whose derivatives are not available (e.g. black-box models). Moreover agents can only communicate with neighbors according connected network topology. Zeroth-order (ZO) has recently gained increasing attention federated learning and scenarios exploiting fi...