Using the above substitutions, a successive coordinate descent algorithm for the dual problem (9) can be formulated as follows:
- 0.
- Set i=1 and
for 
.
- 1.
- Compute parking lot choice based on current values of
:
and use the results to compute
- 2.
- Check stopping criterion:
If for all then STOP.
- 3.
- Compute new values of dual multipliers:
- 4.
- Set i:=i+1 and return to Step 1.
From a practical point of view, it is important to note that step 1 of the algorithm corresponds exactly to solving an uncapacitated parking choice model with a parking lot impedance 
