Separable Convex Optimization Problems with Linear Ascending Constraints

DOI10.1137/07069729XzbMath1198.90319arXiv0707.2265OpenAlexW3102486820MaRDI QIDQ3586131

Rajesh Sundaresan, Arun Padakandla

Publication date: 6 September 2010

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0707.2265

zbMATH Keywords

linear constraints

Mathematics Subject Classification ID

Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41)

Related Items (5)

Algorithms for separable convex optimization with linear ascending constraints ⋮ Solving nested-constraint resource allocation problems with an interior point method ⋮ Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ On solving convex optimization problems with linear ascending constraints

This page was built for publication: Separable Convex Optimization Problems with Linear Ascending Constraints