Modern control theory is challenged by an increasing complexity of the systems to be controlled and meanwhile by the increasing level of demanded performance. In effect, the control performance specification comes with various other design requirements related to energy consumption, communication network topology, computational efficiency, fault-tolerance, robustness/resilience and diverse hard constraints with respect to size, cost, compliance to norms, etc. It can be observed that a significant number of performance specifications admit a mathematical formalization which involves implicitly or explicitly some structural sparsity requirements (e.g., design of network topology with minimum communication links, estimation in the presence of sporadic data losses, impulsive noise-tolerant control, identification of switched systems, etc). Furthermore, sparsity constraints can arise as a mere methodological device induced by the intrinsic nature of the control engineering problem, as well as from sparse uncertainties which can take the form of parametric inaccuracies in the system model or sparse disturbances affecting the measurements and the control signals. For example, a large-scale control system, such as a chemical plant or a power grid, could be subject to a myriad of failures, but it is very rare that a large number of faults occur simultaneously. Meanwhile, sparsity constraints can be leveraged to model critical situations where the sensory and control channels are under an integrity attack from a resource-constrained adversary, who can only break the encryption on a small subset of the signals. In all these situations, the structural sparsity, whether induced by intermittent errors, spatially distributed faults or adversary attacks, can usually be represented by additive sparse or low-rank matrices.From a methodological viewpoint, sparsity-inducing optimization is a powerful paradigm for developing control and estimation schemes that are robust to the aforementioned sparse uncertainties. Sparse optimization refers to a mathematical optimization framework in which the to-be-optimized objective function or the associated constraints involve an sparsity measure on the data such as the rank of a matrix, the "zero-norm" of a vector or the cardinality of a set. Although most of the sparse optimization problems are combinatorial in nature, recent advancements, such as 𝓁 1 relaxation and basis pursuit, have greatly reduced the computational complexity of sparse optimization for many practical problems. For example, compressed sensing has leveraged sparsity to bring a remarkable methodological shift in the way of acquiring, representing and processing information-bearing signals. Even though sparse optimization has been initially investigated in the communities of signal processing, information theory and machine learning, it has now been successfully applied to many other fields including the field of control systems design. For example, sparsity-inducing optimization has proven to be a powerful principle for devel...