ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1812.06295
  4. Cited By
Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms
  for Solving Inverse Symmetric $M$-Matrices

Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric MMM-Matrices

15 December 2018
A. Jambulapati
Kirankumar Shiragur
Aaron Sidford
ArXiv (abs)PDFHTML

Papers citing "Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric $M$-Matrices"

5 / 5 papers shown
Title
Total positivity in Markov structures
Total positivity in Markov structures
Shaun M. Fallat
Steffen Lauritzen
Kayvan Sadeghi
Caroline Uhler
N. Wermuth
Piotr Zwiernik
57
76
0
05 Oct 2015
Spectral Sparsification and Regret Minimization Beyond Matrix
  Multiplicative Updates
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
Zeyuan Allen-Zhu
Zhenyu A. Liao
L. Orecchia
124
90
0
16 Jun 2015
Estimation of positive definite M-matrices and structure learning for
  attractive Gaussian Markov Random fields
Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov Random fields
M. Slawski
Matthias Hein
121
104
0
26 Apr 2014
A parallel approximation algorithm for mixed packing and covering
  semidefinite programs
A parallel approximation algorithm for mixed packing and covering semidefinite programs
Rahul Jain
Penghui Yao
70
14
0
29 Jan 2012
Faster and Simpler Width-Independent Parallel Algorithms for Positive
  Semidefinite Programming
Faster and Simpler Width-Independent Parallel Algorithms for Positive Semidefinite Programming
Richard Peng
Kanat Tangwongsan
Peng Zhang
116
44
0
24 Jan 2012
1