Abstract
The problem of finding global minima of nonlinear discrete functions arises in many fields of practical matters. In recent years, methods based on discrete filled functions have become popular as ways of solving these sort of problems. However, they rely on the steepest descent method for local searches. Here, we present an approach that does not depend on a particular local optimization method, and a new discrete filled function with the useful property that a good continuous global optimization algorithm applied to it leads to an approximation of the solution of the nonlinear discrete problem (Theorem 4). Numerical results are given showing the efficiency of the new approach.
Similar content being viewed by others
References
Dennis JE, Echebest N, Guardarucci MT, Martínez JM, Scolnik HD, Vacchino C (1991) A curvilinear search using tridiagonal secant updates for unconstrained optimization. SIAM J. Optimiz. 1:333–357
Ge RP (1990) A filled function method for finding a global minimizer of a function of several variables. Math. Program. 46:191–204
Ge RP, Qin YF (1990) The globally convexized filled functions for global optimization. Appl. Math. Comput. 35:131–158
Manders K, Adleman L (1974) NP-complete decision problems for binary quadratics. J. Comput. Syst.Sci. 16:168–184
Ng CK, Zhang LS, Li D, Tian WW (2005) Discrete filled function method for discrete global optimization. Comput. Optimiz. Appl. 31(1):87–115
Ng CK, Li D, Zhang LS (2007) Discrete global descent method for discrete global optimization and nonlinear integer programming. J. Glob. Optimiz. 37(3):357–379
Nocedal J, Wright S (2006) Numerical Optimization, 2nd edn. Springer-Verlag, New York
Woon SF, Rehbock V (2010) A critical review of discrete filled function methods in solving nonlinear discrete optimization problems. Appl. Math. Comput. 217:25–41
Yang Y, Liang Y (2007) A new discrete filled function algorithm for discrete global optimization. J. Comput. Appl. Math. 202(2):280–291
Yang Y, Wu Z, Bai F (2008) A filled function method for constrained nonlinear integer programming. J. Ind. Manag. Optimiz. 4(2):353–362
Zhu W (1998) An approximate algorithm for nonlinear integer programming. Appl. Math. Comput. 93(2–3):183–193
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Di Mauro, J., Scolnik, H.D. An augmented filled function for global nonlinear integer optimization. TOP 28, 689–704 (2020). https://doi.org/10.1007/s11750-020-00555-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-020-00555-0