Name
Abstract | ||
|---|---|---|
The shortest path problem is formulated as an l
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub>
-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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/CDC42340.2020.9303909 | 2020 59th IEEE Conference on Decision and Control (CDC) |
Keywords | DocType | ISSN |
lasso formulation,shortest path problem,regression problem,Dijkstra's shortest path algorithm,angle regression,lasso problem,solution path,regularization path,path trees | Conference | 0743-1546 |
ISBN | Citations | PageRank |
978-1-7281-7448-8 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dong Anqi | 1 | 0 | 0.34 |
| Taghvaei Amirhossein | 2 | 0 | 0.34 |
| Tryphon T. Georgiou | 3 | 211 | 36.71 |