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...
Main Authors: | Atécio Alves, Jônatas O. L. Silva, Luiz C. Matioli, Paulo S. M. Santos, Sissy S. Souza |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2024-01-01
|
Series: | Journal of Control Science and Engineering |
Online Access: | http://dx.doi.org/10.1155/2024/7602027 |
Similar Items
-
0-1 Knapsack in Nearly Quadratic Time
by: Jin, Ce
Published: (2024) -
An infeasible interior point methods for convex quadratic problems
by: Hayet Roumili, et al.
Published: (2018-12-01) -
Regularized Jacobi iteration for decentralized convex quadratic optimization with separable constraints
by: Deori, L, et al.
Published: (2018) -
A New Accelerated Algorithm Based on Fixed Point Method for Convex Bilevel Optimization Problems with Applications
by: Piti Thongsri, et al.
Published: (2023-01-01) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01)