UOBYQA

UOBYQA: unconstrained optimization by quadratic approximation A new algorithm for general unconstrained optimization calculations is described. It takes account of the curvature of the objective function by forming quadratic models by interpolation. Obviously, no first derivatives are required. A typical iteration of the algorithm generates a new vector of variables either by minimizing the quadratic model subject to a trust region bound, or by a procedure that should improve the accuracy of the model. The paper addresses the initial positions of the interpolation points and the adjustment of trust region radii. par The algorithm works with the Lagrange functions of the interpolation equations explicitly; therefore their coefficients are updated when an interpolation point is moved. The Lagrange functions assist the procedure that improves the model and also they provide an estimate of the error of the quadratic approximation of the function being minimized. It is pointed out that results are very promising for functions with less than twenty variables.


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

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

1 2 3 next

  1. Maggiar, Alvaro; Wächter, Andreas; Dolinskaya, Irina S.; Staum, Jeremy: A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling (2018)
  2. Zhou, Zhe; Bai, Fusheng: An adaptive framework for costly black-box global optimization based on radial basis function interpolation (2018)
  3. Hare, W.: Compositions of convex functions and fully linear models (2017)
  4. Regis, Rommel G.; Wild, Stefan M.: CONORBIT: constrained optimization by radial basis function interpolation in trust regions (2017)
  5. Verdério, Adriano; Karas, Elizabeth W.; Pedroso, Lucas G.; Scheinberg, Katya: On the construction of quadratic models for derivative-free trust-region algorithms (2017)
  6. Chen, Xiaojun; Kelley, C. T.: Optimization with hidden constraints and embedded Monte Carlo computations (2016)
  7. Larson, Jeffrey; Billups, Stephen C.: Stochastic derivative-free optimization using a trust region framework (2016)
  8. Ni, Qin; Jiang, Cui; Liu, Hao: A new direct search method based on separable fractional interpolation model (2016)
  9. Wang, Jueyu; Zhu, Detong: Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (2016)
  10. Ferreira, Priscila S.; Karas, Elizabeth W.; Sachine, Mael: A globally convergent trust-region algorithm for unconstrained derivative-free optimization (2015)
  11. Yuan, Jinyun; Sampaio, Raimundo; Sun, Wenyu; Zhang, Liang: A wedge trust region method with self-correcting geometry for derivative-free optimization (2015)
  12. Yuan, Ya-xiang: Recent advances in trust region algorithms (2015)
  13. Gumma, E. A. E.; Hashim, M. H. A.; Ali, M. Montaz: A derivative-free algorithm for linearly constrained optimization problems (2014)
  14. Zhang, Zaikun: Sobolev seminorm of quadratic functions with applications to derivative-free optimization (2014)
  15. Zhou, Qinghua; Geng, Yan: Revising two trust region subproblems for unconstrained derivative free methods (2014)
  16. Maxwell, Matthew S.; Henderson, Shane G.; Topaloglu, Huseyin: Tuning approximate dynamic programming policies for ambulance redeployment via direct search (2013)
  17. Regis, Rommel G.; Shoemaker, Christine A.: A quasi-multistart framework for global optimization of expensive functions using response surface models (2013)
  18. Rios, Luis Miguel; Sahinidis, Nikolaos V.: Derivative-free optimization: a review of algorithms and comparison of software implementations (2013)
  19. Zhao, Hui; Li, Gaoming; Reynolds, Albert C.; Yao, Jun: Large-scale history matching with quadratic interpolation models (2013)
  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 next