Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces

Computational Optimization and Applications - We develop a globalized Proximal Newton method for composite and possibly non-convex minimization problems in Hilbert spaces. Additionally, we impose...     

Visible-Light Augmented Lithium Storage Capacity in a Ruthenium(II) Photosensitizer Conjugated with a Dione-Catechol Redox Couple

Controlling redox activity of judiciously appended redox units on a photo-sensitive molecular core is an effective strategy for visible light energy harvesting and storage. The first example of a photosensitizer - electron donor coordination compound in which the photoinduced electron transfer step is used for light to electrical energy conversion and storage is reported. A photo-responsive Ru-diimine module conjugated with redox-active catechol groups in [Ru(II)(phenanthroline-5,6-diolate)₃]⁴⁻ photosensitizer can mediate photoinduced catechol to dione oxidation in the presence of a sacrificial electron acceptor or at the surface of an electrode. Under potentiostatic condition, visible light triggered current density enhancement confirmed the light harvesting ability of this photosensitizer. Upon implementation in galvanostatic charge-discharge of a Li battery configuration, the storage capacity was found to be increased by 100 %, under 470 nm illumination with output power of 4.0 mW/cm⁻². This proof-of-concept molecular system marks an important milestone towards a new generation of molecular photo-rechargeable materials.     

Compactness and convergence rates in the combinatorial integral approximation decomposition

The combinatorial integral approximation decomposition splits the optimization of a discrete-valued control into two steps: solving a continuous relaxation of the discrete control problem, and computing a discrete-valued approximation of the relaxed control. Different algorithms exist for the second step to construct piecewise constant discrete-valued approximants that are defined on given decompositions of the domain. It is known that the resulting discrete controls can be constructed such that they converge to a relaxed control in the \(\hbox {weak}^*\) topology of \(L^\infty \) if the grid constant of this decomposition is driven to zero. We exploit this insight to formulate a general approximation result for optimization problems, which feature discrete and distributed optimization variables, and which are governed by a compact control-to-state operator. We analyze the topology induced by the grid refinements and prove convergence rates of the control vectors for two problem classes. We use a reconstruction problem from signal processing to demonstrate both the applicability of the method outside the scope of differential equations, the predominant case in the literature, and the effectiveness of the approach.

     

Judith R. Goodstein: Einstein’s Italian Mathematicians – Ricci,Levi-Civita,and the Birth of General Relativity

Mathematische Semesterberichte -     

Generalized bases of finite groups

Archiv der Mathematik - Motivated by recent results on the minimal base of a permutation group, we introduce a new local invariant attached to arbitrary finite groups. More precisely, a subset...     

Some geometric inequalities for varifolds on Riemannian manifolds based on monotonicity identities

Annals of Global Analysis and Geometry - Using Rauch’s comparison theorem, we prove several monotonicity inequalities for Riemannian submanifolds. Our main result is a general Li–Yau...