A penalty algorithm for solving convex separable knapsack problems

DOI10.1016/J.AMC.2019.124855MaRDI QIDQ2660092zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Bregman distancesexterior projectionsgradient methodseparable knapsack problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• An optimization algorithm for a penalized knapsack problem
• New exact approaches and approximation results for the penalized knapsack problem
• A unified method for a class of convex separable nonlinear knapsack problems
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties
• A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
• On the solution of concave knapsack problems
• An efficient hybrid algorithm for the separable convex quadratic knapsack problem
• A library for continuous convex separable quadratic knapsack problems

Cites work

• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A generalized knapsack problem with variable coefficients
• A Newton's method for the continuous quadratic knapsack problem
• A survey on the continuous nonlinear resource allocation problem
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
• An efficient hybrid algorithm for the separable convex quadratic knapsack problem
• An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
• An O(n) algorithm for quadratic knapsack problems
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• On linear-time algorithms for the continuous quadratic Knapsack problem
• On the continuous quadratic knapsack problem
• Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
• Quadratic resource allocation with generalized upper bounds
• Solving the continuous nonlinear resource allocation problem with an interior point method
• The nonlinear knapsack problem - algorithms and applications
• Variable fixing algorithms for the continuous quadratic Knapsack problem

Cited in

(3)

• A cooperative bargaining framework for decentralized portfolio optimization
• Guaranteed accuracy estimation for the knapsack problem with convex monotone separable functions
• A unified method for a class of convex separable nonlinear knapsack problems

Describes a project that uses

Uses Software

• NAPHEAP

This page was built for publication: A penalty algorithm for solving convex separable knapsack problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660092)