Related papers: Controlled rough paths: a general Hopf-algebraic s…
We prove strong convergence theorems of some iterative algorithms in a real uniformly smooth Banach space. The results presented extend, generalize and improve the corresponding results recently announced by many authors.
We use a rough path-based approach to investigate the degeneracy problem in the context of pathwise control. We extend the framework developed in arXiv:1902.05434 to treat admissible controls from a suitable class of H\"older continuous…
Path Integral Control methods were developed for stochastic optimal control covering a wide class of finite horizon formulations with control affine nonlinear dynamics. Characteristic for this class is that the HJB equation is linear and…
This paper deals with an initial and boundary value problem for a system coupling equation and boundary condition both of Cahn-Hilliard type; an additional convective term with a forced velocity field, which could act as a control on the…
In many problems in optimal control, one seeks to minimise an objective function subject to constraints on the velocity of the system. Imposing these constraints directly -- the ``hard-constrained'' approach -- is often analytically and…
We extend a theorem, originally formulated by Blattner-Cohen-Montgomery for crossed products arising from Hopf algebras weakly acting on noncommutative algebras, to the realm of left Hopf algebroids. Our main motivation is an application to…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
A commutative but not cocommutative graded Hopf algebra $\Hn$, based on ordered rooted trees, is studied. This Hopf algebra generalizes the Hopf algebraic structure of unordered rooted trees $\Hc$, developed by Butcher in his study of…
We equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion of…
We present a general fixed point theorem which can be seen as the quintessence of the principles of proof for Banach's Fixed Point Theorem, ultrametric and certain topological fixed point theorems. It works in a minimal setting, not…
Let G be a locally compact group. Consider the Banach algebra L_1(G)^**, equipped with the first Arens multiplication, as well as the algebra LUC(G)^*, the dual of the space of bounded left uniformly continuous functions on G, whose product…
In this paper we are concerned with restricted additive Schwarz with local impedance transformation conditions for a family of Helmholtz problems in two dimensions. These problems are discretized by the finite element method with conforming…
We prove a sharp version of the Hopf boundary point lemma for Black-Scholes type equations. We also investigate the existence and the regularity of the spatial derivative of the solutions at the spatial boundary.
This paper presents new approaches to the fixed point property for nonexpansive mappings in L^1 spaces. While it is well-known that L^1 fails the fixed point property in general, we provide a complete and self-contained proof that…
The goal of this study is to investigate the local convergence of a three-step Newton-Traub technique for solving nonlinear equations in Banach spaces with a convergence rate of five. The first order derivative of a nonlinear operator is…
We analyze the behavior of families $(u_\alpha)_{\alpha>0}$ of solutions to the high-order critical equation $P_\alpha u_\alpha=\Delta_g^k u_\alpha +\hbox{lot}=|u_\alpha|^{2^\star-2}u_\alpha$ on a Riemannian manifold $M$, with a uniform…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
In this paper, we propose a cubic regularized Newton (CRN) method for solving convex-concave saddle point problems (SPP). At each iteration, a cubic regularized saddle point subproblem is constructed and solved, which provides a search…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example one could decide whether a Hamiltonian path exists for a fixed starting…