Reference Documentation by Topic/Functionality
Topics covered in this chapter:
- Bit-vector
- Branching
- Callback
- Cascading
- Controls and Attributes
- Cuts
- Data Input
- Data Information
- Derivatives
- File IO
- Heuristics
- Knitro
- Knitro-MINLP
- Licensing
- Limits
- Linearizations
- Logging
- Memory
- MISLP
- Misc
- Multistart
- Names Manager
- Numerics
- Parallel
- Presolve
- Problem Creation
- Problem Information
- Problem Modification
- Save Restore
- SLP
- SLP-convergence
- Solution Process
- Solution
- Tolerances
- User Functions
This section lists all functions, controls, and attributes of FICO XPress Nonlinear by topics. The topics comprise problem creation, modification, and the solution process itself as well as querying the solution status and values to quickly get started with the nonlinear solver.
Every function, control or attribute in this section is displayed with all their related topic areas.
Bit-vector
Reference section for all bit-vector controls.
Bit-vector library functions
Bit-vector controls
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP] |
|
Bit map describing which Xpress NonLinear functions also activate the corresponding Optimizer Library function
[ Bit-vector] |
|
Bit map describing which convergence tests should be carried out
[ Bit-vector, SLP, SLP-convergence] |
|
Branching
Reference section for functions, controls, and attributes related to Branching. All of them affect how problems are subdivided to resolve infeasibilities during the Branch and Bound search.
Branching controls
Specifies which branching rule to use for MIP branch and bound procedure.
[ Branching, Knitro-MINLP] |
|
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 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] |
Callback
Reference section for functions, controls, and attributes related to the use of callback functions. Callbacks enable the user to interact with the solver at all stages of the solution process. For example, use callbacks to interrupt the search when a special condition is satisfied, to query or reject certain solutions while the solution process is still running, or to make custom problem modifications.
Callback library functions
Copy the user-defined callbacks from one SLP problem to another
[ Callback] |
|
Set a user callback to be called when an SLP problem is about to be destroyed
[ Callback] |
|
Set a user callback to be called after each column has been tested for convergence
[ Callback, SLP, SLP-convergence] |
|
Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
[ Callback, Multistart] |
|
Set a user callback to be called every time a multistart winner has been declared
[ Callback, Multistart] |
|
Cascading
Reference section for functions, controls, and attributes for using cascading in SLP on problems with pooling structure to recompute implied values after the iteration.
Cascading library functions
Re-calculate consistent values for SLP variables based on the current values of the remaining variables.
[ Cascading, SLP, Solution Process] |
|
Cascading controls
Reduced cost tolerance on the delta variable when fixing due to the determining column being below XSLP_DRCOLTOL.
[ Cascading, SLP, Tolerances] |
|
The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
[ Cascading, SLP, Tolerances] |
|
Controls and Attributes
Reference section for functions related to setting and querying Controls and Attributes. There are various problem and solution statistics in the form of user attributes. User controls govern the execution of the solution algorithms.
Controls and Attributes library functions
Copy the values of the control variables from one SLP problem to another
[ Controls and Attributes] |
|
Retrieve the value of a double precision problem attribute
[ Controls and Attributes] |
|
Retrieve the value of a double precision problem control
[ Controls and Attributes] |
|
Retrieve the value of an integer problem attribute
[ Controls and Attributes] |
|
Retrieve the value of an integer problem control
[ Controls and Attributes] |
|
Retrieve the value of a problem pointer attribute
[ Controls and Attributes] |
|
Retrieve the value of a string problem attribute
[ Controls and Attributes] |
|
Retrieve the value of a string problem control
[ Controls and Attributes] |
|
Set the value of a double precision problem control
[ Controls and Attributes] |
|
Set the values of one SLP control to its default value
[ Controls and Attributes] |
|
Set the values of all SLP controls to their default values
[ Controls and Attributes] |
|
Set the value of an integer problem control
[ Controls and Attributes] |
|
Set the value of a control parameter by name
[ Controls and Attributes] |
|
Set the value of a string problem control
[ Controls and Attributes] |
Cuts
Reference section for functions, controls, and attributes related to cutting plane separation. Separation denotes the process of deriving new valid inequalities to strengthen the linear (LP) relaxation during the Branch and Bound Search.
Cuts controls
Data Input
Reference section for functions, controls, and attributes related to the input of auxiliary data. While not strictly necessary, auxiliary data can be used to customize the solution process.
Data Input library functions
Transfer the current solution to initial values
[ Data Input] |
|
Set the initial value of a variable
[ Data Input] |
Data Input controls
Default initial value for an SLP variable if none is explicitly given
[ Data Input] |
Data Information
Reference section for functions, controls, and attributes related to querying information about auxiliary data.
Data Information library functions
Data Information attributes
Derivatives
Reference section for functions, controls, and attributes affecting the calculation of derivatives for the local solvers.
Derivatives controls
Specifies how to compute the gradients of the objective and constraint functions.
[ Derivatives, Knitro] |
|
Absolute perturbation of values for calculating numerical derivatives
[ Derivatives] |
|
Maximum value for partial derivatives
[ Derivatives] |
|
Relative perturbation of values for calculating numerical derivatives
[ Derivatives] |
|
Minimum absolute value of delta coefficients to be retained
[ Derivatives] |
|
Bitmap describing the method of calculating derivatives
[ Derivatives] |
|
Bit map for determining the method of evaluating user functions and their derivatives
[ Derivatives, User Functions] |
|
Second order differentiation mode when using analytical derivatives
[ Derivatives] |
|
First order differentiation mode when using analytical derivatives
[ Derivatives] |
Derivatives attributes
Indicates whether numeric or analytic derivatives were used to create the linear approximations and solve the problem
[ Derivatives] |
File IO
Reference section for functions, controls, and attributes related to File IO. Use these functions to write and read data from disk.
File IO library functions
Read an Xpress NonLinear extended MPS format matrix from a file into an SLP problem
[ File IO, Problem Creation] |
|
File IO controls
Name of the set of initial values to be used
[ File IO] |
|
Heuristics
Reference section for functions, controls, and attributes related to Primal Heuristics, which are auxiliary search algorithms for quickly finding improving solutions during the Branch and Bound Search.
Heuristics controls
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] |
|
Option for running a heuristic to find a feasible initial point
[ Heuristics] |
|
Bit map selectin which heuristics to run if the problem has variable with an integer delta
[ Heuristics, SLP] |
|
Knitro
Reference section for controls related to the Knitro solver.
Knitro controls
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] |
|
This value specifies the threshold for deciding whether or not a variable is determined to be an integer.
[ Knitro, Knitro-MINLP, Tolerances] |
|
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] |
Knitro-MINLP
Reference section for controls related to the MINLP solver in Knitro.
Knitro-MINLP controls
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] |
Licensing
Reference section for functions, controls, and attributes related to Licensing.
Licensing library functions
Free any memory allocated by Xpress NonLinear and close any open Xpress NonLinear files
[ Licensing] |
|
Initializes the Xpress NonLinear system
[ Licensing] |
Limits
Reference section for controls and attributes related to the various limits for the solution process.
Limits controls
Specifies the maximum number of subproblem solves allowed (0 means no limit).
[ Knitro-MINLP, Limits] |
|
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] |
|
Number of iterations to allow numerical failures in barrier before switching to dual
[ Limits, Linearizations, SLP] |
|
Number of iterations over which to measure the objective change for barrier iterations with no crossover
[ Limits, Linearizations, SLP] |
|
The maximum time in seconds that the SLP optimization will run before it terminates
[ Limits] |
|
The maximum number of problem objects allowed to pool up before synchronization in the deterministic multistart.
[ Limits, Multistart] |
|
Number of SLP iterations up to which static objective (1) convergence testing is performed
[ Limits, SLP, SLP-convergence] |
|
Linearizations
Reference section for functions, controls, and attributes related to solving the linearizations in SLP.
Linearizations controls
Number of iterations to allow numerical failures in barrier before switching to dual
[ Limits, Linearizations, SLP] |
|
Number of iterations over which to measure the objective change for barrier iterations with no crossover
[ Limits, Linearizations, SLP] |
|
Required change in the objective when progress is measured in barrier iterations without crossover
[ Linearizations, SLP] |
|
When set, this defines a target feasibility tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
Alternative LP level control values for numerically challengeing problems
[ Linearizations, Numerics, SLP] |
|
When set, this defines a target optimality tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
[ Linearizations, SLP] |
Linearizations attributes
Logging
Reference section for functions, controls, and attributes related to Logging.
Logging library functions
Print a summary of any evaluation errors that may have occurred during solving a problem
[ Logging] |
|
Print the dimensions and memory allocations for a problem
[ Logging] |
|
Logging controls
Specifies node printing interval for XKTR_PARAM_MIP_OUTLEVEL when XKTR_PARAM_MIP_OUTLEVEL > 0.
[ Knitro-MINLP, Logging] |
|
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP] |
|
Controls if the XSLP message callback should relay messages from the XPRS library.
[ Logging] |
|
Decay term for primal integral computation
[ Logging] |
|
Reference solution value to take into account when calculating the primal integral
[ Logging] |
|
Memory
Reference section for functions, controls, and attributes related to memory handling and usage.
Memory controls
Factor for expanding size of dynamic arrays in memory
[ Memory] |
MISLP
Reference section for functions, controls, and attributes for using a combination of sequential linear programming, and branch and bound to solve MINLPs to local optimality.
MISLP library functions
MISLP controls
Bitmap describing the step-bound fixing strategy during MISLP
[ MISLP] |
|
Number of SLP iterations at each node over which to measure objective function variation
[ MISLP, SLP-convergence] |
|
Bitmap describing the step-bound relaxation strategy during MISLP
[ MISLP] |
MISLP attributes
Total number of SLP iterations in MISLP
[ MISLP] |
|
Number of nodes explored in MISLP.
[ MISLP] |
|
The underlying Optimizer MIP problem.
[ MISLP] |
|
Misc
Reference section for further miscellaneous functionality.
Misc library functions
Retrieve the error message corresponding to the last Xpress NonLinear error during an SLP run
[ Misc] |
|
Set the function error flag for the problem
[ Misc] |
Misc controls
When set to a nonzero value, the MPS reader will keep the equals column in the problem
[ Misc] |
Misc attributes
Number of internal functions
[ Misc] |
|
Local primal integral of the solve
[ Misc] |
|
Date of creation of Xpress NonLinear
[ Misc] |
|
The underlying Optimizer problem
[ Misc] |
|
The Xpress NonLinear problem
[ Misc] |
Multistart
Reference section for functions, controls, and attributes for using multistart with the nonlinear local solvers.
Multistart library functions
Removes all scheduled jobs from the multistart job pool
[ Multistart] |
|
Set a user callback to be called every time a new multistart job is created, and the pre-loaded settings are applied
[ Callback, Multistart] |
|
Set a user callback to be called every time a multistart winner has been declared
[ Callback, Multistart] |
Multistart controls
Defines the maximum range inside which initial points are generated by multistart presets
[ Multistart] |
|
The multistart master control.
[ Multistart] |
|
The maximum number of problem objects allowed to pool up before synchronization in the deterministic multistart.
[ Limits, Multistart] |
|
Random seed used for the automatic generation of initial point when loading multistart presets
[ Multistart] |
|
Multistart attributes
Status of the mutlistart search
[ Multistart] |
Names Manager
Reference section for functions, controls, and attributes related to the Names Manager.
Names Manager library functions
Retrieves the name of an Xpress NonLinear entity or the value of a function token as a character string.
[ Names Manager] |
Numerics
Reference section for functions, controls, and attributes related to Numerics.
Numerics library functions
Analyze the current matrix for largest/smallest coefficients and ratios
[ Numerics] |
|
Numerics controls
Value returned by a divide-by-zero in a formula
[ Numerics] |
|
Alternative LP level control values for numerically challengeing problems
[ Linearizations, Numerics, SLP] |
|
Numerics attributes
The total number of evaluation errors during the solve
[ Numerics] |
Parallel
Reference section for functionality around modern multi-core CPUs. By default, Xpress will detect how many cores are available in the system and try to use all of them. The controls in this section affect to which extent the solver uses the parallel hardware.
Parallel controls
Number of threads used for formula and derivatives evaluations
[ Parallel] |
|
Default number of threads to be used
[ Parallel] |
|
Presolve
Reference section for functions, controls, and attributes related to Presolve. Presolve is a collection of techniques to transform the input problem into an equivalent, but smaller problem by fixing or eliminating columns and rows.
Presolve library functions
Restores the problem to its pre-solve state
[ Presolve] |
|
Perform a nonlinear presolve on the problem
[ Presolve] |
Presolve controls
Specifies whether or not to add constraints to the MIP derived from logical implications.
[ Knitro-MINLP, Presolve] |
|
Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
[ Knitro, Presolve, Tolerances] |
|
Use linear and quadratic constraints and objective function to further reduce bounds on all variables
[ Presolve] |
|
This control determines whether postsolving should be performed automatically
[ Presolve] |
|
This control determines whether presolving should be performed on the nonlinear problem prior to starting the main algorithm
[ Presolve] |
|
This control determines the level of changes presolve may carry out on the problem and whether column/row indices may change
[ Presolve] |
|
Minimum absolute value for a variable which is identified as nonzero during SLP presolve
[ Presolve, Tolerances] |
|
This control determines whether probing on a subset of variables should be performed prior to starting the main algorithm.
[ Presolve] |
|
Controls the problem reformulations carried out before augmentation.
[ Presolve] |
Presolve attributes
Number of SLP variables eliminated by XSLPpresolve
[ Presolve] |
|
Indicates if the problem is presolved
[ Presolve] |
Problem Creation
Reference section for functions, controls, and attributes related to problem creation.
Problem Creation library functions
Copy an existing SLP problem to another
[ Problem Creation] |
|
Create a new SLP problem
[ Problem Creation] |
|
Delete an SLP problem and release all the associated memory
[ Problem Creation] |
|
Read an Xpress NonLinear extended MPS format matrix from a file into an SLP problem
[ File IO, Problem Creation] |
Problem Information
Reference section for functions, controls, and attributes related to querying information about a problem.
Problem Information library functions
Retrieve a single matrix formula in a character string.
[ Problem Information] |
|
Retrieve a single matrix coefficient as a formula in a character string.
[ Problem Information, SLP] |
|
Retrieve the list of positions of the nonlinear coefficients in the problem.
[ Problem Information, SLP] |
|
Retrieve a single matrix formula as a formula split into tokens.
[ Problem Information] |
|
Retrieve the list of positions of the nonlinear formulas in the problem
[ Problem Information] |
|
Retrieve the index of an Xpress NonLinear entity with a given name
[ Problem Information, User Functions] |
|
Load non-linear formulas into the SLP problem
[ Problem Information] |
|
Problem Information attributes
Index of the reserved "=" column
[ Problem Information] |
|
Number of variables with an exploration-type delta set up in the problem
[ Problem Information, SLP] |
|
Number of nonlinear constraints in the problem
[ Problem Information] |
|
Number of model columns in the extended original problem
[ Problem Information] |
|
Number of model rows in the extended original problem
[ Problem Information] |
|
Number of variables with a minimum perturbation step set up in the problem
[ Problem Information, SLP] |
Problem Modification
Reference section for functions, controls, and attributes related to Problem Modification after loading. Make adjustments to the current problem.
Problem Modification library functions
Add or replace a single matrix formula using a character string for the formula.
[ Problem Modification] |
|
Add or change a single matrix coefficient using a character string for the formula.
[ Problem Modification, SLP] |
|
Add non-linear formulas to the SLP problem.
[ Problem Modification] |
|
Add or change a single matrix coefficient using a parsed or unparsed formula.
[ Problem Modification, SLP] |
|
Add or replace a single matrix formula using a parsed or unparsed formula
[ Problem Modification] |
|
Delete nonlinear formulas from the current problem
[ Problem Modification] |
Save Restore
Reference section for functions, controls, and attributes related to the Save and Restore functionality.
Save Restore library functions
SLP
Reference section for functions, controls, and attributes that are specific to using the sequential linear programming solver SLP.
SLP library functions
Add or change a single matrix coefficient using a character string for the formula.
[ Problem Modification, SLP] |
|
Retrieve a single matrix coefficient as a formula in a character string.
[ Problem Information, SLP] |
|
Re-calculate consistent values for SLP variables based on the current values of the remaining variables.
[ Cascading, SLP, Solution Process] |
|
Add or change a single matrix coefficient using a parsed or unparsed formula.
[ Problem Modification, SLP] |
|
Create the full augmented SLP matrix and data structures, ready for optimization
[ SLP, Solution Process] |
|
Retrieve the list of positions of the nonlinear coefficients in the problem.
[ Problem Information, SLP] |
|
Set a user callback to be called after each column has been tested for convergence
[ Callback, SLP, SLP-convergence] |
|
Removes the augmentation and returns the problem to its pre-linearization state
[ SLP, Solution Process] |
|
SLP controls
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP] |
|
Number of iterations to allow numerical failures in barrier before switching to dual
[ Limits, Linearizations, SLP] |
|
Number of iterations over which to measure the objective change for barrier iterations with no crossover
[ Limits, Linearizations, SLP] |
|
Required change in the objective when progress is measured in barrier iterations without crossover
[ Linearizations, SLP] |
|
Shrink ratio used to impose strict convergence on variables converged in extended criteria only
[ SLP] |
|
Bit map describing which convergence tests should be carried out
[ Bit-vector, SLP, SLP-convergence] |
|
Damping factor for updating values of variables
[ SLP] |
|
Multiplier to increase damping factor during dynamic damping
[ SLP] |
|
Maximum value for the damping factor of a variable during dynamic damping
[ SLP] |
|
Minimum value for the damping factor of a variable during dynamic damping
[ SLP] |
|
Multiplier to decrease damping factor during dynamic damping
[ SLP] |
|
SLP iteration at which damping is activated
[ SLP] |
|
Minimum initial value for the step bound of an SLP variable if none is explicitly given
[ SLP] |
|
Number of SLP iterations before update rows are fully activated
[ SLP] |
|
Initial penalty cost multiplier for penalty delta vectors
[ SLP] |
|
Factor for increasing cost multiplier on total penalty delta vectors
[ SLP] |
|
Maximum penalty cost multiplier for penalty delta vectors
[ SLP] |
|
Number of SLP iterations during which to apply XSLP_DELTA_Z
[ SLP] |
|
Reduced cost tolerance on the delta variable when fixing due to the determining column being below XSLP_DRCOLTOL.
[ Cascading, SLP, Tolerances] |
|
The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
[ Cascading, SLP, Tolerances] |
|
Check feasibility at the point of linearization for extended convergence criteria
[ SLP, SLP-convergence] |
|
Absolute tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
Relative tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
Factor by which to decrease the current penalty multiplier when enforcing rows.
[ SLP] |
|
Maximum penalty cost in the objective before enforcing most violating rows
[ SLP] |
|
Initial penalty cost multiplier for penalty error vectors
[ SLP] |
|
Factor for increasing cost multiplier on total penalty error vectors
[ SLP] |
|
Maximum penalty cost multiplier for penalty error vectors
[ SLP] |
|
Factor for increasing cost multiplier on individual penalty error vectors
[ SLP] |
|
Multiplier to increase a step bound
[ SLP] |
|
When set, this defines a target feasibility tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
Base for calculating penalty costs
[ SLP] |
|
Bit map selectin which heuristics to run if the problem has variable with an integer delta
[ Heuristics, SLP] |
|
Alternative LP level control values for numerically challengeing problems
[ Linearizations, Numerics, SLP] |
|
Iteration in which to active the line search
[ SLP] |
|
Nonzero tolerance for dropping coefficients from the linearization.
[ SLP] |
|
Maximum penalty weight for delta or error vectors
[ SLP] |
|
Factor by which step bounds can be decreased beneath XSLP_ATOL_A
[ SLP] |
|
Minimum penalty weight for delta or error vectors
[ SLP] |
|
Marginal value tolerance for determining if a constraint is slack
[ SLP, SLP-convergence, Tolerances] |
|
Assumed maximum value of the objective function in absolute value.
[ SLP] |
|
Factor to estimate initial penalty costs from objective function
[ SLP] |
|
Number of SLP iterations over which to measure objective function variation for static objective (2) convergence criterion
[ SLP, SLP-convergence] |
|
When set, this defines a target optimality tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
Number of steps reaching the step bound in the same direction before step bounds are increased
[ SLP] |
|
Number of steps in same direction before damping factor is increased
[ SLP] |
|
SLP iteration after which step bounds are first applied
[ SLP] |
|
Multiplier to reduce a step bound
[ SLP] |
|
Defines an overwrite / adjustment of step bounds for improving iterations
[ SLP] |
|
Stop optimization and return error code if internal function argument is out of range
[ SLP] |
|
The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
[ Linearizations, SLP] |
|
Number of SLP iterations over which to measure static objective (3) convergence
[ SLP, SLP-convergence] |
|
Number of SLP iterations after which static objective (3) convergence testing starts
[ SLP, SLP-convergence] |
|
Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
[ SLP, SLP-convergence] |
|
Number of SLP iterations over which to measure static objective (1) convergence
[ SLP, SLP-convergence] |
|
Number of SLP iterations up to which static objective (1) convergence testing is performed
[ Limits, SLP, SLP-convergence] |
|
SLP iteration at which criteria for deletion of placeholder entries are first activated.
[ SLP] |
SLP attributes
Number of variables with an exploration-type delta set up in the problem
[ Problem Information, SLP] |
|
Number of model columns in the problem
[ SLP] |
|
Number of model rows in the problem
[ SLP] |
|
Number of coefficients in the augmented problem that might change between SLP iterations
[ SLP] |
|
Number of variables with a minimum perturbation step set up in the problem
[ Problem Information, SLP] |
|
Number of placeholder entries set to zero
[ SLP] |
|
Number of potentially zero placeholders left untouched
[ SLP] |
|
Number of potential zero placeholder entries
[ SLP] |
SLP-convergence
Reference section for functions, controls, and attributes for convergence criteria within the sequential linear programming solver SLP.
SLP-convergence library functions
Set a user callback to be called after each column has been tested for convergence
[ Callback, SLP, SLP-convergence] |
SLP-convergence controls
Bit map describing which convergence tests should be carried out
[ Bit-vector, SLP, SLP-convergence] |
|
Check feasibility at the point of linearization for extended convergence criteria
[ SLP, SLP-convergence] |
|
Absolute tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
Relative tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
Number of SLP iterations at each node over which to measure objective function variation
[ MISLP, SLP-convergence] |
|
Marginal value tolerance for determining if a constraint is slack
[ SLP, SLP-convergence, Tolerances] |
|
Number of SLP iterations over which to measure objective function variation for static objective (2) convergence criterion
[ SLP, SLP-convergence] |
|
Number of SLP iterations over which to measure static objective (3) convergence
[ SLP, SLP-convergence] |
|
Number of SLP iterations after which static objective (3) convergence testing starts
[ SLP, SLP-convergence] |
|
Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
[ SLP, SLP-convergence] |
|
Number of SLP iterations over which to measure static objective (1) convergence
[ SLP, SLP-convergence] |
|
Number of SLP iterations up to which static objective (1) convergence testing is performed
[ Limits, SLP, SLP-convergence] |
|
SLP-convergence attributes
Solution Process
Reference section for functions, controls, and attributes related to the invocation of a solution algorithm, and the most fundamental status information after the solver returns.
Solution Process library functions
Re-calculate consistent values for SLP variables based on the current values of the remaining variables.
[ Cascading, SLP, Solution Process] |
|
Create the full augmented SLP matrix and data structures, ready for optimization
[ SLP, Solution Process] |
|
Fixe the values of the error vectors
[ Solution Process] |
|
Interrupts the current SLP optimization
[ Solution Process] |
|
Maximize or minimize an SLP problem
[ Solution Process] |
|
Removes the augmentation and returns the problem to its pre-linearization state
[ SLP, Solution Process] |
|
Solution Process controls
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 which algorithm to use for the root node solve in MIP (same options as XKTR_PARAM_ALGORITHM user option).
[ Knitro-MINLP, Solution Process] |
|
Controls whether to call FICO Xpress Global or one of the local solvers
[ Solution Process] |
|
Selects the library to use for local solves
[ Solution Process] |
Solution Process attributes
SLP iteration count
[ Solution Process] |
|
The solution status of the problem.
[ Solution Process] |
|
Time spent in optimization
[ Solution Process] |
|
Includes information of which Xpress solver has been used to solve the problem
[ Solution Process] |
|
Bitmap holding the problem convergence status
[ Solution Process] |
|
Status of the optimization process.
[ Solution Process] |
Solution
Reference section for functions, controls, and attributes related to the handling of optimal or intermediate solutions.
Solution library functions
Calculate the slack values for the provided solution in the non-linear problem
[ Solution] |
|
Evaluate a coefficient using the current values of the variables
[ Solution] |
|
Evaluate a formula using the current values of the variables
[ Solution] |
|
Validate the feasibility of constraints in a converged solution
[ Solution] |
|
Validates the first order optimality conditions also known as the Karush-Kuhn-Tucker (KKT) conditions versus the currect solution
[ Solution] |
|
Validates the current problem formulation and statement
[ Solution] |
|
Prints an extensive analysis on a given constraint of the SLP problem
[ Solution] |
|
Validate the feasibility of constraints for a given solution
[ Solution] |
|
Solution controls
Solution attributes
Objective function value excluding any penalty costs
[ Solution] |
|
Indicates the type of solution returned by the solver.
[ Solution] |
|
Absolute validation index
[ Solution] |
|
Relative first order optimality validation index
[ Solution] |
|
Relative validation index
[ Solution] |
|
Net objective as calculated by validation
[ Solution] |
|
Feasiblity status of the current solution.
[ Solution] |
|
Tolerances
Reference section for functions, controls, and attributes related to feasibility and optimality tolerances.
Tolerances controls
Specifies the tolerance in equation that determines whether Knitro will force subsequent iterates to remain feasible.
[ Knitro, Tolerances] |
|
Specifies the (relative) tolerance used for declaring infeasibility of a model.
[ Knitro, Tolerances] |
|
This value specifies the threshold for deciding whether or not a variable is determined to be an integer.
[ Knitro, Knitro-MINLP, Tolerances] |
|
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] |
|
The optimization process will terminate if the relative change in all components of the solution point estimate is less than xtol.
[ Knitro, Tolerances] |
|
Absolute tolerance for deducing constant derivatives
[ Tolerances] |
|
Relative tolerance for deducing constant derivatives
[ Tolerances] |
|
Reduced cost tolerance on the delta variable when fixing due to the determining column being below XSLP_DRCOLTOL.
[ Cascading, SLP, Tolerances] |
|
The minimum absolute magnitude of a determining column, for which the determined variable is still regarded as well defined
[ Cascading, SLP, Tolerances] |
|
Absolute tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
Relative tolerance on testing feasibility at the point of linearization
[ SLP, SLP-convergence, Tolerances] |
|
When set, this defines a target feasibility tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
Marginal value tolerance for determining if a constraint is slack
[ SLP, SLP-convergence, Tolerances] |
|
When set, this defines a target optimality tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances] |
|
Minimum absolute value for a variable which is identified as nonzero during SLP presolve
[ Presolve, Tolerances] |
|
Relative tolerance for the XSLPvalidate procedure
[ Tolerances] |
|
Absolute tolerance
[ Tolerances] |
User Functions
Reference section for functions, controls, and attributes related to user functions (compare User Functions).
User Functions library functions
Add user function definitions to an SLP problem.
[ User Functions] |
|
Delete a user function from the current problem
[ User Functions] |
|
Retrieve the index of an Xpress NonLinear entity with a given name
[ Problem Information, User Functions] |
|
Imports a function from a library file to be called as a user function
[ User Functions] |
User Functions controls
Evaluation strategy for user functions
[ User Functions] |
|
Bit map for determining the method of evaluating user functions and their derivatives
[ Derivatives, User Functions] |
|
User Functions attributes
Number of user function instances
[ User Functions] |
|
Number of user functions
[ User Functions] |
|
Number of calls made to user functions
[ User Functions] |
© 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.