Timing problems involve the choice of task execution dates within a predetermined
processing sequence, and under various additional constraints or objectives such as time …

In this paper, we focus on separable convex optimization problems with box constraints and
a specific set of linear constraints. The solution is given in closed-form as a function of some …

We study a convex resource allocation problem in which lower and upper bounds are
imposed on partial sums of allocations. This model is linked to a large range of applications …

We propose an exact polynomial algorithm for a resource allocation problem with convex
costs and constraints on partial sums of resource consumptions, in the presence of either …

Separable convex optimization problems with linear ascending inequality and equality
constraints are addressed in this paper. An algorithm that explicitly characterizes the …

In this paper, we propose two algorithms for solving convex optimization problems with
linear ascending constraints. When the objective function is separable, we propose a dual …

The paper considers the minimization of a separable convex function subject to linear
ascending constraints. The problem arises as the core optimization in several resource …

We revisit a problem studied by Padakandla and Sundaresan [SIAM J. Optim., August 2009]
on the minimization of a separable convex function subject to linear ascending constraints …

Distributed and iterative network utility maximization algorithms, such as the primal–dual
algorithms or the network-user decomposition algorithms, often involve trajectories where …

In this work, we focus on separable convex optimization problems with linear and box
constraints and compute the solution in closed-form as a function of some Lagrange …