An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
From MaRDI portal
Publication:5270754
DOI10.1145/2828635zbMath1369.65072OpenAlexW2373537127WikidataQ113310220 ScholiaQ113310220MaRDI QIDQ5270754
James T. Hungerford, William W. Hager, Timothy A. Davis
Publication date: 30 June 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2828635
quadratic programmingconvex programmingnonlinear programmingseparable programmingheapcontinuous quadratic knapsack
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items (8)
A penalty algorithm for solving convex separable knapsack problems ⋮ A Newton's method for the continuous quadratic knapsack problem ⋮ Minimum variance allocation among constrained intervals ⋮ A multilevel bilinear programming algorithm for the vertex separator problem ⋮ Projection onto a Polyhedron that Exploits Sparsity ⋮ NAPHEAP ⋮ Variable fixing method by weighted average for the continuous quadratic knapsack problem ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multilevel bilinear programming algorithm for the vertex separator problem
- An O(n) algorithm for quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Linear and nonlinear programming.
- 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\)
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Optimality conditions for maximizing a function over a polyhedron
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Continuous quadratic programming formulations of optimization problems on graphs
- A New Active Set Algorithm for Box Constrained Optimization
- A Parallel Projection for the Multicommodity Network Model
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- 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
- Generalized Gradients and Applications
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Graph Partitioning and Continuous Quadratic Programming
- A Projection Method for the Integer Quadratic Knapsack Problem
- Convex Analysis
This page was built for publication: An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
