A Barrier Function Method for the Nonconvex Quadratic Programming Problem with Box Constraints

Journal of Global Optimization

Volumn 18, Issue 2, 2000, Pages 165-188

  Dang, Chuangyin ^a   Xu, Lei ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Barrier Function; Box Constraints; Descent Direction; Global Optimization; Iterative Method; Nonconvex Quadratic Programming

Indexed keywords

EID: 0346111799     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008397325409     Document Type: Article

References (24)

1. Barahona, F., Junger M., and Reinelt G., (1989). Experiments in quadratic 0-1 programming, Math. Program. 44: 127-137.
2. Carraghan R. and Pardalos, P.M. (1990). An exact algorithm for the maximum clique problem, Oper. Res. Lett. 9: 375-382.
3. Carter, M.W., (1984). The indefinite zero-one quadratic problem, Discrete Appl. Math. 7, 23-44.
4. De Angelis, P.L., Pardalos, P.M. and Toraldo G., (1997). Quadratic programming with box constraints, in I.M. Bomze, T. Csendes, R. Horst, P.M. Pardalos (eds.), Developments in Global Optimization, Kluwer Academic Publishers, 73-93.
5. Durbin, R. and Willshaw, D. (1987). An analog approach to the traveling salesman problem using an elastic net method, Nature 326: 689-691.
6. Fang, S.C., Rajasekera, J.R. and Tsao, H.S.J. (1997). Entropy Optimization and Mathematical Programming, Kluwer Academic Publishers.
7. Floudas, C.A. and Visweswaran, V. (1995). Quadratic optimization, in R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization, Kluwer Academic Publishers, 217-269.
8. Grippo, L. and Lucidi, S. (1991). A differentiable exact penalty function for bound constrained quadratic programming problems, Optimization 22: 557-578.
9. Gulati, V.P., Gupta, S.K. and Mital, A.K., (1984). Unconstrained quadratic bivalent programming problems, European J. of Op. Res. 15: 121-125.
10. Hammer, P.L. and Simeone, B. (1987). Order relations of variables in 0-1 programming, Ann. Discrete Maths 31: 83-112.
11. Hansen, P. (1979). Methods of nonlinear zero-one programming, Annals of Discrete Maths 5: 53-70.
12. Hopfield, J.J. (1984). Neurons with graded response have collective computational properties like those of two-state neurons, Proc. Nat. Acad. Sci U.S.A. 81: 3088-3092.
13. Minoux, M. (1986). Mathematical Programming: Theory and Algorithms, John Wiley & Sons.
14. Murty, K.G. and Kabadi, S.N., (1987). Some NP-complete problems in quadratic and nonlinear programming, Math. Prog. 39: 117-129.
15. Pardalos, P.M. (1991). Construction of test problems in quadratic bivalent programming, ACM Transact Math Software 17: 74-87.
16. Pardalos, P.M. and Jha, S., (1992). Complexity of uniqueness and local search in quadratic 0-1 programming, Oper. Res. Lett. 11: 119-123.
17. Pardalos, P.M. and Rodgers, G.P., (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming, Computing 45: 131-144.
18. Pardalos, P.M. and Rodgers, G.P., (1992). A branch and bound algorithm for the maximum clique problem, Comput. Oper. Res. 19: 363-375.
19. Pardalos, P.M. and Rosen, J.B., (1987). Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences 268, Springer.
20. Peterson, C. (1990). Parallel distributed approaches to combinatorial optimization problems -benchmark studies on T.S.P., Neural Computation 2: 261-270.
21. Poljak, S. and Wolkowicz, H., (1995). Convex relaxations of (0,1)-quadratic programming, Maths of Oper. Res. 20: 550-561.
22. Vavasis, S.A., (1991). On approximation algorithms for concave quadratic programming, in C.A. Floudas and P.M. Pardalos (eds.), Recent Advances in Global Optimization, Princeton University Press, 1992, 3-18.
23. Ye, Y., (1992). On affine scaling algorithms for nonconvex quadratic programming, Math Program. 56: 285-300.
24. Yuille, A.L. and Kosowsky, J.J. (1994). Statistical physics algorithms that converges, Neural Computation 6: 341-356.