Abstract
In this paper, we propose a new continuous approach for the unconstrained binary quadratic programming (BQP) problems based on the Fischer-Burmeister NCP function. Unlike existing relaxation methods, the approach reformulates a BQP problem as an equivalent continuous optimization problem, and then seeks its global minimizer via a global continuation algorithm which is developed by a sequence of unconstrained minimization for a global smoothing function. This smoothing function is shown to be strictly convex in the whole domain or in a subset of its domain if the involved barrier or penalty parameter is set to be sufficiently large, and consequently a global optimal solution can be expected. Numerical results are reported for 0-1 quadratic programming problems from the OR-Library, and the optimal values generated are made comparisons with those given by the well-known SBB and BARON solvers. The comparison results indicate that the continuous approach is extremely promising by the quality of the optimal values generated and the computational work involved, if the initial barrier parameter is chosen appropriately.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alidaee, B., Kochenberger, G., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25, 401–408 (1994)
Amini, M., Alidaee, B., Kochenberger, G.: A scatter search approach to unconstrained quadratic binary programs. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Methods in Optimization, pp. 317–330. McGraw-Hill, New York (1999)
Borchardt, M.: An exact penalty approach for solving a class of minimization problem with boolean variables. Optimization 19, 829–838 (1988)
Boros, E., Hammer, P.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155–255 (2002)
Burer, S., Monterio, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for Max-Cut and other binary quadratic programs. SIAM J. Optim. 12, 503–521 (2001)
Chardaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. Manag. Sci. 41, 704–712 (1994)
Czyzyk, J., Mesnier, M., Moré, J.: The NEOS server. IEEE J. Comput. Sci. Eng. 5, 68–75 (1998)
Dolan, E.: The NEOS Server 4.0 Administrative Guide. Technical Memorandum ANL/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, May 2001
Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical reports CS-89-95, University of Tennessee, Knoxville, and Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge. http://www.netlib.org/benchmark/performance.ps (2006)
Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York (1968)
Glover, F., Alidaee, B., Kochenberger, G.: One-pass heuristics large-scale unconstrained binary quadratic programs. Eur. J. Oper. Res. 137, 272–287 (2002)
Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. Appl. Comput. Math. 42, 1115–1145 (1995)
Fischer, A.: A special Newton-type optimization methods. Optimization 24, 269–284 (1992)
Fischer, A.: Solution of the monotone complementarity problem with locally Lipschitzian functions. Math. Program. 76, 513–532 (1997)
Kochenberger, G., Glover, F., Alidaee, B., Rego, C.: A unified modeling and solution framework for combinatorial optimization problems. OR Spectrum 26, 237–250 (2004)
Luo, J., Pattipati, K., Willett, P., Hasegawa, F.: Near-optimal multiuser detection in synchronous CDMA using probabilistic data association. IEEE Commun. Lett. 5, 361–363 (2001)
Mangasarian, O.L.: Equivalence of the complementarity problem to a system of nonlinear equations. SIAM Appl. Math. 31, 89–92 (1976)
Michelon, P.: Unconstrained nonlinear 0-1 programming: a nondifferentiable approach. J. Glob. Optim. 2, 155–165 (1992)
Ng, K.-M.: A continuation approach for solving nonlinear optimization problems with discrete variables. Doctor Dissertation, Department of Management Science and Engineering of Stanford University (2002)
Pardalos, P.M., Rodgers, G.R.: A branch and bound algorithm for maximum clique problem. Comput. Oper. Res. 19, 363–375 (1992)
Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229–241 (1994)
Polijak, S., Wolkowicz, H.: Convex relaxation of (0,1)-quadratic programming. Math. Oper. Res. 3, 550–561 (1995)
Rosenberg, I.G.: 0-1 optimization and non-linear programming. Rev. Fr. Autom. Inform. Rech. Oper. (Sér. Blueu) 2, 95–97 (1972)
Sahinidis, N.V.: BARON: Branch and Reduce Optimization Navigator. http://archimedes.scs.uiuc.edu/baron/manuse.pdf (2000)
Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625–653 (1999)
Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 95, 563–591 (2004)
Wolkowicz, H., Anjos, M.F.: Semidefinite programming for discrete optimization and matrix completion problem. Discrete Appl. Math. 123, 513–577 (2003)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is partially supported by the Doctoral Starting-up Foundation (B13B6050640) of GuangDong Province.
Rights and permissions
About this article
Cite this article
Pan, S., Tan, T. & Jiang, Y. A global continuation algorithm for solving binary quadratic programming problems. Comput Optim Appl 41, 349–362 (2008). https://doi.org/10.1007/s10589-007-9110-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-007-9110-4