A modified simplex method
From MaRDI portal
Recommendations
Cited in
(19)- An adaptive search algorithm for numerical optimization
- An extension of the simplex method to constrained nonlinear optimization
- Modified branch-and-bound method for solving a series of problems
- Methods of unconditional minimization of functions using a simplex
- A modified Nelder-Mead barrier method for constrained optimization
- Multiobjective nonlinear optimization method ``vector simplex
- Modified and restarted Nelder-Mead algorithm for unconstrained optimization. II: Numerical analysis
- A modified coordinate search method based on axes rotation
- scientific article; zbMATH DE number 4152143 (Why is no real title available?)
- The simulation measurement of ultrafine Nano-particle size-Nelder-Mead simplex method
- scientific article; zbMATH DE number 14314 (Why is no real title available?)
- Vector Assessment of Problematic Situations
- Modified simplex optimization program
- Nelder-Mead Simplex Modifications for Simulation Optimization
- scientific article; zbMATH DE number 910295 (Why is no real title available?)
- A modified Hooke-Jeeves method
- A slight modification of the first phase of the simplex algorithm
- Multi-direction-based Nelder-Mead method
- A restarted and modified simplex search for unconstrained optimization
This page was built for publication: A modified simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3051819)
