Controllability maximization of large-scale systems using projected gradient method

Abstract

In this work, we formulate two controllability maximization problems for large-scale networked dynamical systems such as brain networks: The first problem is a sparsity constraint optimization problem with a box constraint. The second problem is a modified problem of the first problem, in which the state transition matrix is Metzler. In other words, the second problem is a realization problem for a positive system. We develop a projected gradient method for solving the problems, and prove global convergence to a stationary point with locally linear convergence rate. The projections onto the constraints of the first and second problems are given explicitly. Numerical experiments using the proposed method provide non-trivial results. In particular, the controllability characteristic is observed to change with increase in the parameter specifying sparsity, and the change rate appears to be dependent on the network structure.

References in corpus (11)

• Controllability of Brain Networks
• Control Principles of Complex Networks
• Exact Controllability of Complex Networks
• The fundamental advantages of temporal networks
• On Submodularity and Controllability in Complex Dynamical Networks
• Controlling edge dynamics in complex networks
• Structure-based control of complex networks with nonlinear dynamics
• Control of Dynamics in Brain Networks
• Observability and Controllability of Nonlinear Networks: The Role of Symmetry
• Topological Principles of Control in Dynamical Network Systems
• Benchmarking measures of network controllability on canonical graph models