On solving convex optimization problems with linear ascending constraints

DOI10.1007/s11590-014-0806-yzbMath1328.90108arXiv1212.4701OpenAlexW2050465339MaRDI QIDQ2355310

Zizhuo Wang

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

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

zbMATH Keywords

convex optimizationnonlinear optimizationdual methodlinear ascending constraints

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

A Decomposition Algorithm for Nested Resource Allocation Problems

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on the continuous nonlinear resource allocation problem
• Dynamic Version of the Economic Lot Size Model
• Random Yield and Random Demand in a Production System with Downward Substitution
• Single-Period Multiproduct Inventory Models with Substitution
• Separable Convex Optimization Problems with Linear Ascending Constraints
• Lectures on Stochastic Programming
• A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory
• Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
• Convex Separable Problems With Linear Constraints in Signal Processing and Communications
• Optimal sequences for CDMA under colored noise: a Schur-saddle function property
• A Control Problem of Bellman
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• On Hochbaum's Proximity-Scaling Algorithm for the General Resource Allocation Problem