Abstract
Efficient methods for convex resource allocation problems usually exploit algebraic properties of the objective function. For problems with nested constraints, we show that constraint sparsity structure alone allows rapid solution with a general interior point method. The key is a special-purpose linear system solver requiring only linear time in the problem dimensions. Computational tests show that this approach outperforms the previous best algebraically specialized methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have