Corpus ID: 218684884

Lasso formulation of the shortest path problem

@article{Dong2020LassoFO,
  title={Lasso formulation of the shortest path problem},
  author={Anqi Dong and Amirhossein Taghvaei and Tryphon T. Georgiou},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.09152}
}

Anqi Dong, Amirhossein Taghvaei, Tryphon T. Georgiou

Published 2020

Mathematics, Computer Science

ArXiv

The shortest path problem is formulated as an $l_1$-regularized regression problem, known as lasso. Based on this formulation, a connection is established between Dijkstra's shortest path algorithm and the least angle regression (LARS) for the lasso problem. Specifically, the solution path of the lasso problem, obtained by varying the regularization parameter from infinity to zero (the regularization path), corresponds to shortest path trees that appear in the bi-directional Dijkstra algorithm… CONTINUE READING

View PDF on ArXiv

Save to Library

Create Alert

Cite

Launch Research Feed