A Newton's method for the continuous quadratic knapsack problem

Mathematical Programming Computation

Volumn 6, Issue 2, 2014, Pages 151-169

  Cominetti, Roberto ^a   Mascarenhas, Walter F ^b   Silva, Paulo J S ^c  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

Continuous quadratic knapsack; Duality; Semismooth Newton; Simplex projections

Indexed keywords

COMBINATORIAL OPTIMIZATION; NEWTON-RAPHSON METHOD; QUADRATIC PROGRAMMING;

ARITHMETIC COMPLEXITY; DUALITY; NUMERICAL EXPERIMENTS; QUADRATIC KNAPSACK PROBLEMS; QUADRATIC KNAPSACKS; SEMISMOOTH; SIMPLEX PROJECTIONS; STATE-OF-THE-ART ALGORITHMS;

NUMERICAL METHODS;

EID: 84904995697     PISSN: 18672949     EISSN: 18672957     Source Type: Journal    
DOI: 10.1007/s12532-014-0066-y     Document Type: Article

References (29)

1. Birgin,E.G., Martínez, J.M.,Raydan, M.:Nonmonotone spectral projected gradientmethods for convex sets. SIAM J. Optim. 10(4), 1196-1211 (2000)
2. Birgin, E.G., Martínez, J.M., Raydan, M.: Algorithm 813: SPG-software for convex-constrained optimization. ACM Trans. Math. Softw. 27(3), 340-349 (2001)
3. Bitran, G.R., Hax, A.C.: Disaggregation and resource allocation using convex knapsack problems with bounded variables. Manag. Sci. 27(4), 431-441 (1981)
4. Bretthauer, K., Shetty, B.: Quadratic resource allocation with generalized upper bounds. Oper. Res. Lett. 20(2), 51-57 (1997)
5. Bretthauer, K.M., Shetty, B., Syam, S.: A branch-and bound-algorithm for integer quadratic knapsack problems. ORSA J. Comput. 7, 109-116 (1995)
6. Brucker, P.:An O(n) algorithm for quadratic knapsack problems. Oper.Res. Lett. 3(3), 163-166 (1984)
7. Burges,C.J.C.:Atutorial on support vectormachines for pattern recognition. Data Min. Knowl. Discov. 2, 121-167 (1998)
8. Calamai, P.H., Moré, J.J.: Quasi-Newton updates with bounds. SIAM J. Numer. Anal. 24(6), 1434-1441 (1987)
9. Cosares, S., Hochbaum, D.S.: Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Math. Oper. Res. 19(1), 94-111 (1994)
10. Dai, Y.H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403-421 (2006)
11. Davis, T.A., Hager,W.W., Hungerford, J.T.: The separable convex quadratic knapsack problem.Working paper (2013)
12. Ferris, M.C., Munson, T.S.: Semismooth support vector machines. Math. Program. 101, 185-204 (2004)
13. Gonzalez-Lima,M.D., Hager,W.W., Zhang, H.: An affine-scaling interior-point method for continuous knapsack constraints with application to support vector machines. SIAM J. Optim. 21(1), 361-390 (2011)
14. Held, M., Wolfe, Ph. Crowder, H.P.: Validation of subgradient optimization. Math. Program. 6(1), 62-88 (1974)
15. Helgason, R., Kennington, J., Lall, H.: A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18(1), 338-343 (1980)
16. Hochbaum, D.S., Hong, S.-P.: About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Math. Program. 69(1-3), 269-309 (1995)
17. Kiwiel, K.C.: On Floyd and Rivest's SELECT algorithm. Theor. Comput. Sci. 347(1-2), 214-238 (2005)
18. Kiwiel, K.C.: On linear-time algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 134(3), 549-554 (2007)
19. Kiwiel, K.C.: Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Program. 112(2), 473-491 (2008)
20. Kiwiel, K.C.: Variable fixing algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 36(3), 445-458 (2008)
21. Maculan, N., Santiago, C.P., Macambira, E.M., Jardim, M.H.C.: An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in Rn. J. Optim. 117(3), 553-574 (2003)
22. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3-30 (1998)
23. Michelot, C.: A finite algorithm for finding the projection of a point onto the canonical simplex of Rn. J. Optim. Theory Appl. 50(1), 195-200 (1986)
24. Nielsen, S.S., Zenios, S.A.: Massively parallel algorithms for singly constrained convex programs. INFORMS J. Comput. 4(2), 166-181 (1992)
25. Pardalos, P.M., Kovoor, N.: An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Program. 46(1-3), 321-328 (1990)
26. Robinson, A.G., Jiang, N., Lerme, C.S.: On the continuous quadratic knapsack problem. Math. Program. 55(1-3), 99-108 (1992)
27. Saito, M., Matsumoto, M.: SIMD-oriented fast mersenne twister: a 128-bit pseudorandom number generator. In: Keller, A., Heinrich, S., Niederreiter, H. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2006, pp. 607-622. Springer, Berlin (2008)
28. Shetty, B., Muthukrishnan, R.: A parallel projection for the multicommodity network model. J. Oper. Res. Soc. 41(9), 837-842 (1990)
29. Ventura, J.A.: Computational development of a lagrangian dual approach for quadratic networks. Networks 21(4), 469-485 (1991)