A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
type: Item
instance of: scholarly article
title: A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
zbMATH Open document ID: 1251.90083
author: Anthony Chen
author: Zhong Zhou
author: Xiangdong Xu
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C33
zbMATH DE Number: 6107449
zbMATH Keywords: traffic equilibrium problem
zbMATH Keywords: nonadditive route cost
zbMATH Keywords: gradient projection algorithm
zbMATH Keywords: self-adaptive scheme
MaRDI profile type: Publication
full work available at URL: j.cor.2011.02.018
OpenAlex ID: W2077315737
cites work: The Traffic Equilibrium Problem with Nonadditive Path Costs
cites work: A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
cites work: Solving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
cites work: Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions
cites work: On Traffic Equilibrium Models with a Nonlinear Time/Money Relation
cites work: Equilibrium, games, and pricing in transportation and telecommunication networks
cites work: Q4363161
cites work: A special newton-type optimization method
cites work: Q3134873
cites work: Reformulating the traffic equilibrium problem via a smooth gap function.
cites work: Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
cites work: Computational study of state-of-the-art path-based traffic assignment algorithms
cites work: A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
cites work: Projection methods for variational inequalities with application to the traffic assignment problem
cites work: A class of projection and contraction methods for asymmetric linear variational inequalities and their relations to Fukushima's descent method
cites work: Iterative methods for variational and complementarity problems
cites work: Asymmetric variational inequality problems over product sets: Applications and iterative methods
cites work: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
cites work: Local analysis of Newton-type methods for variational inequalities and nonlinear programming
cites work: Q3477904
cites work: Convex programming in Hilbert space
cites work: Q5576518
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
cites work: An algorithm for the ranking of shortest paths
cites work: Evaluation of choice set generation algorithms for route choice models
cites work: Algorithms – ESA 2004
cites work: Multi-objective and multi-constrained non-additive shortest path problems
DOI: 10.1016/J.COR.2011.02.018
description: scientific article; zbMATH DE number 6107449