Projection methods for variational inequalities with application to the traffic assignment problem
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Self-adaptive implicit methods for monotone variant variational inequalities
- The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems
- Convex programming, variational inequalities, and applications to the traffic equilibrium problem
- Parallel optimization for traffic assignment
- Decomposition algorithm for convex differentiable minimization
- On a global error bound for a class of monotone affine variational inequality problems
- Postoptimizing equilibrium flows on large scale networks
- Homotopy method for solving variational inequalities
- A simplicial decomposition method for the transit equilibrium assignment problem
- A penalty function approach for solving bi-level linear programs
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Some aspects of variational inequalities
- A general descent framework for the monotone variational inequality problem
- A unified description of iterative algorithms for traffic equilibria
- On the convergence rate of two projection methods for variational inequalities in \(\mathbb{R}^ n\)
- A nonsmooth Newton method for variational inequalities. II: Numerical results
- Error bounds in mathematical programming
- A survey of some mathematical programming models in transportation
- A simplicial decomposition algorithm for solving the variational inequality formulation of the general traffic assignment problem for large scale network
- Modified primal path-following scheme for the monotone variational inequality problem
- A bilevel bottleneck programming problem
- A proximal decomposition algorithm for variational inequality problems.
- A hybrid method for solving variational inequality problems
- New alternating direction method for a class of nonlinear variational inequality problems
- Two new self-adaptive projection methods for variational inequality problems
- A strong convergence result involving an inertial forward-backward algorithm for monotone inclusions
- A partially parallel prediction-correction splitting method for convex optimization problems with separable structure
- Prediction-correction method with BB step sizes
- A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
- A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems
- Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
- Solving non-additive traffic assignment problems: a descent method for co-coercive variational inequalities
- Some equilibrium problems under uncertainty and random variational inequalities
- Some modified extragradient methods for solving split feasibility and fixed point problems
- Linear convergence analysis of the use of gradient projection methods on total variation problems
- Weak convergence theorem for finding fixed points and solution of split feasibility and systems of equilibrium problems
- An iterative algorithm for fixed point problem and convex minimization problem with applications
- A golden ratio primal-dual algorithm for structured convex optimization
- A projected extrapolated gradient method with larger step size for monotone variational inequalities
- An intermixed iteration for constrained convex minimization problem and split feasibility problem
- Weak convergence of explicit extragradient algorithms for solving equilibrium problems
- Hybrid methods for network equilibrium problems
- GRPDA revisited: relaxed condition and connection to Chambolle-Pock's primal-dual algorithm
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- Iterative methods for constrained convex minimization problem in Hilbert spaces
- Strong convergence of projection methods for a countable family of nonexpansive mappings and applications to constrained convex minimization problems
- A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- The variational inequality problem in Hilbert spaces endowed with graphs
- A modified \textit{Physarum}-inspired model for the user equilibrium traffic assignment problem
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- A general approximation method for a kind of convex optimization problems in Hilbert spaces
- Incremental constraint projection methods for variational inequalities
- A globally convergent Newton method for solving strongly monotone variational inequalities
- The multiobjective equilibrium network design problem revisited: A simulated annealing approach
- Weighting method for bi-level linear fractional programming problems
- Preconditioning methods for solving a general split feasibility problem
- Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint
- A modified alternating projection based prediction-correction method for structured variational inequalities
- A survey on the continuous nonlinear resource allocation problem
- A path-based double projection method for solving the asymmetric traffic network equilibrium problem
- An algorithm to solve linear fractional bilevel programming problem via goal programming.
- Random equilibrium problems on networks
- The application of an oblique-projected Landweber method to a model of supervised learning
- A network efficiency measure with application to critical infrastructure networks
- A simple self-adaptive alternating direction method for linear variational inequality problems
- A new Kohn-Vogelius type formulation for inverse source problems
- A unified extragradient method for systems of hierarchical variational inequalities in a Hilbert space
- A new convergence theorem of a projection algorithm with variable steps for variational inequalities
- Regularized gradient-projection methods for equilibrium and constrained convex minimization problems
- Regularization of stochastic variational inequalities and a comparison of an \(L_p\) and a sample-path approach
- Disequilibrium and variational inequalities
- 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
- Approximate policy iteration: a survey and some new methods
- An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
- The stochastic multicommodity flow problem
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- Sensitivity analysis for the asymmetric network equilibrium problem
- Linearized simplicial decomposition methods for computing traffic equilibria on networks
- A convergence analysis result for constrained convex minimization problem
- TOPSIS for bi-level MODM problems
- 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
- On the O(1/t) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities
- A relaxed projection method for variational inequalities
- Network design problem with congestion effects: A case of bilevel programming
- Projected gradient methods for linearly constrained problems
- A new parallel splitting descent method for structured variational inequalities
- A parallel splitting method for separable convex programs
- Iterative algorithms based on the viscosity approximation method for equilibrium and constrained convex minimization problem
- Iterative approximation of solutions for constrained convex minimization problem
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- A new decomposition method for variational inequalities with linear constraints
- An improved two-step method for solving generalized Nash equilibrium problems
- On the regularity of retarded equilibria in time-dependent traffic equilibrium problems
- Strong convergence of projected reflected gradient methods for variational inequalities
This page was built for publication: Projection methods for variational inequalities with application to the traffic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936522)
