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 -     

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...     

How to speed up the detection of aerobic microbial contaminations by using isothermal microcalorimetry

Journal of Thermal Analysis and Calorimetry - A sudden expansion is a classical problem which is happened in different industries such as energy conversion, environmental control, and chemical...     

Solidifying framework nucleic acids

正Living organisms have developed their unique strategies during the natural evolution for building hard tissues with minerals, including silica, calcium carbonate, calcium phosphate, and ferric oxide [1]. Such biomineralized materials generally have complex hierarchical structures with excellent mechanical properties. Although bioinspired approaches have led to the creation of well-defined synthetic structural materials ranging from micro to macro scales, the rational design of discrete biomimetic structures at the nanoscale remains a grand challenge.     

Effects of multiple delays on dynamics of a five-neuron network model

A five-neuron network model with multiple delays is proposed. This paper presents the combined effect of different delays on the dynamics of the proposed network. Pitchfork bifurcation is discussed in detail with the variation of the value of coupled weight or attenuation rate of internal neurons. By analyzing the corresponding characteristic equation, some stable criteria on delay-dependence and delay-independence are derived including multiple delays and coupled weights and the periodic oscillation arises bifurcated from the trivial equilibrium after the network loses its stability. Stable regions on delay-dependence are displayed in the two delayed parameter plane. It is shown that multiple delays can produce stability switching between resting state and periodic activity. Finally, theoretical results are justified by providing two illustrative examples.