Page 1 Next

Displaying 1 – 20 of 34

Showing per page

Derivation of physically motivated constraints for efficient interval simulations applied to the analysis of uncertain dynamical systems

Mareile Freihold, Eberhard P. Hofer (2009)

International Journal of Applied Mathematics and Computer Science

Interval arithmetic techniques such as VALENCIA-IVP allow calculating guaranteed enclosures of all reachable states of continuous-time dynamical systems with bounded uncertainties of both initial conditions and system parameters. Considering the fact that, in naive implementations of interval algorithms, overestimation might lead to unnecessarily conservative results, suitable consistency tests are essential to obtain the tightest possible enclosures. In this contribution, a general framework for...

Differentiability of the transition semigroup of the stochastic Burgers equation, and application to the corresponding Hamilton-Jacobi equation

Giuseppe Da Prato, Arnaud Debussche (1998)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We consider a stochastic Burgers equation. We show that the gradient of the corresponding transition semigroup P t φ does exist for any bounded φ ; and can be estimated by a suitable exponential weight. An application to some Hamilton-Jacobi equation arising in Stochastic Control is given.

Distributed accelerated Nash equilibrium learning for two-subnetwork zero-sum game with bilinear coupling

Xianlin Zeng, Lihua Dou, Jinqiang Cui (2023)

Kybernetika

This paper proposes a distributed accelerated first-order continuous-time algorithm for O ( 1 / t 2 ) convergence to Nash equilibria in a class of two-subnetwork zero-sum games with bilinear couplings. First-order methods, which only use subgradients of functions, are frequently used in distributed/parallel algorithms for solving large-scale and big-data problems due to their simple structures. However, in the worst cases, first-order methods for two-subnetwork zero-sum games often have an asymptotic or O ( 1 / t ) convergence....

Distributed event-triggered algorithm for optimal resource allocation of multi-agent systems

Weiyong Yu, Zhenhua Deng, Hongbing Zhou, Xianlin Zeng (2017)

Kybernetika

This paper is concerned with solving the distributed resource allocation optimization problem by multi-agent systems over undirected graphs. The optimization objective function is a sum of local cost functions associated to individual agents, and the optimization variable satisfies a global network resource constraint. The local cost function and the network resource are the private data for each agent, which are not shared with others. A novel gradient-based continuous-time algorithm is proposed...

Currently displaying 1 – 20 of 34

Page 1 Next