On linear-time algorithms for the continuous quadratic Knapsack problem
From MaRDI portal
Publication:2471117
DOI10.1007/s10957-007-9259-0zbMath1145.90077OpenAlexW2005339470MaRDI QIDQ2471117
Publication date: 18 February 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=139609
Convex programmingQuadratic programmingNonlinear programmingSeparable programmingSingly-constrained quadratic program
Related Items
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, Approximation accuracy, gradient methods, and error bound for structured convex optimization, A Newton's method for the continuous quadratic knapsack problem, The descent algorithm for solving the symmetric eigenvalue complementarity problem, Minimum variance allocation among constrained intervals, Fast projections onto mixed-norm balls with applications, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, Variable fixing algorithms for the continuous quadratic Knapsack problem, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, Variable fixing method by weighted average for the continuous quadratic knapsack problem, On the convergence of inexact block coordinate descent methods for constrained optimization
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Linear probing and graphs
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- On Floyd and Rivest's SELECT algorithm
- Quasi-Newton Updates with Bounds
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
