Breakpoint searching algorithms for the continuous quadratic knapsack problem
From MaRDI portal
Publication:2465658
Recommendations
Cites work
- A O(n) algorithm for projecting a vector on the intersection of a hyperplane and R^n_+
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A lagrangean relaxation algorithm for the constrained matrix problem
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- A Parallel Projection for the Multicommodity Network Model
- A polynomially bounded algorithm for a singly constrained quadratic program
- A Projection Method for the Integer Quadratic Knapsack Problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithms for the least distance problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An O(n) algorithm for quadratic knapsack problems
- Computational development of a lagrangian dual approach for quadratic networks
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Introduction to algorithms
- Linear time algorithms for some separable quadratic programming problems
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- On Floyd and Rivest's SELECT algorithm
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- Quasi-Newton Updates with Bounds
- Simple Ranking Methods for Allocation of One Resource
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Technical Note—Allocation of Effort Resources among Competing Activities
- Validation of subgradient optimization
- Variable fixing algorithms for the continuous quadratic Knapsack problem
Cited in
(35)- On the continuous quadratic knapsack problem
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Efficient projection algorithms onto the weighted \(\ell_1\) ball
- Solving nested-constraint resource allocation problems with an interior point method
- A filtered bucket-clustering method for projection onto the simplex and the \(\ell_1\) ball
- Minimum variance allocation among constrained intervals
- On linear-time algorithms for the continuous quadratic Knapsack problem
- A penalty algorithm for solving convex separable knapsack problems
- A fast algorithm for quadratic resource allocation problems with nested constraints
- Fast algorithm for the quadratic knapsack problem
- An efficient global algorithm for a class of indefinite separable quadratic programs
- Fast projection onto the simplex and the l₁ ball
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Variational Gram functions: convex analysis and optimization
- Projections onto the canonical simplex with additional linear inequalities
- On a Reduction for a Class of Resource Allocation Problems
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- Neural blind deconvolution with Poisson data
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- An optimization based limiter for enforcing positivity in a semi-implicit discontinuous Galerkin scheme for compressible Navier-Stokes equations
- A stochastic moving ball approximation method for smooth convex constrained minimization
- A distributed primal-dual hybrid gradient algorithm for fair resource allocation
- A smoothing method for solving quadratic convex separable knapsack problems
- A breakpoint search approach for convex resource allocation problems with bounded variables
- CV@R-penalised portfolio optimisation with biased stochastic mirror descent
- The newsvendor problem with capacitated suppliers and quantity discounts
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
This page was built for publication: Breakpoint searching algorithms for the continuous quadratic knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465658)
