Fetching the paper…
Reading the bibliography…
In this paper we present a connection between two dynamical systems arising in entirely different contexts: one in signal processing and the other in biology.
Iteratively reweighted least squares for maximum likelihood estimation, and some robust and resistant alternatives
Peter J Green · 1984
Earlier work this paper cites.
Finite Algorithms in Optimization and Data Analysis
M. R. Osborne · 1985
Earlier work this paper cites.
Sparse signal reconstruction from limited data using focuss: A re-weighted minimum norm algorithm
I.F. Gorodnitsky and B.D. Rao · 1997
Earlier work this paper cites.
An affine scaling methodology for best basis selection
B.D. Rao and K. Kreutz-Delgado · 1999
Earlier work this paper cites.
Maze-solving by an amoeboid organism
Toshiyuki Nakagaki, Hiroyasu Yamada, and Agota Toth · 2000
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D.L. Donoho and X. Huo · 2001
Earlier work this paper cites.
Optimally sparse representation in general (non-orthogonal) dictionaries via l1 minimization
David L. Donoho and Michael Elad · 2003
Earlier work this paper cites.
Decoding by linear programming
E.J. Candes and T. Tao · 2005
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E.J. Candes, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Mathematical analysis to an adaptive network of the plasmodium system
Tomoyuki Miyaji and Isamu Ohnishi · 2007
Cited alongside, same era.
A mathematical model for adaptive transport network in path finding by true slime mold
Atsushi Tero, Ryo Kobayashi, and Toshiyuki Nakagaki · 2007
Cited alongside, same era.
Iteratively reweighted algorithms for compressive sensing
R. Chartrand and Wotao Yin · 2008
Cited alongside, same era.
Iteratively reweighted least squares minimization for sparse recovery
Physarum can compute shortest paths
Vincenzo Bonifaci, Kurt Mehlhorn, and Girish Varma · 2012
Later among the works it cites.
A slime mold solver for linear programming problems
Anders Johannson and James Zou · 2012
Later among the works it cites.
Physarum can compute shortest paths: Convergence proofs and complexity bounds
Luca Becchetti, Vincenzo Bonifaci, Michael Dirnberger, Andreas Karrenbauer, and Kurt Mehlhorn · 2013
Later among the works it cites.
On the convergence of alternating minimization for convex programming with applications to iteratively reweighted least squares and decomposition schemes
Amir Beck · 2015
Later among the works it cites.
Natural algorithms for flow problems
Damian Straszak and Nisheeth K. Vishnoi · 2016
Closest in time.
On a natural dynamics for linear programming
Damian Straszak and Nisheeth K. Vishnoi · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Ingrid Daubechies, Ronald DeVore, Massimo Fornasier, and C. Si̇nan Güntürk · 2010
Cited alongside, same era.
Convergence Properties for the Physarum Solver
K. Ito, A. Johansson, T. Nakagaki, and A. Tero · 2011
Cited alongside, same era.
Closest in time.