A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem
DOI10.1016/j.amc.2014.01.033zbMath1410.90034OpenAlexW2053216996MaRDI QIDQ1644557
Lindu Zhao, Xiaoling Fu, Kai Huang, Yiping Jiang
Publication date: 21 June 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.01.033
self-adaptivedecomposableconvex time space network flowprojection-based prediction-correction algorithm
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Numerical methods for variational inequalities and related problems (65K15)
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A new alternating direction method for solving variational inequalities
- Optimal scheduling of emergency roadway repair and subsequent relief distribution
- Partitioning procedures for solving mixed-variables programming problems
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- A new inexact alternating directions method for monotone variational inequalities
- Self-adaptive projection-based prediction-correction method for constrained variational inequalities
- A time-space network based exact optimization model for multi-depot bus scheduling
- An improved general extra-gradient method with refined step size for nonlinear monotone variational inequalities
- The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
This page was built for publication: A decomposable self-adaptive projection-based prediction-correction algorithm for convex time space network flow problem
