A derivative-free optimization algorithm combining line-search and trust-region techniques
From MaRDI portal
Publication:6183896
DOI10.1007/s11401-023-0040-yMaRDI QIDQ6183896
Publication date: 4 January 2024
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On trust region methods for unconstrained minimization without derivatives
- UOBYQA: unconstrained optimization by quadratic approximation
- Least Frobenius norm updating of quadratic models that satisfy interpolation conditions
- Implicit Filtering
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Introduction to Derivative-Free Optimization
- Computing Forward-Difference Intervals for Numerical Optimization
- On the Convergence of the Multidirectional Search Algorithm
- Derivative-Free and Blackbox Optimization
- Fortified-Descent Simplicial Search Method: A General Approach
- Benchmarking Derivative-Free Optimization Algorithms
- Derivative-free optimization methods
- A Simplex Method for Function Minimization
- A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
- Quasi-Newton Methods for Unconstrained Optimization