A primal-dual algorithm for monotropic programming and its application to network optimization

DOI10.1023/A:1008782926733zbMath0947.90089OpenAlexW431765274MaRDI QIDQ1567479

Adam Ouorou

Publication date: 29 October 2000

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008782926733

zbMATH Keywords

decompositionconvex programmingnetwork flowsaugmented Lagrangian

Mathematics Subject Classification ID

Convex programming (90C25) Special types of economic equilibria (91B52) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (5)

Decomposition Methods Based on Augmented Lagrangians: A Survey ⋮ On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. ⋮ Unnamed Item ⋮ A re-scaled twin augmented Lagrangian algorithm for saddle point seeking ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems

This page was built for publication: A primal-dual algorithm for monotropic programming and its application to network optimization