Abstract
The aim of this paper is to propose an algorithm, based on the optimal level solutions method, which solves a particular class of box constrained quadratic problems. The objective function is given by the sum of a quadratic strictly convex separable function and the square of an affine function multiplied by a real parameter. The convexity and the nonconvexity of the problem can be characterized by means of the value of the real parameter. Within the algorithm, some global optimality conditions are used as stopping criteria, even in the case of a nonconvex objective function. The results of a deep computational test of the algorithm are also provided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Best MJ, Chakravarti N (1992) An O(n 2) active set method for solving a certain parametric quadratic program. J Optim Theory Appl 7:213–224
Brucker P (1984) An O(n) algorithm for quadratic knapsack problems. Oper Res Lett 3:163–166
Cambini R, Sodini C (2002) A finite algorithm for a particular d.c. quadratic programming problem. Ann Oper Res 117:33–49. ISSN 0254-5330
Cambini R, Sodini C (2003) A finite algorithm for a class of nonlinear multiplicative programs. J Global Optim 26(3):279–296. ISSN 0925-5001
Ellero A (1996) The optimal level solutions method. J Inf Optim Sci 17(2):355–372
Gómez MA (1999) An O(n 2) active set algorithm for the solution of a parametric quadratic program. Numer Algorithms 22:305–316
Gómez MA (2001) An O(n 2) active set algorithm for solving two related box constrained parametric quadratic program. Numer Algorithms 27:367–375
Robinson AG, Jiang N, Lerme CS (1992) On the continuous quadratic knapsack problem. Math Program 55:99–108
Yitzakhi S (1982) A tax programming model. J Public Econ 19:107–120
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper has been partially supported by M.I.U.R.
Rights and permissions
About this article
Cite this article
Cambini, R., Sodini, C. A sequential method for a class of box constrained quadratic programming problems. Math Meth Oper Res 67, 223–243 (2008). https://doi.org/10.1007/s00186-007-0173-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-007-0173-x