论文信息 - An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds

An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds

This paper gives an O(n) algorithm for a singly constrained convex quadratic program using binary search to solve the Kuhn-Tucker system. Computational results indicate that a randomized version of this algorithm runs in expected linear time and is suitable for practical applications. For the nonconvex case anε-approximate algorithm is proposed which is based on convex and piecewise linear approximations of the objective function.

Panos M. Pardalos | N. Kovoor | P. Pardalos | N. Kovoor

[1] Norman J. Driebeek. An Algorithm for the Solution of Mixed Integer Programming Problems , 1966 .

[2] A. M. Geoffrion,et al. Integer Programming Algorithms: A Framework and State-of-the-Art Survey , 1972 .

[3] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[4] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..

[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[6] Jeffery L. Kennington,et al. A polynomially bounded algorithm for a singly constrained quadratic program , 1980, Math. Program..

[7] P. Brucker. Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .

[8] Pasumarti V. Kamesam,et al. Multipoint methods for separable nonlinear networks , 1984 .

[9] Linus Schrage,et al. Linear, Integer, and Quadratic Programming with Lindo , 1984 .

[10] Panos M. Pardalos,et al. Global minimization of large-scale constrained concave quadratic problems by separable programming , 1986, Math. Program..

[11] J. B. Rosen,et al. Methods for global concave minimization: A bibliographic survey , 1986 .

[12] Panos M. Pardalos,et al. Constrained Global Optimization: Algorithms and Applications , 1987, Lecture Notes in Computer Science.

[13] J. J. Moré,et al. Quasi-Newton updates with bounds , 1987 .