Welcome

 

 Optimization involves making a positive definite quantity as small as possible. 

 

1.                   aneal/Aneal.htm The simplest and most desperate method.  Each location is randomly moved with evan an allowance for some raising.

2.                   amoeba\AMOEBA.htm -- The Nelder Mead algorithim that is the simplest working scheme for the general extremization problem.  It uses N+1 function values in N dimensions to estimate the best guess for location with a lower value.

3.                   Robmin\Welcome.htm – An iterative method that utilizes the first and second derivatives of c² along with a multidimensional Marquardt parameter.

4.                   PolyPen\Welcome.doc .htm  Constrained minimization – Lagrange multiplier - Add a Penalty to the quantity being minimized.  In this case the penalty is designed to keep the denominator of a Pade approximate greater than zero.