DFO is a Fortran package for solving general nonlinear optimization problems that have the following characteristics: they are relatively small scale (less than 100 variables), their objective function is relatively expensive to compute and derivatives of such functions are not available and cannot be estimated efficiently. There also may be some noise in the function evaluation procedures. Such optimization problems arise ,for example, in engineering design, where the objective function evaluation is a simulation package treated as a black box.

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

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

1 2 3 4 5 next

  1. Cauwet, Marie-Liesse; Liu, Jialin; Rozière, Baptiste; Teytaud, Olivier: Algorithm portfolios for noisy optimization (2016)
  2. Tröltzsch, Anke: A sequential quadratic programming algorithm for equality-constrained optimization without derivatives (2016)
  3. Audet, Charles; Le Digabel, Sébastien; Peyrega, Mathilde: Linear equalities in blackbox optimization (2015)
  4. Ferreira, Priscila S.; Karas, Elizabeth W.; Sachine, Mael: A globally convergent trust-region algorithm for unconstrained derivative-free optimization (2015)
  5. Lv, Wei; Sun, Qiang; Lin, He; Sui, Ruirui: A penalty derivative-free algorithm for nonlinear constrained optimization (2015)
  6. Newby, Eric; Ali, M.M.: A trust-region-based derivative free algorithm for mixed integer programming (2015)
  7. Sampaio, Ph.R.; Toint, Ph.L.: A derivative-free trust-funnel method for equality-constrained nonlinear optimization (2015)
  8. Yuan, Ya-xiang: Recent advances in trust region algorithms (2015)
  9. Teytaud, Fabien; Teytaud, Olivier: Convergence rates of evolutionary algorithms and parallel evolutionary algorithms (2014)
  10. Xue, Dan; Sun, Wenyu: On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure (2014)
  11. Zhang, Zaikun: Sobolev seminorm of quadratic functions with applications to derivative-free optimization (2014)
  12. Zhou, Qinghua; Geng, Yan: Revising two trust region subproblems for unconstrained derivative free methods (2014)
  13. Conejo, P.D.; Karas, E.W.; Pedroso, L.G.; Ribeiro, A.A.; Sachine, M.: Global convergence of trust-region algorithms for convex constrained minimization without derivatives (2013)
  14. Martínez, J.M.; Sobral, F.N.C.: Constrained derivative-free optimization on thin domains (2013)
  15. Rios, Luis Miguel; Sahinidis, Nikolaos V.: Derivative-free optimization: a review of algorithms and comparison of software implementations (2013)
  16. Bandeira, Michael Martin A.S.; Scheinberg, K.; Vicente, L.N.: Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (2012)
  17. Powell, M.J.D.: On the convergence of trust region algorithms for unconstrained minimization without derivatives (2012)
  18. Zhang, Hongchao; Conn, Andrew R.: On the local convergence of a derivative-free algorithm for least-squares minimization (2012)
  19. Zhang, Lipu; Xu, Yinghong; Liu, Yousong: An elite decision making harmony search algorithm for optimization problem (2012)
  20. Arouxét, Ma.Belén; Echebest, Nélida; Pilotta, Elvio A.: Active-set strategy in Powell’s method for optimization without derivatives (2011)

1 2 3 4 5 next