DFBOX_IMPR

DFL - A Derivative-Free Library - DFBOX_IMPR: 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.


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

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

  1. Cristofari, Andrea; Rinaldi, Francesco: A derivative-free method for structured optimization problems (2021)
  2. Lapucci, Matteo; Levato, Tommaso; Sciandrone, Marco: Convergent inexact penalty decomposition methods for cardinality-constrained problems (2021)
  3. Manno, Andrea; Amaldi, Edoardo; Casella, Francesco; Martelli, Emanuele: A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement (2020)
  4. Paradezhenko, G. V.; Melnikov, N. B.; Reser, B. I.: Numerical continuation method for nonlinear system of scalar and functional equations (2020)
  5. Bruni, Renato; Celani, Fabio: Combining global and local strategies to optimize parameters in magnetic spacecraft control via attitude feedback (2019)
  6. 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)
  7. Gratton, S.; Royer, C. W.; Vicente, L. N.; Zhang, Z.: Direct search based on probabilistic feasible descent for bound and linearly constrained problems (2019)
  8. Larson, Jeffrey; Menickelly, Matt; Wild, Stefan M.: Derivative-free optimization methods (2019)
  9. Latorre, Vittorio; Habal, Husni; Graeb, Helmut; Lucidi, Stefano: Derivative free methodologies for circuit worst case analysis (2019)
  10. Nikolovski, Filip; Stojkovska, Irena: Complex-step derivative approximation in noisy environment (2018)
  11. Bruni, Renato; Celani, Fabio: A robust optimization approach for magnetic spacecraft attitude stabilization (2017)
  12. Boukouvala, Fani; Misener, Ruth; Floudas, Christodoulos A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (2016)
  13. Lucidi, Stefano; Maurici, Massimo; Paulon, Luca; Rinaldi, Francesco; Roma, Massimo: A derivative-free approach for a simulation-based optimization problem in healthcare (2016)
  14. Krejić, Nataša; Lužanin, Zorana; Nikolovski, Filip; Stojkovska, Irena: A nonmonotone line search method for noisy minimization (2015)
  15. Liuzzi, Giampaolo; Lucidi, Stefano; Rinaldi, Francesco: Derivative-free methods for mixed-integer constrained optimization problems (2015)
  16. Lv, Wei; Sun, Qiang; Lin, He; Sui, Ruirui: A penalty derivative-free algorithm for nonlinear constrained optimization (2015)
  17. Newby, Eric; Ali, M. M.: A trust-region-based derivative free algorithm for mixed integer programming (2015)
  18. Krejić, Nataša; Lužanin, Zorana; Stojkovska, Irena: A gradient method for unconstrained optimization in noisy environment (2013)
  19. Liuzzi, G.; Lucidi, S.; Rinaldi, F.: Derivative-free methods for bound constrained mixed-integer optimization (2012)
  20. Lucidi, Stefano; Sciandrone, Marco: A derivative-free algorithm for bound constrained optimization (2002)