Investigation of optimal control problems governed by a time-dependent Kohn-Sham model

Many application models in quantum physics and chemistry require to control multi-electron systems to achieve a desired target configuration. This challenging task appears possible in the framework of time-dependent density functional theory (TDDFT) that allows to describe these systems while avoiding the high dimensionality resulting from the multi-particle Schr\"{o}dinger equation. For this purpose, the theory and numerical solution of optimal control problems governed by a Kohn-Sham TDDFT model are investigated, considering different objectives and a bilinear control mechanism. Existence of optimal control solutions and their characterization as solutions to Kohn-Sham TDDFT optimality systems are discussed. To validate this control framework, a time-splitting discretization of the optimality systems and a nonlinear conjugate gradient scheme are implemented. Results of numerical experiments demonstrate the computational capability of the proposed control approach.

Similar Publications

A major challenge faced in the design of large-scale cyber-physical systems, such as power systems, the Internet of Things or intelligent transportation systems, is that traditional distributed optimal control methods do not scale gracefully, neither in controller synthesis nor in controller implementation, to systems composed of millions, billions or even trillions of interacting subsystems. This paper shows that this challenge can now be addressed by leveraging the recently introduced System Level Approach (SLA) to controller synthesis. In particular, in the context of the SLA, we define suitable notions of separability for control objective functions and system constraints such that the global optimization problem (or iterate update problems of a distributed optimization algorithm) can be decomposed into parallel subproblems. Read More

In this paper, we extend the optimal securitization model of Pag\`es [41] and Possama\"i and Pag\`es [42] between an investor and a bank to a setting allowing both moral hazard and adverse selection. Following the recent approach to these problems of Cvitani\'c, Wan and Yang [12], we characterize explicitly and rigorously the so-called credible set of the continuation and temptation values of the bank, and obtain the value function of the investor as well as the optimal contracts through a recursive system of first-order variational inequalities with gradient constraints. We provide a detailed discussion of the properties of the optimal menu of contracts. Read More

The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently solve a network allocation problem motivated by peer-to- peer cloud storage models as alternatives to classical centralized cloud storage services. To this aim, we propose an allocation algorithm that allows the units to use their neighbors to store a back up of their data. Read More

In this short note we consider an unconventional overdetermined problem for the torsion function: let $n\geq 2$ and $\Omega$ be a bounded open set in $\mathbb{R}^n$ whose torsion function $u$ (i.e. the solution to $\Delta u=-1$ in $\Omega$, vanishing on $\partial\Omega$) satisfies the following property: $\sqrt{M-u(x)}$ is convex, where $M=\max\{u(x)\,:\,x\in\overline\Omega\}$. Read More

Using the T-algebra machinery we show that, up to linear isomorphism, the only strictly convex homogeneous cones in $\Re^n$ with $n \geq 3$ are the 2-cones, also known as Lorentz cones or second order cones. In particular, this shows that the p-cones are not homogeneous when $p\neq 2$, $1 < p <\infty$ and $n\geq 3$, thus answering a problem proposed by Gowda and Trott. Read More

For population systems modeled by age-structured hyperbolic partial differential equations (PDEs) that are bilinear in the input and evolve with a positive-valued infinite-dimensional state, global stabilization of constant yield set points was achieved in prior work. Seasonal demands in biotechnological production processes give rise to time-varying yield references. For the proposed control objective aiming at a global attractivity of desired yield trajectories, multiple non-standard features have to be considered: a non-local boundary condition, a PDE state restricted to the positive orthant of the function space and arbitrary restrictive but physically meaningful input constraints. Read More

In this article, we consider the problem of optimal design of a compliant structure under a volume constraint, within the framework of linear elasticity. We introduce the pure displacement and the dual mixed formulations of the linear elasticity problem and we compute the volumetric expressions of the shape gradient of the compliance by means of the velocity method. A preliminary qualitative comparison of the two expressions of the shape gradient is performed through some numerical simulations using the Boundary Variation Algorithm. Read More

This paper studies the approximate and null controllability for impulse controlled systems of heat equations coupled by a pair (A,B) of constant matrices. We present a necessary and sufficient condition for the approximate controllability, which is exactly Kalman's controllability rank condition of (A,B). We prove that when such a system is approximately controllable, the approximate controllability over an interval [0,T] can be realized by adding controls at arbitrary n different control instants 0<\tau_1<\tau_2<\cdots<\tau_nRead More

In this paper, we propose an adaptive framework for the variable power of the fractional least mean square (FLMS) algorithm. The proposed algorithm named as robust variable power FLMS (RVP-FLMS) dynamically adapts the fractional power of the FLMS to achieve high convergence rate with low steady state error. For the evaluation purpose, the problems of system identification and channel equalization are considered. Read More

Optical switches have been drawing attention due to their large data bandwidth and low power consumption. However, scheduling policies need to account for the schedule reconfiguration delay of optical switches to achieve good performance. The Adaptive MaxWeight policy achieves optimal throughput for switches with nonzero reconfiguration delay, and has been shown in simulation to have good delay performance. Read More