On the geometry phase in model-based algorithms for derivative-free optimization
From MaRDI portal
Recommendations
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- Geometry of interpolation sets in derivative free optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Recent progress in unconstrained nonlinear optimization without derivatives
- Introduction to Derivative-Free Optimization
Cited in
(28)- A local search method for costly black-box problems and its application to CSP plant start-up optimization refinement
- Projected adaptive cubic regularization algorithm with derivative-free filter technique for box constrained optimization
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
- Recent advances in trust region algorithms
- Geometry of interpolation sets in derivative free optimization
- Trust-region methods without using derivatives: worst case complexity and the nonsmooth case
- Bilevel derivative-free optimization and its application to robust optimization
- Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
- Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- A trust-region derivative-free algorithm for constrained optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- A derivative-free trust-region algorithm for the optimization of functions smoothed via Gaussian convolution using adaptive multiple importance sampling
- Use of quadratic models with mesh-adaptive direct search for constrained black box optimization
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
- Large-scale history matching with quadratic interpolation models
- Derivative-free optimization methods
- A surrogate management framework using rigorous trust-region steps
- Full-low evaluation methods for derivative-free optimization
- A sequential quadratic programming algorithm for equality-constrained optimization without derivatives
- Optimization by moving ridge functions: derivative-free optimization for computationally intensive functions
- Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization
- The limitation of neural nets for approximation and optimization
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
- A feasible method for constrained derivative-free optimization
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives
- Incorporating minimum Frobenius norm models in direct search
This page was built for publication: On the geometry phase in model-based algorithms for derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603660)
