A two-phase method for solving continuous rank-one quadratic knapsack problems
From MaRDI portal
Publication:5054022
DOI10.22067/ijnao.2022.70644.1096zbMath1499.90142arXiv2001.03766OpenAlexW2998930669MaRDI QIDQ5054022
Publication date: 29 November 2022
Full work available at URL: https://arxiv.org/abs/2001.03766
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- Algorithms for the solution of quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- On the continuous quadratic knapsack problem
- A survey on the continuous nonlinear resource allocation problem
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Convex quadratic programming with one constraint and bounded variables
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Augmented Lagrangians, box constrained QP and extensions
- A Two-Phase Gradient Method for Quadratic Programming Problems with a Single Linear Constraint and Bounds on the Variables
- A two-phase method for solving continuous rank-one quadratic knapsack problems
This page was built for publication: A two-phase method for solving continuous rank-one quadratic knapsack problems
