Skip to main navigation Skip to search Skip to main content

Modifications of the ISIM algorithm for bound constrained function minimization

  • Harbin Institute of Technology Weihai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The Improved simplex method (ISIM) based on the Nelder-Mead search (NMS) is possible to find a better search direction by combining the information of function values of the simplex. In this paper, modifications of the ISIM algorithm is described for bound constrained function minimization. Two criterions are put forward to deal with bounded problems for a simplex may flip into an infeasible region. Simulation shows the feasibility of the modified algorithm.

Original languageEnglish
Title of host publication2006 CIE International Conference on Radar, ICR 2006
DOIs
StatePublished - 2007
Externally publishedYes
Event2006 CIE International Conference on Radar, ICR 2006 - Shanghai, China
Duration: 16 Oct 200619 Oct 2006

Publication series

NameCIE International Conference of Radar Proceedings

Conference

Conference2006 CIE International Conference on Radar, ICR 2006
Country/TerritoryChina
CityShanghai
Period16/10/0619/10/06

Keywords

  • Function minimization
  • ISIM
  • NMS

Fingerprint

Dive into the research topics of 'Modifications of the ISIM algorithm for bound constrained function minimization'. Together they form a unique fingerprint.

Cite this