A penalty algorithm for solving convex separable knapsack problems
From MaRDI portal
Publication:2660092
DOI10.1016/j.amc.2019.124855zbMath1474.65167OpenAlexW2986871914MaRDI QIDQ2660092
Paulo Sérgio M. Santos, Robinson Hoto, Luiz Carlos Matioli
Publication date: 29 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.124855
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- An O(n) algorithm for quadratic knapsack problems
- A Newton's method for the continuous quadratic knapsack problem
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- The nonlinear knapsack problem - algorithms and applications
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A survey on the continuous nonlinear resource allocation problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- A generalized knapsack problem with variable coefficients
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem
This page was built for publication: A penalty algorithm for solving convex separable knapsack problems
