Pages that link to "Item:Q3159480"
From MaRDI portal
The following pages link to Efficient Implementation of the Nelder-Mead Search Algorithm (Q3159480):
Displaying 15 items.
- A simplex-based numerical framework for simple and efficient robust design optimization (Q360385) (← links)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
- A convergent variant of the Nelder--Mead algorithm (Q700697) (← links)
- A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
- Grid restrained Nelder-Mead algorithm (Q853559) (← links)
- An adaptive search algorithm for numerical optimization (Q1100854) (← 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)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- Robust identification of enzymatic nonlinear dynamical systems for 1,3-propanediol transport mechanisms in microbial batch culture (Q1646086) (← links)
- Multi-model inference of non-random mating from an information theoretic approach (Q2289672) (← links)
- Proper initialization is crucial for the Nelder-Mead simplex search (Q2311116) (← links)
- Practical initialization of the Nelder-Mead method for computationally expensive optimization problems (Q2688914) (← links)
- Less is more: Simplified Nelder-Mead method for large unconstrained optimization (Q4987781) (← links)
