Xpress Knitro Control Parameters
Topics covered in this chapter:
This chapter provides a full list of the controls accepted by Xpress for setting Knitro parameters. Knitro has a great number and variety of user option settings and although it tries to choose the best settings by default, often significant performance improvements can be realized by choosing some non-default option settings.
Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.
[ Knitro] |
|
Specifies the tolerance in equation that determines whether Knitro will force subsequent iterates to remain feasible.
[ Knitro, Tolerances] |
|
Specifies the initial value for the barrier parameter : used with the barrier algorithms.
[ Knitro] |
|
Indicates whether an initial point strategy is used with barrier algorithms.
[ Knitro] |
|
Indicates which strategy to use for modifying the barrier parameter mu in the barrier algorithms.
[ Knitro] |
|
Indicates whether a penalty approach is applied to the constraints.
[ Knitro] |
|
Indicates which penalty parameter strategy to use for determining whether or not to accept a trial iterate.
[ Knitro] |
|
Indicates whether or not the barrier algorithms will allow switching from an optimality phase to a pure feasibility phase.
[ Knitro] |
|
Specifies the initial trust region radius scaling factor used to determine the initial trust region size.
[ Knitro] |
|
Specifies how to compute the gradients of the objective and constraint functions.
[ Derivatives, Knitro] |
|
Indicates whether or not to enforce satisfaction of simple variable bounds throughout the optimization.
[ Knitro] |
|
Specifies the (relative) tolerance used for declaring infeasibility of a model.
[ Knitro, Tolerances] |
|
Specifies which branching rule to use for MIP branch and bound procedure.
[ Branching, Knitro-MINLP] |
|
Specifies which MIP heuristic search approach to apply to try to find an initial integer feasible point.
[ Heuristics, Knitro-MINLP] |
|
Specifies the maximum number of iterations to allow for MIP heuristic, if one is enabled.
[ Heuristics, Knitro-MINLP] |
|
Specifies whether or not to add constraints to the MIP derived from logical implications.
[ Knitro-MINLP, Presolve] |
|
This value specifies the threshold for deciding whether or not a variable is determined to be an integer.
[ Knitro, Knitro-MINLP, Tolerances] |
|
Specifies which algorithm to use for any linear programming (LP) subproblem solves that may occur in the MIP branch and bound procedure.
[ Knitro-MINLP, Solution Process] |
|
Specifies the maximum number of subproblem solves allowed (0 means no limit).
[ Knitro-MINLP, Limits] |
|
Specifies node printing interval for XKTR_PARAM_MIP_OUTLEVEL when XKTR_PARAM_MIP_OUTLEVEL > 0.
[ Knitro-MINLP, Logging] |
|
Specifies the method used to initialize pseudo-costs corresponding to variables that have not yet been branched on in the MIP method.
[ Branching, Knitro-MINLP] |
|
Specifies which algorithm to use for the root node solve in MIP (same options as XKTR_PARAM_ALGORITHM user option).
[ Knitro-MINLP, Solution Process] |
|
Specifies the MIP rounding rule to apply.
[ Knitro-MINLP] |
|
Specifies the MIP select rule for choosing the next node in the branch and bound tree.
[ Knitro-MINLP] |
|
Specifies the maximum number of candidates to explore for MIP strong branching.
[ Branching, Knitro-MINLP, Limits] |
|
Specifies the maximum number of tree levels on which to perform MIP strong branching.
[ Branching, Knitro-MINLP, Limits] |
|
Specifies the maximum number of iterations to allow for MIP strong branching solves.
[ Branching, Knitro-MINLP, Limits] |
|
Specifies conditions for terminating the MIP algorithm.
[ Knitro-MINLP] |
|
Specifies the final relative stopping tolerance for the KKT (optimality) error.
[ Knitro, Tolerances] |
|
Specifies the final absolute stopping tolerance for the KKT (optimality) error.
[ Knitro, Tolerances] |
|
Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
[ Knitro, Presolve, Tolerances] |
|
Specifies whether or not to try second order corrections (SOC).
[ Knitro] |
|
The optimization process will terminate if the relative change in all components of the solution point estimate is less than xtol.
[ Knitro, Tolerances] |
© 2001-2025 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.