The following pages link to The calculus of simplex gradients (Q2355312):
Displaying 20 items.
- Global optimization using \(q\)-gradients (Q322763) (← links)
- On gradient simplex methods for linear programs (Q705416) (← links)
- A discussion on variational analysis in derivative-free optimization (Q829491) (← links)
- Compositions of convex functions and fully linear models (Q1679619) (← links)
- Nonsmooth spectral gradient methods for unconstrained optimization (Q1688945) (← links)
- Approximating the diagonal of a Hessian: which sample set of points should be used (Q2084264) (← links)
- Uniform simplex of an arbitrary orientation (Q2192988) (← links)
- Limiting behavior of derivative approximation techniques as the number of points tends to infinity on a fixed interval in \(\mathbb{R}\) (Q2222168) (← links)
- Efficient calculation of regular simplex gradients (Q2419521) (← links)
- Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\) (Q2687735) (← links)
- (Q3842055) (← links)
- Improving the Flexibility and Robustness of Model-based Derivative-free Optimization Solvers (Q4960952) (← links)
- Derivative-free optimization methods (Q5230522) (← links)
- Calculus Identities for Generalized Simplex Gradients: Rules and Applications (Q5853722) (← links)
- Using orthogonally structured positive bases for constructing positive \(k\)-spanning sets with cosine measure guarantees (Q6087872) (← links)
- Gradient free cooperative seeking of a moving source (Q6103010) (← links)
- Ensemble-Based Gradient Inference for Particle Methods in Optimization and Sampling (Q6177924) (← links)
- An approximating state-dependent control method based on modified pattern search optimization for nonlinear optimal control problem (Q6542634) (← links)
- Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
- A hybrid direct search and projected simplex gradient method for convex constrained minimization (Q6640994) (← links)
