Pages that link to "Item:Q927220"
From MaRDI portal
The following pages link to Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220):
Displaying 16 items.
- Fast projection onto the simplex and the \(l_1\) ball (Q304269) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
- Top-\(k\) multi-class SVM using multiple features (Q781933) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method (Q1667260) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem (Q2077958) (← links)
- Solving nested-constraint resource allocation problems with an interior point method (Q2183209) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- Modular proximal optimization for multidimensional total-variation regularization (Q4614088) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)
