The Nelder-Mead Simplex Method with Variables Partitioning for Solving Large Scale Optimization Problems

Ahmed F. Ali; Aboul Ella Hassanien; Václav Snåšel

doi:10.1007/978-3-319-01781-5_25

ScienceGate Book Chapters

BOOK-CHAPTER

The Nelder-Mead Simplex Method with Variables Partitioning for Solving Large Scale Optimization Problems

Ahmed F. Ali Aboul Ella Hassanien Václav Snåšel

Year: 2013 Advances in intelligent systems and computing Pages: 271-284 Publisher: Springer Nature

DOI: 10.1007/978-3-319-01781-5_25

Get Full-Text PDF Get Analytical Report

Keywords:

Simplex algorithm Mathematical optimization Simplex Convergence (economics) Process (computing) Partition (number theory) Benchmark (surveying) Computer science Scale (ratio) Variable (mathematics) Mathematics Algorithm Linear programming

Metrics

Cited By

2.33

FWCI (Field Weighted Citation Impact)

Refs

0.87

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

The Nelder-Mead Simplex Method with Variables Partitioning for Solving Large Scale Optimization Problems

Metrics

Citation History

Topics

Related Documents

Solving quantile-based stochastic optimization problems with modified Stochastic Nelder-Mead Simplex Method

Nelder-Mead Simplex Optimization Routine for Large-Scale Problems: A Distributed Memory Implementation

Optimization of Electromagnetic Filtration Variables Using a Nelder-Mead Simplex Method

Hybrid Simulated Annealing and Nelder-Mead Algorithm for Solving Large-Scale Global Optimization Problems

Demonstrating the Nelder‐Mead simplex method