Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
From MaRDI portal
Publication:1926785
DOI10.1016/j.ejor.2012.02.028zbMath1253.90178OpenAlexW2048253612MaRDI QIDQ1926785
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.028
Related Items (18)
Mesh-based Nelder-Mead algorithm for inequality constrained optimization ⋮ A direct search method for unconstrained quantile-based simulation optimization ⋮ Estimation of agent-based models using sequential Monte Carlo methods ⋮ Optimal combination of aircraft maintenance tasks by a novel simplex optimization method ⋮ An efficient simulation optimization method for the generalized redundancy allocation problem ⋮ Constrained stochastic blackbox optimization using a progressive barrier and probabilistic estimates ⋮ Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization ⋮ Simulation optimization for stochastic casualty collection point location and resource allocation problem in a mass casualty incident ⋮ Adaptive sampling quasi-Newton methods for zeroth-order stochastic optimization ⋮ GPU parameter tuning for tall and skinny dense linear least squares problems ⋮ The role of slow manifolds in parameter estimation for a multiscale stochastic system with α-stable Lévy noise ⋮ Data assimilation and parameter estimation for a multiscale stochastic system withα-stable Lévy noise ⋮ A parameter estimation method based on random slow manifolds ⋮ Stochastic mesh adaptive direct search for blackbox optimization using probabilistic estimates ⋮ Simulation optimization: a review of algorithms and applications ⋮ Derivative-free optimization methods ⋮ Discrete conditional-expectation-based simulation optimization: methodology and applications ⋮ Optimization of Stochastic Blackboxes with Adaptive Precision
Uses Software
Cites Work
- Gradient-based simulation optimization under probability constraints
- A convergent variant of the Nelder--Mead algorithm
- Variable-number sample-path optimization
- Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems
- A Direct Search Algorithm for Optimization with Noisy Function Evaluations
- A Revised Simplex Search Procedure for Stochastic Simulation Response Surface Optimization
- Feature Article: Optimization for simulation: Theory vs. Practice
- Stochastic optimisation with inequality constraints using simultaneous perturbations and penalty functions
- `` Direct Search Solution of Numerical and Statistical Problems
- Testing Unconstrained Optimization Software
- Nelder-Mead Simplex Modifications for Simulation Optimization
- Introduction to Stochastic Search and Optimization
- Variable-sample methods for stochastic optimization
- Stochastic approximation algorithms for constrained optimization via simulation
- A Stochastic Approximation Algorithm with Varying Bounds
- A Simplex Method for Function Minimization
- Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation
- Stochastic Estimation of the Maximum of a Regression Function
- Approximation Methods which Converge with Probability one
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stochastic Nelder-Mead simplex method -- a new globally convergent direct search method for simulation optimization
