spectralGraphTopology version 0.1.2 (2019-23-09)

Two methods to estimate the Laplacian matrix of connected graphs have been added:

• learn_laplacian_gle_mm, which is based on the majorization-minimization (MM) framework.
• learn_laplacian_gle_admm, which is based on the algorithm named alternating direction method of multipliers (ADMM).

More details about the advantages and shortcomings of these two algorithms may be seen here:

• Licheng Zhao, Yiwei Wang, Sandeep Kumar, and Daniel P. Palomar, Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM, IEEE Trans. on Signal Processing, vol. 67, no. 16, pp. 4231-4244, Aug. 2019