Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities

DOI10.1016/S0377-2217(03)00423-5zbMath1065.90015OpenAlexW2029875167WikidataQ59297280 ScholiaQ59297280MaRDI QIDQ1887951

Deren Han, Hong Kam Lo

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00423-5

zbMATH Keywords

Variational inequalitiesTraffic assignmentCo-coercivity

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Discrete location and assignment (90B80) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)

Related Items

Mann type iterative methods for finding a common solution of split feasibility and fixed point problems ⋮ Extra-gradient methods for solving split feasibility and fixed point problems ⋮ A convergence analysis result for constrained convex minimization problem ⋮ Regularized gradient-projection methods for equilibrium and constrained convex minimization problems ⋮ A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings ⋮ Continuity of the effective delay operator for networks based on the link delay model ⋮ A fast continuous method for the extreme eigenvalue problem ⋮ The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems ⋮ Multistep hybrid extragradient method for triple hierarchical variational inequalities ⋮ Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems ⋮ Extragradient method for convex minimization problem ⋮ Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem ⋮ Iterative approximation of solutions for constrained convex minimization problem ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ A modified projection method for solving co-coercive variational inequalities ⋮ A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions ⋮ Some Goldstein's type methods for co-coercive variant variational inequalities ⋮ Some modified extragradient methods for solving split feasibility and fixed point problems ⋮ Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem ⋮ The piecewise constant/linear solution for dynamic user equilibrium ⋮ Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems ⋮ Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint ⋮ Averaged mappings and the gradient-projection algorithm ⋮ A power penalty method for the general traffic assignment problem with elastic demand ⋮ Doubly uncertain transportation network: degradable capacity and stochastic demand ⋮ A new iterative method for generalized equilibrium and constrained convex minimization problems ⋮ Approximation of solutions to constrained convex minimization problem in Hilbert spaces ⋮ A projection algorithm for general variational inequalities with perturbed constraint sets ⋮ Iterative methods for constrained convex minimization problem in Hilbert spaces ⋮ Non-additive shortest path in the context of traffic assignment ⋮ Strong convergence of projection methods for a countable family of nonexpansive mappings and applications to constrained convex minimization problems ⋮ An extragradient method for solving split feasibility and fixed point problems ⋮ A modified descent method for co-coercive variational inequalities ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem ⋮ A new alternating direction method for co-coercive variational inequality problems ⋮ Unnamed Item ⋮ Some iterative methods for finding fixed points and for solving constrained convex minimization problems ⋮ An iterative algorithm for fixed point problem and convex minimization problem with applications ⋮ New iterative methods for equilibrium and constrained convex minimization problems ⋮ A modified projection method with a new direction for solving variational inequalities ⋮ Convergence analysis of alternating direction method of multipliers for a class of separable convex programming ⋮ Strong convergence results for convex minimization and monotone variational inclusion problems in Hilbert space ⋮ A relaxed projection method for finite-dimensional equilibrium problems ⋮ Unnamed Item ⋮ Dual Variable Inertial Accelerated Algorithm for Split System of Null Point Equality Problems ⋮ A general approximation method for a kind of convex optimization problems in Hilbert spaces ⋮ A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems ⋮ Iterative approximation of solution of split variational inclusion problem ⋮ A unified extragradient method for systems of hierarchical variational inequalities in a Hilbert space ⋮ Multi-step extragradient method with regularization for triple hierarchical variational inequalities with variational inclusion and split feasibility constraints

Cites Work

• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• Auxiliary problem principle extended to variational inequalities
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Error bounds in mathematical programming
• Equivalence of variational inequality problems to unconstrained minimization
• Reformulating the traffic equilibrium problem via a smooth gap function.
• New alternating direction method for a class of nonlinear variational inequality problems
• A modified projection method for monotone variational inequalities
• On the convergence of projection methods: Application to the decomposition of affine variational inequalities
• Network economics: a variational inequality approach
• Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
• A class of projection and contraction methods for monotone variational inequalities
• A globally convergent Newton method for solving strongly monotone variational inequalities
• Two-Metric Projection Methods for Constrained Optimization
• Projection methods for variational inequalities with application to the traffic assignment problem
• The Traffic Equilibrium Problem with Nonadditive Path Costs
• Engineering and Economic Applications of Complementarity Problems
• Co-Coercivity and Its Role in the Convergence of Iterative Schemes for Solving Variational Inequalities
• On the basic theorem of complementarity
• A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
• A modified alternating direction method for variational inequality problems.

This page was built for publication: Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities