On the solution of quadratic programming problems
*Stefan M. StefanovCorresponding authorstefm@swu.bgDepartment of Mathematics2700 BlagoevgradSouth-West University “Neofit Rilski”BulgariaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 05 May 2022
- Published Online:
- 01 Mar 2023
- Article type:
- A
- Language:
- EN
- Article no.:
- JIOS-1266
- Pages:
- 243–253
Abstract
Keywords
Subject Classifications
References
[1] M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, 3-rd ed., John Wiley & Sons, New York, 2006.
[2] P. Brucker, “An ()On algorithm for quadratic knapsack problems”, Operations Research Letters, Vol. 3(3), 1984, pp. 163-166.
[3] J.-P. Dussault, J. A. Ferland, and B. Lemaire, “Convex quadratic programming with one constraint and bounded variables”, Mathematical Programming, Vol. 36(1), 1986, pp. 90-104.
[4] R. Fletcher, Practical Methods of Optimization, 2-nd ed., John Wiley & Sons, Chichester-New York-Brisbane-Toronto-Singapore, 2003.
[5] R. Helgason, J. Kennington, and H. Lall, “A polynomially bounded algorithm for a singly constrained quadratic program”, Mathematical Programming, Vol. 18(3), 1980, pp. 338-343.
[6] A. Kozma, C. Conte, and M. Diehl, “Benchmarking large-scale distributed convex quadratic programming algorithms”, Optimization Methods and Software, Vol. 30, 2015, pp. 191-214.
[7] J. J. Moré and G. Toraldo, “Algorithms for bound constrained quadratic programming problems”, Numerische Mathematik, Vol. 55(4), 1989, pp. 377-400.
[8] P. M. Pardalos and N. Kovoor, “An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds”, Mathematical Programming, Vol. 46(3), 1990, pp. 321-328.
[9] P. M. Pardalos, Y. Ye, and C.-G. Han, “Algorithms for the solution of quadratic knapsack problems”, Linear Algebra and Its Applications, Vol. 152, 1991, pp. 69-91.
[10] A. G. Robinson, N. Jiang, and C. S. Lerme, “On the continuous quadratic knapsack problem”, Mathematical Programming, Vol. 55(1), 1992, pp. 99-108.
[11] S. M. Stefanov, “On the implementation of stochastic quasigradient methods to some facility location problems”, Yugoslav Journal of Operations Research, Vol. 10(2), 2000, pp. 235-256.
[12] S. M. Stefanov, “Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in n“, Journal of Applied Mathematics, Vol. 2004(5), 2004, pp. 409-431.
[13] S. M. Stefanov, “On the solution of quadratic programming problem with a feasible region defined as a Minkowski sum of a compact set and finitely generated convex closed cone”, Journal of Information and Optimization Sciences, Vol. 39(6), 2018, pp. 1223-1230.
[14] S. M. Stefanov, “On the Cauchy-Schwarz inequality approach for solving a quadratic optimization problem”, Journal of Information and Optimization Sciences, Vol. 40(4), 2019, pp. 973-981.
[15] S. M. Stefanov, Separable Optimization: Theory and Methods, Springer, New York, Springer Optimization and Its Applications, Vol. 177, 2021.
[16] H. A. Taha, Operations Research: An Introduction, 10-th ed., Pearson/Prentice Hall, London, 2017.
[17] D. G. Tian, “An exterior point polynomial-time algorithm for convex quadratic programming”, Computational Optimization and Applications, Vol. 61, 2015, pp. 51-78.
[18] Yu. P. Zaichenko, Operations Research, Slovo, Kiev, 2003 (in Russian).
