Pages that link to "Item:Q1100854"
From MaRDI portal
The following pages link to An adaptive search algorithm for numerical optimization (Q1100854):
Displaying 18 items.
- One-dimensional simplex search (Q580188) (← links)
- An efficient interfacing of golden-section and quadratic searches (Q1078081) (← links)
- Efficient optimization of certain functionals in a hypercube (Q1081282) (← links)
- Numerical experiments with the one-dimensional non-linear simplex search (Q1184438) (← links)
- Optimization by pattern search (Q1342017) (← links)
- Gilding the lily: A variant of the Nelder-Mead algorithm based on Golden-section search (Q1610317) (← links)
- Accelerating optimization by tracing valley (Q1682470) (← links)
- Stochastic minimization with adaptive memory (Q1893594) (← links)
- Derivative free optimization in higher dimension (Q2767684) (← links)
- A revised simplex search procedure for stochastic simulation response surface optimization (Q2884488) (← links)
- (Q3018325) (← links)
- Efficient Implementation of the Nelder-Mead Search Algorithm (Q3159480) (← links)
- The use of hypothetical points in numerical optimization (Q3707769) (← links)
- A simplex method using line search (Q3976887) (← links)
- Nelder-Mead Simplex Modifications for Simulation Optimization (Q4363701) (← links)
- Some modifications of low-dimensional simplex evolution and their convergence (Q4924104) (← links)
- A combined topographical search strategy with ellipsometric application (Q5942315) (← links)
- Searching minima of an \(N\)-dimensional surface: A robust valley following method (Q5948717) (← links)