Pages that link to "Item:Q3543418"
From MaRDI portal
The following pages link to Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation (Q3543418):
Displayed 30 items.
- On the local convergence of a derivative-free algorithm for least-squares minimization (Q429479) (← links)
- Gradient and diagonal Hessian approximations using quadratic interpolation models and aligned regular bases (Q820723) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- Minimal numerical differentiation formulas (Q1616017) (← links)
- Compositions of convex functions and fully linear models (Q1679619) (← links)
- On the construction of quadratic models for derivative-free trust-region algorithms (Q1688943) (← links)
- Generating set search using simplex gradients for bound-constrained black-box optimization (Q2028453) (← links)
- Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
- A derivative-free exact penalty algorithm: basic ideas, convergence theory and computational studies (Q2115032) (← links)
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization (Q2143221) (← links)
- An adaptive direct multisearch method for black-box multi-objective optimization (Q2168631) (← links)
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
- Derivative-free optimization via proximal point methods (Q2250069) (← links)
- A decoupled first/second-order steps technique for nonconvex nonlinear unconstrained optimization with improved complexity bounds (Q2288191) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- The calculus of simplex gradients (Q2355312) (← links)
- A subclass of generating set search with convergence to second-order stationary points (Q2926059) (← links)
- A trust-region derivative-free algorithm for constrained optimization (Q3458835) (← links)
- ASTRO-DF: A Class of Adaptive Sampling Trust-Region Algorithms for Derivative-Free Stochastic Optimization (Q4561224) (← links)
- Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods (Q4634094) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- A Derivative-Free Method for Structured Optimization Problems (Q4987276) (← links)
- A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity (Q5031804) (← links)
- Exploiting Problem Structure in Derivative Free Optimization (Q5066599) (← links)
- An Initialization Strategy for High-Dimensional Surrogate-Based Expensive Black-Box Optimization (Q5172957) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)
- Hermite least squares optimization: a modification of BOBYQA for optimization with limited derivative information (Q6088560) (← links)
- A derivative-free optimization algorithm combining line-search and trust-region techniques (Q6183896) (← links)
- Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems (Q6190800) (← links)