The following pages link to One-dimensional simplex search (Q580188):
Displaying 9 items.
- Unidimensional curve fitting search schemes revisited for multidimensional optimization algorithms (Q1064742) (← links)
- An efficient interfacing of golden-section and quadratic searches (Q1078081) (← links)
- On the convergence of one-dimensional simplex search (Q1114590) (← links)
- Numerical experiments with the one-dimensional non-linear simplex search (Q1184438) (← links)
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search (Q1610317) (← links)
- One side cut accelerated random search (Q2448186) (← links)
- A new unidimensional search method for optimization: linear interpolation method (Q2490988) (← links)
- One-dimensional orthogonal search—a method for a segment approximation to acceptability regions (Q3758724) (← links)
- A simplex method using line search (Q3976887) (← links)