This article considers the Wasserstein barycentric coordinates problem for Gaussian distributions which is the inverse problem of the Wasserstein barycenter problem. These coordinates take into account the underlying geometry of the measure space of Gaussian distributions and are thus meaningful for applications such as diffusion analysis and distributed information fusion. When the probability supports are discrete and identical, the theory of Wasserstein barycentric coordinates is well developed. However, for general probability distributions, the computation of Wasserstein barycentric coordinates is intractable since the technical hurdles involve solving a non-convex and non-concave optimization problem. For Gaussian distributions, we derive the closed-form expression of the derivatives for the objective function and propose a projected gradient descent method to solve the problem. Finally, we illustrate its application in diffusion tensor image (DTI) denoising including simulated DTI with different noise levels and DTI of the human brain.

This paper addresses the localization challenge in cooperative multi-agent wireless sensor networks, specifically focusing on range-based localization. To enhance robustness against outliers in range measurements, we employ the Huber function, leading to the formulation of a robust yet nonconvex optimization problem with coupled agent variables. Confronted with this nonconvex optimization challenge, particularly in largescale networks, we reformulate the problem using Lagrange duality and conjugate theory. This restructuring yields subproblems characterized by smooth strong convexity for dual variables and a simplified form for primal variables, thereby facilitating an efficient solution. Building upon this reformulation, we introduce a novel distributed primal-dual algorithm that employs coordinate descent and proximal minimization techniques within an iterative framework. This approach furnishes closed-form solutions for both primal and dual variables. Theoretically, our method ensures not only the convergence of the sequence of objective function values but also, by leveraging the KurdykaŁojasiewicz property, we establish the guaranteed global convergence of the location estimates sequence to a critical point of the original objective function. Notably, our proposed approach exhibits lower computational complexity, communication cost, and storage space compared to existing methods. Numerical experiments underscore the superiority of the proposed method in terms of robustness and localization accuracy when compared to the other methods in the literature.