Pages that link to "Item:Q2355800"
From MaRDI portal
The following pages link to A library for continuous convex separable quadratic knapsack problems (Q2355800):
Displaying 13 items.
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← 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)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Strengthening the sequential convex MINLP technique by perspective reformulations (Q2311102) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- Fast algorithm for the quadratic knapsack problem (Q2674729) (← links)
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines (Q3004989) (← links)
- (Q3134089) (← links)
- YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming (Q6104218) (← links)
- On the paper ``Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem'' (Q6555200) (← links)
