A smoothing method for solving quadratic convex separable knapsack problems

DOI10.1080/10556788.2025.2611436MaRDI QIDQ6847401zbMATH OpenFDO

Authors Paulo Sérgio M. Santos, S. S. Souza

Publication date 9 March 2026

Published in Optimization Methods \& Software (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Cites work

• A Newton's method for the continuous quadratic knapsack problem
• Anderson Acceleration for Nonsmooth Fixed Point Problems
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• Computational development of a lagrangian dual approach for quadratic networks
• Constrained multi-item inventory systems: An implicit approach
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Nonlinear integer programming for optimal allocation in stratified sampling
• Numerical solution of optimal allocation problems in stratified sampling under box constraints
• On High-order Model Regularization for Constrained Optimization
• On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
• Quadratic resource allocation with generalized upper bounds
• Quasi-Newton Updates with Bounds
• Smooth Approximations to Nonlinear Complementarity Problems
• The nonlinear knapsack problem - algorithms and applications
• Tradeoff Curves, Targeting and Balancing in Manufacturing Queueing Networks
• Validation of subgradient optimization
• Variable fixing algorithms for the continuous quadratic Knapsack problem

This page was built for publication: A smoothing method for solving quadratic convex separable knapsack problems

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