A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory

DOI10.1007/BF01586094zbMath0566.90074OpenAlexW1993822182MaRDI QIDQ3682254

No author found.

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586094

zbMATH Keywords

greedy algorithmpolymatroid theory

Mathematics Subject Classification ID

Convex programming (90C25) Methods of successive quadratic programming type (90C55) Polytopes and polyhedra (52Bxx)

Related Items (3)

Algorithms for separable convex optimization with linear ascending constraints ⋮ Lexicographically Optimal Base of a Submodular System with respect to a Weight Vector ⋮ On solving convex optimization problems with linear ascending constraints

Cites Work

• Unnamed Item
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• A Control Problem of Bellman
• Least d-Majorized Network Flows with Inventory and Statistical Applications

This page was built for publication: A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory