A derivative-free algorithm for bound constrained optimization We propose a new globally convergent derivative-free algorithm for the minimization of a continuously differentiable function in the case that some of (or all) the variables are bounded. This algorithm investigates the local behaviour of the objective function on the feasible set by sampling it along the coordinate directions. Whenever a “suitable” descent feasible coordinate direction is detected a new point is produced by performing a linesearch along this direction. The information progressively obtained during the iterates of the algorithm can be used to build an approximation model of the objective function. The minimum of such a model is accepted if it produces an improvement of the objective function value. We also derive a bound for the limit accuracy of the algorithm in the minimization of noisy functions. Finally, we report the results of a preliminary numerical experience. (Source:

References in zbMATH (referenced in 25 articles , 1 standard article )

Showing results 1 to 20 of 25.
Sorted by year (citations)

1 2 next

  1. Bruni, Renato; Celani, Fabio: Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback (2019)
  2. Diniz-Ehrhardt, M. A.; Ferreira, D. G.; Santos, S. A.: A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions (2019)
  3. Gratton, S.; Royer, C. W.; Vicente, L. N.; Zhang, Z.: Direct search based on probabilistic feasible descent for bound and linearly constrained problems (2019)
  4. Larson, Jeffrey; Menickelly, Matt; Wild, Stefan M.: Derivative-free optimization methods (2019)
  5. Latorre, Vittorio; Habal, Husni; Graeb, Helmut; Lucidi, Stefano: Derivative free methodologies for circuit worst case analysis (2019)
  6. Gao, Jing; Cao, Jian; Yang, Yueting: A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (2018)
  7. Nikolovski, Filip; Stojkovska, Irena: Complex-step derivative approximation in noisy environment (2018)
  8. Bruni, Renato; Celani, Fabio: A robust optimization approach for magnetic spacecraft attitude stabilization (2017)
  9. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  10. Campana, Emilio F.; Diez, Matteo; Iemma, Umberto; Liuzzi, Giampaolo; Lucidi, Stefano; Rinaldi, Francesco; Serani, Andrea: Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm (2016)
  11. Liuzzi, G.; Lucidi, S.; Piccialli, V.: Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization (2016)
  12. Lucidi, Stefano; Maurici, Massimo; Paulon, Luca; Rinaldi, Francesco; Roma, Massimo: A derivative-free approach for a simulation-based optimization problem in healthcare (2016)
  13. Krejić, Nataša; Lužanin, Zorana; Nikolovski, Filip; Stojkovska, Irena: A nonmonotone line search method for noisy minimization (2015)
  14. Liuzzi, Giampaolo; Lucidi, Stefano; Rinaldi, Francesco: Derivative-free methods for mixed-integer constrained optimization problems (2015)
  15. Lv, Wei; Sun, Qiang; Lin, He; Sui, Ruirui: A penalty derivative-free algorithm for nonlinear constrained optimization (2015)
  16. Newby, Eric; Ali, M. M.: A trust-region-based derivative free algorithm for mixed integer programming (2015)
  17. Krejić, Nataša; Lužanin, Zorana; Stojkovska, Irena: A gradient method for unconstrained optimization in noisy environment (2013)
  18. Liuzzi, G.; Lucidi, S.; Rinaldi, F.: Derivative-free methods for bound constrained mixed-integer optimization (2012)
  19. Lewis, Robert Michael; Shepherd, Anne; Torczon, Virginia: Implementing generating set search methods for linearly constrained minimization (2007)
  20. Bagirov, Adil M.; Ghosh, Moumita; Webb, Dean: A derivative-free method for linearly constrained nonsmooth optimization (2006)

1 2 next