English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we consider the application of several gradient methods to thetraffic assignment problem: we search equilibria in the stable dynamics model(Nesterov and De Palma, 2003) and the Beckmann model. Unlike the celebratedFrank--Wolfe algorithm widely used for the Beckmann model, these gradientsmethods solve the dual problem and then reconstruct a solution to the primalone. We deal with the universal gradient method, the universal method ofsimilar triangles, and the method of weighted dual averages, and estimate theircomplexity for the problem. Due to the primal-dual nature of these methods, weuse a duality gap in a stopping criterion. In particular, we present a novelway to reconstruct admissible flows (i.e.,\ meeting the capacity constraintsand induced by flows on the paths) in the stable dynamics model, which providesus with a computable duality gap.

Finding Equilibria in the Traffic Assignment Problem with Primal-Dual Gradient Methods for Stable Dynamics Model and Beckmann Model