This optimizer is an extension of the method of feasible directions CONMIN - CONstrained function MINimization algorithm. MMFD utilizes the direction-finding sub-problem from the Method of Feasible Directions to find a search direction but does not require the addition of a large number of slack variables associated with inequality constraints. [Vanderplaats1983] [LICENSE]
Bases: pyOpt.pyOpt_optimizer.Optimizer
MMFD Optimizer Class - Inherited from Optimizer Abstract Class
MMFD Optimizer Class Initialization
Keyword arguments:
Documentation last updated: Feb. 16, 2010 - Peter W. Jansen
Run Optimizer (Optimize Routine)
Keyword arguments:
Additional arguments and keyword arguments are passed to the objective function call.
Documentation last updated: February. 2, 2011 - Ruben E. Perez
| Name | Type | Default Value | Notes |
|---|---|---|---|
| IOPT | int | 0 | Feasible Directions Approach (0 - MMFD, 1 - MFD) |
| IONED | int | 0 | One-Dimensional Search Method (0,1,2,3) |
| CT | float | -3e-2 | Constraint Tolerance |
| DABOBJ | float | 1e-3 | Objective Absolute Tolerance (DABOBJ*abs(f(x))) |
| CTMIN | float | 4e-3 | Active Constraint Tolerance |
| DABOBJ | float | 1e-3 | Objective Absolute Tolerance (DABOBJ*abs(f(x))) |
| DELOBJ | float | 1e-3 | Objective Relative Tolerance |
| THETAZ | float | 1e-1 | Push-Off Factor |
| PMLT | float | 1e1 | Penalty multiplier for equality constraints |
| ITMAX | int | 4e2 | Maximum Number of Iterations |
| ITRMOP | int | 3 | Consecutive Iterations Iterations for Convergence |
| IPRINT | int | 2 | Print Control (0 - None, 1 - Final, 2 - Iters) |
| IFILE | str | ‘MMFD.out’ | Output File Name |