Abstract
In this paper we discuss domain reduction strategies for global optimization problems with a nonconvex objective function over a bounded convex feasible region. After introducing a standard domain reduction and its iterated version, we will introduce a new reduction strategy. Under mild assumptions, we will prove the equivalence between the new domain reduction and the iterated version of the standard one, allowing a new interpretation of the latter and a new way of computing it. Finally, we prove that any “reasonable” domain reduction strategy is independent of the order by which variables are processed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Caprara, A., Locatelli, M.: Domain reduction strategies: general theory and special cases. Technical Report, Dipartimento di Informatica, Università di Torino (2008)
Caprara, A., Monaci, M.: Bidimensional packing by bilinear programming. Math. Program. (to appear)
Choquet, G.: Outlis topologiques et métriques de l’analyse mathématique. Technical Report, Centre de documentation universitaire et SEDES, Paris (1969)
de Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CentER Discussion Paper Series No. 2006-85 (2006)
Hamed A.S.E., McCormick G.P.: Calculation of bounds on variables satisfying nonlinear inequality constraints. J. Global Optim. 3, 25–47 (1993)
Hansen P., Jaumard B., Lu S.-H.: An analytical approach to global optimization. Math. Program. 52, 227–254 (1991)
Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dordrecht (1995)
Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)
Locatelli M., Raber U.: Packing equal circles into a square: a deterministic global optimization approach. Discrete Appl. Math. 122, 139–166 (2002)
Maranas C.D., Floudas C.A.: Global optimization in generalized geometric programming. Comp. Chem. Eng. 21, 351–370 (1997)
Motzkin T.S., Straus E.G.: Maxima for graphs and a new proof of a theorem of Turan. Can. J. Math. 17, 533–540 (1965)
Neumaier A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271–369 (2004)
Rockafellar R.T.: Integrals which are convex functionals. Pacific J. Math. 39, 439–469 (1971)
Ryoo H.S., Sahinidis N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8, 107–139 (1996)
Sahinidis N.V.: BARON: A general purpose global optimization software package. J. Global Optim. 8, 201–205 (1996)
Sherali H.D.: Tight relaxations for nonconvex optimization problems using the Reformulation-Linearization/Convexification Technique (RLT). In: Pardalos, P.M., Romeijn, H.E. (eds) Handbook of global optimization, vol. 2, pp. 1–64. Kluwer, Dordrecht (2002)
Tawarmalani, M., Sahinidis, N.V.: BARON on the Web, http://archimedes.scs.uiuc.edu/cgi/run.pl
Tawarmalani M., Sahinidis N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563–591 (2004)
Vavasis S.A.: Complexity issues in gobal optimization: a survey. In: Horst, R., Pardalos, P.M. (eds) Handbook of Global Optimization, Kluwer, Dordrecht (1995)
Wets R.J.-B.: On inf-compact mathematical programs. Lect. Notes Comp. Sci. 5, 426–436 (1974)
Zamora J.M., Grossmann I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14, 217–249 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Caprara, A., Locatelli, M. Global optimization problems and domain reduction strategies. Math. Program. 125, 123–137 (2010). https://doi.org/10.1007/s10107-008-0263-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-008-0263-4