Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM

DOI10.1109/TSP.2019.2925602MaRDI QIDQ5238972zbMATH OpenOpenAlexFDO

Authors

Publication date 28 October 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2019.2925602

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Convex optimization of graph Laplacian eigenvalues
• DC-DistADMM: ADMM Algorithm for Constrained Optimization Over Directed Graphs
• Graph optimization for dimensionality reduction with sparsity constraints
• An empirical comparison of graph Laplacian solvers
• Optimization methods for frame conditioning and application to graph Laplacian scaling
• Optimal graph Laplacian
• Global gradient estimate on graph and its applications
• ADMM for multiaffine constrained optimization
• An ADMM-based scheme for distance function approximation

Cited in

(5)

• A unified framework for structured graph learning via spectral constraints
• Total positivity in multivariate extremes
• Fault detection and isolation of multi-variate time series data using spectral weighted graph auto-encoders
• Min-max framework for majorization-minimization algorithms in signal processing applications: an overview
• Learning graph Laplacian with MCP

This page was built for publication: Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5238972)