NDLI: Grid Restrained Nelder-Mead Algorithm

Content Provider	Springer Nature Link
Author	Bűrmen, Árpád Puhan, Janez Tuma, Tadej
Copyright Year	2006
Abstract	Probably the most popular algorithm for unconstrained minimization for problems of moderate dimension is the Nelder-Mead algorithm published in 1965. Despite its age only limited convergence results exist. Several counterexamples can be found in the literature for which the algorithm performs badly or even fails. A convergent variant derived from the original Nelder-Mead algorithm is presented. The proposed algorithm's convergence is based on the principle of grid restrainment and therefore does not require sufficient descent as the recent convergent variant proposed by Price, Coope, and Byatt. Convergence properties of the proposed grid-restrained algorithm are analysed. Results of numerical testing are also included and compared to the results of the algorithm proposed by Price et al. The results clearly demonstrate that the proposed grid-restrained algorithm is an efficient direct search method.
Starting Page	359
Ending Page	375
Page Count	17
File Format	PDF
ISSN	09266003
Journal	Computational Optimization and Applications
Volume Number	34
Issue Number	3
e-ISSN	15732894
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2006-03-23
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	unconstrained minimization Nelder-Mead algorithm direct search simplex grid Convex and Discrete Geometry Optimization Operations Research, Mathematical Programming Statistics Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Control and Optimization Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Implementing the Nelder-Mead simplex algorithm with adaptive parameters

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search

Hybridizing local search algorithms for global optimization

Direct search algorithm for bilevel programming problems

Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Dynamic Data Structures for a Direct Search Algorithm

A simplex-based numerical framework for simple and efficient robust design optimization

Multiobjective Search Algorithm with Subdivision Technique

A generating set search method using curvature information

Grid Restrained Nelder-Mead Algorithm

Similar Documents

Implementing the Nelder-Mead simplex algorithm with adaptive parameters

Gilding the Lily: A Variant of the Nelder-Mead Algorithm Based on Golden-Section Search

Hybridizing local search algorithms for global optimization

Direct search algorithm for bilevel programming problems

Multi-step nonlinear conjugate gradient methods for unconstrained minimization

Dynamic Data Structures for a Direct Search Algorithm

A simplex-based numerical framework for simple and efficient robust design optimization

Multiobjective Search Algorithm with Subdivision Technique

A generating set search method using curvature information

Grid Restrained Nelder-Mead Algorithm