Lasso formulation of the shortest path problem

05/19/2020
by   Anqi Dong, et al.
0

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. Although Dijkstra's algorithm and the LARS formulation provide exact solutions, they become impractical when the size of the graph is exceedingly large. To overcome this issue, the alternating direction method of multipliers (ADMM) is proposed to solve the lasso formulation. The resulting algorithm produces good and fast approximations of the shortest path by sacrificing exactness that may not be absolutely essential in many applications. Numerical experiments are provided to illustrate the performance of the proposed approach.

READ FULL TEXT
research
02/24/2022

The Shortest Path with Increasing Chords in a Simple Polygon

We study the problem of finding the shortest path with increasing chords...
research
08/24/2022

Iterative Adaptively Regularized LASSO-ADMM Algorithm for CFAR Estimation of Sparse Signals: IAR-LASSO-ADMM-CFAR Algorithm

The least-absolute shrinkage and selection operator (LASSO) is a regular...
research
07/21/2019

Combining the Connection Scan Algorithm with Contraction Hierarchies

Since the first solutions finding minimally weighted routes in weighted ...
research
04/02/2019

Incorrect implementations of the Floyd--Warshall algorithm give correct solutions after three repeats

The Floyd--Warshall algorithm is a well-known algorithm for the all-pair...
research
03/07/2019

Using DP Towards A Shortest Path Problem-Related Application

The detection of curved lanes is still challenging for autonomous drivin...
research
10/19/2019

An approach to the distributionally robust shortest path problem

In this study we consider the shortest path problem, where the arc costs...

Please sign up or login with your details

Forgot password? Click here to reset