In this presentation, ideas and ways of construction of deformed configuration methods are described. The deformed configuration methods is a generalisation of the simplex and complex algorithms by Spendley-Hext-Himsworth, Nelder-Mead, M.Box and others. Various versions of configuration mapping, special local optimality criteria whose values are used for assessing possible directions of mapping and choosing the best one, various ways of configuration adaptation are presented. The problem of convergence is also addressed. The assortment of configuration types, mapping versions, local optimality criteria, adaptation procedures and rules for combining them in a way which is most suitable for the user generates a class of the deformed configuration methods.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
