Dakota Reference Manual
Version 6.4
LargeScale Engineering Optimization and Uncertainty Analysis

Access to methods in the CONMIN library
This keyword is related to the topics:
Alias: none
Argument(s): none
Required/Optional  Description of Group  Dakota Keyword  Dakota Keyword Description  

Required (Choose One)  Group 1  frcg  A conjugate gradient optimization method  
mfd  Method of feasible directions  
Optional  max_iterations  Stopping criterion based on number of iterations  
Optional  convergence_tolerance  Stopping criterion based on convergence of the objective function or statistics  
Optional  constraint_tolerance  The maximum allowable value of constraint violation still considered to be feasible  
Optional  speculative  Compute speculative gradients  
Optional  max_function_evaluations  Stopping criteria based on number of function evaluations  
Optional  scaling  Turn on scaling for variables, responses, and constraints  
Optional  linear_inequality_constraint_matrix  Define coefficients of the linear inequality constraints  
Optional  linear_inequality_lower_bounds  Define lower bounds for the linear inequality constraint  
Optional  linear_inequality_upper_bounds  Define upper bounds for the linear inequality constraint  
Optional  linear_inequality_scale_types  Specify how each linear inequality constraint is scaled  
Optional  linear_inequality_scales  Define the characteristic values to scale linear inequalities  
Optional  linear_equality_constraint_matrix  Define coefficients of the linear equalities  
Optional  linear_equality_targets  Define target values for the linear equality constraints  
Optional  linear_equality_scale_types  Specify how each linear equality constraint is scaled  
Optional  linear_equality_scales  Define the characteristic values to scale linear equalities  
Optional  model_pointer  Identifier for model block to be used by a method 
The CONMIN library[84] is a public domain library of nonlinear programming optimizers, specifically the FletcherReeves conjugate gradient (Dakota's conmin_frcg
method) method for unconstrained optimization, and the method of feasible directions (Dakota's conmin_mfd
method) for constrained optimization. As CONMIN was a predecessor to the DOT commercial library, the algorithm controls are very similar.
One of the two available methods in Group 1 must be specified.
All these methods take the same Optional Keywords , dealing with linear equality and inequality constraints.
These keywords may also be of interest: