Pages that link to "Item:Q1628287"
From MaRDI portal
The following pages link to Algorithms for separable convex optimization with linear ascending constraints (Q1628287):
Displaying 4 items.
- On solving convex optimization problems with linear ascending constraints (Q2355310) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- A polynomial-time descent method for separable convex optimization problems with linear constraints (Q2802141) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)