Maximum Likelihood Identification of an Information Matrix Under Constraints in a Corresponding Graphical Model
We address the problem of identifying the neighborhood structure of an undirected graph, whose nodes are labeled with the elements of a multivariate normal (MVN) random vector. A semi-definite program is given for estimating the information matrix under arbitrary constraints on its elements. More i...
Main Author: | Li, Nan |
---|---|
Other Authors: | Randy Clinton Paffenroth, Advisor |
Format: | Others |
Published: |
Digital WPI
2017
|
Subjects: | |
Online Access: | https://digitalcommons.wpi.edu/etd-theses/128 https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1127&context=etd-theses |
Similar Items
-
Maximizing Harvested Energy for Full-Duplex SWIPT System With Power Splitting
by: Zhongwei Hu, et al.
Published: (2017-01-01) -
PARETO-OPTIMALITY AND L-OPTIMAL FOR SOLVING SOME CLASSES OF OPTIMAL CONTROL PROBLEM
by: V. V. Kiselev
Published: (2017-10-01) -
A general-equilibrium closed-form solution to the welfare costs of inflation
by: Rubens Penha Cysne
Published: (2005-06-01) -
Radius problems for a subclass of close-to-convex univalent functions
by: Khalida Inayat Noor
Published: (1992-01-01) -
On alpha-close-to-convex functions of order beta
by: M. A. Nasr
Published: (1986-01-01)