Variable fixing algorithms for the continuous quadratic Knapsack problem
From MaRDI portal
Publication:927220
DOI10.1007/s10957-007-9317-7zbMath1145.90078OpenAlexW1984187882MaRDI QIDQ927220
Publication date: 4 June 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://rcin.org.pl/dlibra/docmetadata?showContent=true&id=139714
Convex programmingQuadratic programmingNonlinear programmingSeparable programmingSingly-constrained quadratic programs
Related Items
Fast projection onto the simplex and the \(l_1\) ball, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method, A penalty algorithm for solving convex separable knapsack problems, On a Reduction for a Class of Resource Allocation Problems, Solving nested-constraint resource allocation problems with an interior point method, A Newton's method for the continuous quadratic knapsack problem, Minimum variance allocation among constrained intervals, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Modular proximal optimization for multidimensional total-variation regularization, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem, Top-\(k\) multi-class SVM using multiple features, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- On linear-time algorithms for the continuous quadratic Knapsack problem
- On Floyd and Rivest's SELECT algorithm
- A Parallel Projection for the Multicommodity Network Model
- A lagrangean relaxation algorithm for the constrained matrix problem
- Quasi-Newton Updates with Bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Computational development of a lagrangian dual approach for quadratic networks
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- Technical Note—Allocation of Effort Resources among Competing Activities
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
- Validation of subgradient optimization
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
