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

DOI10.1287/moor.26.2.221.10557zbMath1082.90558OpenAlexW2103725866MaRDI QIDQ5704035

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)

Related Items (3)

Some convex programs without a duality gap ⋮ Benefit sharing in holding situations ⋮ Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization

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