Pages that link to "Item:Q2491532"

The following pages link to An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532):

Displaying 3 items.

• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
• Well-posedness and primal-dual analysis of some convex separable optimization problems (Q1953228) (← links)
• Optimisation-Based Overload Control (Q3614978) (← links)