Pages that link to "Item:Q2465658"
From MaRDI portal
The following pages link to Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658):
Displaying 33 items.
- An efficient global algorithm for a class of indefinite separable quadratic programs (Q304230) (← links)
- 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)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
- The newsvendor problem with capacitated suppliers and quantity discounts (Q724067) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method (Q1667260) (← links)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← 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)
- Efficient projection algorithms onto the weighted \(\ell_1\) ball (Q2124458) (← links)
- Solving nested-constraint resource allocation problems with an interior point method (Q2183209) (← links)
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball (Q2191778) (← links)
- Minimum variance allocation among constrained intervals (Q2423792) (← links)
- On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- Fast algorithm for the quadratic knapsack problem (Q2674729) (← links)
- Variational Gram Functions: Convex Analysis and Optimization (Q4602347) (← links)
- Projections onto the canonical simplex with additional linear inequalities (Q5038426) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Neural blind deconvolution with Poisson data (Q5886388) (← links)
- Nonlinear optimization and support vector machines (Q5915690) (← links)
- Nonlinear optimization and support vector machines (Q5918754) (← links)
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
- An optimization based limiter for enforcing positivity in a semi-implicit discontinuous Galerkin scheme for compressible Navier-Stokes equations (Q6639345) (← links)
- A stochastic moving ball approximation method for smooth convex constrained minimization (Q6642788) (← links)
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation (Q6668156) (← links)
