Pages that link to "Item:Q700697"
From MaRDI portal
The following pages link to A convergent variant of the Nelder--Mead algorithm (Q700697):
Displaying 20 items.
- A simplex-based numerical framework for simple and efficient robust design optimization (Q360385) (← links)
- A hyperbolic variant of the Nelder-Mead simplex method in low dimensions (Q399493) (← links)
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters (Q434176) (← links)
- Optimization over the efficient set of multi-objective convex optimal control problems (Q607889) (← links)
- Survey of derivative-free optimization (Q827577) (← links)
- A restarted and modified simplex search for unconstrained optimization (Q833553) (← links)
- Grid restrained Nelder-Mead algorithm (Q853559) (← links)
- Grid-based methods for linearly equality constrained optimization problems (Q874345) (← links)
- Unconstrained derivative-free optimization by successive approximation (Q953370) (← links)
- Frame-based ray search algorithms in unconstrained optimization (Q1411465) (← links)
- Mesh-based Nelder-Mead algorithm for inequality constrained optimization (Q1616932) (← links)
- Optimal combination of aircraft maintenance tasks by a novel simplex optimization method (Q1664843) (← links)
- Calibration of parameters in dynamic energy budget models using direct-search methods (Q1741538) (← links)
- Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization (Q1926785) (← links)
- A parameter estimation method based on random slow manifolds (Q2009937) (← links)
- A modified Nelder-Mead barrier method for constrained optimization (Q2062438) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- A derivative-free algorithm for spherically constrained optimization (Q2307754) (← links)
- Efficient calculation of regular simplex gradients (Q2419521) (← links)
- Effect of dimensionality on the Nelder–Mead simplex method (Q3377969) (← links)
