Search

This paper investigates the distributed optimal coordination (DOC) problem for multiple heterogeneous linear systems over strongly connected communication networks. By exploiting output regulation techniques, constructing a Laplacian matrix based on the outdegree, and assigning each agent an additional scalar state variable, a new DOC algorithms is developed, which can solve the DOC problem using the outdegree information of all agents. In contrast to the existing results, this paper presents a new technique to solve the DOC problem for multiple heterogeneous linear systems over weighted-unbalanced communication networks. Finally, numerical simulations are presented to illustrate the effectiveness of the designed algorithm. [ABSTRACT FROM AUTHOR]

This paper considers the problem of online optimization where the objective function is time-varying. In particular, we extend coordinate descent type algorithms to the online case, where the objective function varies after a finite number of iterations of the algorithm. Instead of solving the problem exactly at each time step, we only apply a finite number of iterations at each time step. Commonly used notions of regret are used to measure the performance of the online algorithm. Moreover, coordinate descent algorithms with different updating rules are considered, including both deterministic and stochastic rules that are developed in the literature of classical offline optimization. A thorough regret analysis is given for each case. Finally, numerical simulations are provided to illustrate the theoretical results. [ABSTRACT FROM AUTHOR]

Sparse Bayesian learning (SBL) with its self-regulation and uncertainty estimation features, has become a popular topic in the field of sparse signal recovery. However, it is a challenging problem to employ zero-norm penalty on signals in the hierarchical framework of SBL. In this paper, an SBL approach that approximates the zero-norm penalized spare signal recovery is proposed based on the idea that signals can be modeled using generalized Gaussian distribution (GGDs). It should be noted that the mean and variance of GGDs are related to its shape parameters, making the direct use of GGDs in Bayesian inference impractical. To solve this problem, we derives a proposition and further build a new hierarchical Bayesian framework (HrBayFw). The proposed HrBayFw is equivalent to assign ℓ p -norm penalty to signals, and the parameter p can be designed to approximate 0. Thus, the zero-norm penalized spare signal recovery can be realized using SBL, and the use of the proposition enables tractable marginalization over all parameters. The main advantage of the proposed approach is that it achieves a lower reconstruction error than current Bayesian methods. Numerical simulations evidence that the proposed SBL approach achieves better accuracy performance in terms of normalized-mean-square-error comparing with other contemporary algorithms. [ABSTRACT FROM AUTHOR]