An Accelerated Fixed-Point Algorithm Applied to Quadratic Convex Separable Knapsack Problems

In this article, we propose a root-finding algorithm for solving a quadratic convex separable knapsack problem, which is more straightforward than existing methods and competitive in practice. Besides, we also present an extension of the proposal, which improves its computational time, and then we i...

Full description

Saved in:
Bibliographic Details
Published inJournal of control science and engineering Vol. 2024; pp. 1 - 17
Main Authors Alves, Atécio, Silva, Jônatas O. L., Matioli, Luiz C., Santos, Paulo S. M., Souza, Sissy S.
Format Journal Article
LanguageEnglish
Published New York Hindawi 08.02.2024
John Wiley & Sons, Inc
Wiley
Subjects
Algorithms
Computing time
Knapsack problem
Lagrange multiplier
Methods
Optimization
Online AccessGet full text

Cover

More Information
Summary:In this article, we propose a root-finding algorithm for solving a quadratic convex separable knapsack problem, which is more straightforward than existing methods and competitive in practice. Besides, we also present an extension of the proposal, which improves its computational time, and then we incorporate the accelerated Anderson’s and Aitken’s fixed-point algorithms to obtain better results. The algorithm only performs function evaluations. We present partial convergence results of the algorithm. Moreover, we illustrate superior computational results in medium and large problems as well as the applicability of the algorithm with real-life applications to show their efficiency.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-5249
1687-5257
DOI:10.1155/2024/7602027