An ϵ-Out-of-Kilter Method for Monotropic Programming

DOI10.1287/MOOR.26.2.221.10557MaRDI QIDQ5704035zbMATH OpenOpenAlexFDO

Authors Paul Tseng

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.26.2.221.10557

zbMATH Keywords

Monotropic programming, out-of-kilter method

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• The out‐of‐kilter algorithm for solving network problems
• Relaxation methods for monotropic programs
• An out-of-kilter method for submodular flows
• An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
• A scaling out-of-kilter algorithm for minimum cost flow

Cited in

(4)

• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
• The out‐of‐kilter algorithm for solving network problems
• Benefit sharing in holding situations
• Some convex programs without a duality gap

This page was built for publication: An ϵ-Out-of-Kilter Method for Monotropic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704035)