Abstract
In this paper we extend Continuous Derivative Free (CDF) algorithms that solve optimization models with continuous variables to the solution of optimization models with both continuous and discrete variables. The algorithm fits naturally to the solution of discretized models arising from continuous models. Roughly speaking, the finer the discretization, the closer the discretized solution is to its continuous counterpart. The algorithm also finds stationary points of real problems with continuous and discrete variables. Encouraging results are reported on an access point communication problem and on models solved with a Field Programmable Gate Array (FPGA) device, which generally forces a fixed point discretization of the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramson MA, Audet C, Chrissis JW, Walston JG (2009) Mesh adaptive search algorithms for mixed variable optimization. Optim Lett 3:35–47
Audet C, Dennis JE Jr (2001) Pattern search algorithms for mixed variable programming. SIAM J Optim 11(3):573–594
Audet C, Dennis JE Jr (2006) Mesh adaptive direct search algorithms for constrained optimization. SIAM J Optim 17(2):642–664
Averbakh I, Berman O, Drezner Z, Wesolowsky GO (2007) The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation. Eur J Oper Res 179:956–967
Averick BM, Carter RG, Moré JJ (1991) The minpack-2 test problem collection. Technical memorandum 150, Argonne National Laboratory, May 1991
Bosio S, Capote A, Cesana M (2007) Radio planning of wireless local area networks. IEEE/ACM Trans Netw 15(6):1414–1427
Coope ID, Price CJ (2000) Frame based methods for unconstrained optimization. J Optim Theory Appl 107(2):261–274
Custódio AL, Rocha H, Vicente LN (2010) Incorporating minimum Frobenius norm models in direct search. Comput Optim Appl 46:265–278
Douglas SC (2007) Fixed-point algorithms for the blind separation of arbitrary complex-valued non-Gaussian signal mixtures. J Appl Signal Process 2007(1), doi:10.1155/2007/36525
García-Palomares UM, González Castaño FJ, Burguillo Rial JC (2006) A combined global and local search approach to global optimization. J Glob Optim 34:409–426
García-Palomares UM, Rodríguez JF (2002) New sequential and parallel derivative-free algorithms for unconstrained minimization. SIAM J Optim 13(1):79–96
González Castaño FJ, Montenegro EC, Burguillo Rial JC, García Palomares UM (2008) Outdoor WLAN planning via non-monotone derivative free optimization: Algorithm adaptation and case study. Comput Optim Appl 40(3):405–419
Gratton S, Toint PhL, Troltzsch A (2010) An active-set trust-region method for derivative-free nonlinear bound-constrained optimization. Technical report, Cerfacs
Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449–467
Hansen P, Mladenović N, Urosević D (2006) Variable neighborhood search and local branching. Comput Oper Res 33:3034–3045
Imran A, Salhi S, Wassan N (2009) A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. Eur J Oper Res 197:509–518
Kamenetsky M, Unbehaun M (2002) Coverage planning for outdoor wireless LAN systems. In: 2002 International Zurich seminar on broadcast communications, pp 49.1–49.6
Kim JS, Deng L, Mangalagiri P, Irick K, Sobti K, Kandemir M, Narayanan V, Chakrabarti C, Pitsianis N, Sun X (2009) Au automated framework for accelerating numerical algorithms on reconfigurable platforms using algorithmic/architectural optimization. IEEE Trans Comput 58(12):1654–1667
Leyffer S (2001) Integrating SQP and branch and bound for mixed integer nonlinear programming. Comput Optim Appl 18(3):295–309
Li Y, Kang L-S (2002) A robust algorithm for solving nonlinear programming problems. Int J Comput Math 79:523–536
Lucidi S, Piccialli V, Sciandrone M (2005) An algorithm model for mixed variable programming. SIAM J Control Optim 15(4):1057–1084
Lucidi S, Sciandrone M (2002) On the global convergence of derivative-free methods for unconstrained optimization. SIAM J Optim 13(1):97–116
Messmer P, Bodenner R (2006) Accelerating scientific applications using FPGAs. Xcell Journal, 70–73
Powell MJD (2009) The BOBYQA algorithm for bound constrained optimization without derivatives. Technical report, Cambridge University
Rodríguez-Henríquez F, Saqib NA, Díaz-Pérez A (2003) 4.2 Gbit/s single-chip FPGA implementation of AES algorithm. Electron Lett 39:1115–1116
Sansaloni T, Pérez-Pascual A, Valls J (2003) Area-efficient FPGA-based FFT processor. Electron Lett 39:19
Siwale I (2007) A note on mixed variable mathematical programs. Technical report, Ike’s Research Ltd, England. http://www.aptech.com/papers/MixedVarMath.pdf
Sutter G, Deschamps JP (2009) High speed fixed point dividers for FPGAs. In: International conference on field programming logic and applications, pp 448–452
Tachibana T, Murata Y, Shibata N, Yasumoto K (2007) Minoru Ito. Proposal of flexible implementation of genetic algorithms on FPGAs. Syst Comput Jpn 38:28–38
Torn A, Montaz A, Viitanen S (1999) Stochastic global optimization problem classes and solution techniques. J Glob Optim 14:437–447
Unbehaun M, Kamenetsky M (2003) On the deployment of picocelular wireless infrastructure. IEEE Wirel Commun 10:70–80
Vavouras M, Papadimitriou K, Papaefstathiou I (2009) Implementation of a genetic algorithm on a virtex-ii pro FPGA. In: Proceeding of the ACM/SIGDA international symposium on FPGAs, p 287
Vicente LN (2009) Implicitly and densely discrete black-box optimization problems. Optim Lett 3:475–482
Whitacre JM (2007) Adaptation and self-organization in evolutionary algorithms. PhD thesis, School of Chemical Sciences and Engineering, The University of New South Wales
Wu A, So S (2003) VLSI implementation of genetic four-step search for block matching algorithm. IEEE Trans Consum Electron 49:1474–1481
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
García-Palomares, U.M., Costa-Montenegro, E., Asorey-Cacheda, R. et al. Adapting derivative free optimization methods to engineering models with discrete variables. Optim Eng 13, 579–594 (2012). https://doi.org/10.1007/s11081-011-9168-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11081-011-9168-9