BzzMinimizationRobust class

The Simplex method is unable to achieve the solution, whereas the object from the BzzMinimizationRobust class is more robust since it is able to follow the bottom of the narrow valley without collapsing in a point before achieving the real minimum. 

The BzzMinimizationSimplex class is designed to solve unconstrained multidimensional minimization problems by means of the Nelder-Mead version of the Simplex method, whereas the BzzMinimizationRobust class uses the Optnov method combined with a robust version of the Simplex method. 

BzzMinimizationRobust class objects often solve problems that require robust algorithms, especially when narrow valleys are present. 

The BzzMinimizationRobust class has several constructors. The simplest ones are... 

The problem consists of finding the values of g j, g, g, A2, A3, 3 that maximize the objective function (3.176). Optimization is difficult since gj, g 2, g 3 caimot be selected arbitrarily, but they have to be such that the corresponding point on the adiabatic curve, which starts from the inlet values of each stage, does not overcome the equilibrium curve. Conversely, it is not possible to perform the integration (3.177). It is, therefore, necessary to use an object from the BzzMinimizationRobust class as this allows the infeasible points to be discarded quite simply. 

In the BzzMinimizationMultiVeryRobust class, two objects are used one derived from the BzzMinimiza tionMonoVeryRobus t class and the other one from the BzzMinimizationRobust class. 

The BzzMinimizationRobust class object (see Section 3.2.4) uses a hybrid Optnov-Simplex method. Moreover, this search is not limited to finding the local... 

Find the minimum for tests using an object from the BzzMinimizationSim-plex class, an object from the BzzMinimizationRobust dass, and an object from the BzzMinimizationQuasiNewton dass. 

---