Optimization Letters

, Volume 9, Issue 5, pp 819–838 | Cite as

On solving convex optimization problems with linear ascending constraints

Original Paper


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 method which terminates in a finite number of iterations. In particular, the worst case complexity of our dual method improves over the best-known result for this problem in Padakandla and Sundaresan (SIAM J Optim 20(3):1185–1204, 2009). We then propose a gradient projection method to solve a more general class of problems in which the objective function is not necessarily separable. Numerical experiments show that both our algorithms work well in test problems.


Convex optimization Linear ascending constraints Dual method Nonlinear optimization 


  1. 1.
    Bassok, Y., Anupindi, R., Akella, R.: Single-period multiproduct inventory models with substitution. Oper. Res. 47(4), 632–642 (1999)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Bellman, R., Dreyfus, S.: Applied Dynamic Programming. Princeton University Press, Princeton (1962)Google Scholar
  3. 3.
    Bertsekas, D.: Nonlinear Programming. Athena Scientific, Belmont (2003)Google Scholar
  4. 4.
    D’Amico, A., Sanguinetti, L., Palomar, D.: Convex separable problems with linear and box constraints. In: ICASSP’14: IEEE International Conference on Acoustics, Speech and Signal Processing (2014)Google Scholar
  5. 5.
    D’Amico, A., Sanguinetti, L., Palomar, D.: Convex separable problems with linear and box constraints in signal processing and communications. http://arxiv.org/abs/1407.4477. Working paper (2014)
  6. 6.
    Dantzig, G.: A control problem of Bellman. Manag. Sci. 17(9), 542–546 (1971)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming (web page and software). http://stanford.edu/~boyd/cvx (2008)
  8. 8.
    Hochbaum, D.: Lower and upper bounds for the allocation problem and other nonlinear optimization problems. Math. Oper. Res. 19(2), 390–409 (1994)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Hsu, A., Bassok, Y.: Random yield and random demand in a production system with downward substitution. Oper. Res. 47(2), 277–290 (1999)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Moriguchi, S., Shioura, A.: On Hochbaum’s proximity-scaling algorithm for the general resource allocation problem. Math. Oper. Res. 29(2), 394–397 (2004)CrossRefMATHMathSciNetGoogle Scholar
  11. 11.
    Morton, G., von Randow, R., Ringwald, K.: A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory. Math. Progr. 32(2), 238–241 (1985)CrossRefMATHGoogle Scholar
  12. 12.
    Padakandla, A., Sundaresan, R.: Power minimization for CDMA under colored noise. IEEE Trans. Commun. 57(10), 3103–3112 (2009)CrossRefGoogle Scholar
  13. 13.
    Padakandla, A., Sundaresan, R.: Separable convex optimization problems with linear ascending constraints. SIAM J. Optim. 20(3), 1185–1204 (2009)CrossRefMATHMathSciNetGoogle Scholar
  14. 14.
    Patriksson, M.: A survey on the continuous nonlinear resource allocation problem. Eur. J. Oper. Res. 185(1), 1–46 (2008)CrossRefMATHMathSciNetGoogle Scholar
  15. 15.
    Rao, U., Swaminathan, J., Zhang, J.: Multi-product inventory planning with downward substitution, stochastic demand and setup costs. IIE Trans. 36, 59–71 (2004)CrossRefGoogle Scholar
  16. 16.
    Shapiro, A., Dentcheva, D., Ruszczyski, A.: Lectures on Stochastic Programming: Modeling and Theory. SIAM, Philledaphia (2009)CrossRefGoogle Scholar
  17. 17.
    Veinott, A.: Least \(d\)-majorized network flows with inventory and statistical applications. Manag. Sci. 17(9), 547–567 (1971)CrossRefMATHMathSciNetGoogle Scholar
  18. 18.
    Viswanath, P., Anantharam, V.: Optimal sequences for CDMA with colored noise: a Schur-Saddle function property. IEEE Trans. Inf. Theory 48(6), 1295–1318 (2002)CrossRefMATHMathSciNetGoogle Scholar
  19. 19.
    Wagner, H., Whitin, T.: Dynamic version of the economic lot size model. Manag. Sci. 5(1), 89–96 (1958)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Department of Industrial and Systems EngineeringUniversity of MinnesotaMinneapolisUSA

Personalised recommendations