Relaxation methods for network flow problems with convex arc costs

Authors:
Dimitri P. Bertsekas;Partick A. Hossein;Paul Tseng
Affiliations:
Massachusettes Institute of Technology, Cambridge;Massachusettes Institute of Technology, Cambridge;Massachusettes Institute of Technology, Cambridge
Venue:
SIAM Journal on Control and Optimization
Year:
1987

Citing 0
Cited 5

The connection machines CM-1 and CM-2: solving nonlinear network problems

ICS '88 Proceedings of the 2nd international conference on Supercomputing
A Partitioned ε-Relaxation Algorithm for Separable Convex

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
A Primal-Dual Algorithm for MonotropicProgramming and its Application to NetworkOptimization

Computational Optimization and Applications
Parallel Algorithms for Solving the Convex Minimum Cost Flow Problem

Computational Optimization and Applications
A proximal subgradient projection algorithm for linearly constrained strictly convex problems

Optimization Methods & Software

Quantified Score

Hi-index	0.00

Visualization

Abstract