MOAB: Mesh Oriented datABase
(version 5.2.1)

The NonGradient class is also a concrete vertex mover which performs derivative free minimization based on the Amoeba Method, as implemented in Numerical Recipes in C. More...
#include "NonGradient.hpp"
#include "MsqFreeVertexIndexIterator.hpp"
#include "MsqTimer.hpp"
#include "MsqDebug.hpp"
#include "MsqError.hpp"
#include <cmath>
#include <iostream>
#include "../../ObjectiveFunction/ObjectiveFunction.hpp"
#include <float.h>
Go to the source code of this file.
Namespaces  
namespace  MBMesquite 
Implements the NonSmoothDescent class member functions. 
The NonGradient class is also a concrete vertex mover which performs derivative free minimization based on the Amoeba Method, as implemented in Numerical Recipes in C.
The other optimization methods either accept or reject a point immediately. Amoeba may not accept a point for several iterations/evaluations. Amoeba does not check for BOUNDED_VERTEX_MOVERMENT. rtol=2.0*fabs( height[ihi]height[ilo] )/ ( fabs(height[ihi])+fabs(height[ilo])+threshold );
We are aware of the problem of choosing the initial simplex, but have not sovled it. How has this been solved? There is a problem of letting Mesquite handle convergence. The idea here is to call accumulate_? only if the best point changes. But does it matter? Where are the errors determined? What does it mean to cull? What does Pat... compare and contrast the differnt vertex movement criteria with the Amoeba criterion.
Definition in file NonGradient.cpp.