Initializing help system before first use

Reference Documentation by Topic/Functionality

Topics covered in this chapter:


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

Change the status setting of a constraint
[ Bit-vector, Data Input, SLP]
Retrieve the status setting of a constraint
[ Bit-vector, SLP, Solution]

Bit-vector controls

Bit map describing the SLP algorithm(s) to be used
[ Bit-vector, SLP]
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP]
Bit map describing the SLP augmentation method(s) to be used
[ Bit-vector, 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]
Bit map for controlling solution updates
[ Bit-vector, SLP, Solution]
Bitmap describing the MISLP algorithms to be used
[ Bit-vector, MISLP]
Bitmap indicating the SLP presolve actions to be taken
[ Bit-vector, Presolve]
Controls the information printed for XSLP_TRACEMASK.
[ Bit-vector, Logging, SLP]
Bitmap determining the behavior of the placeholder deletion procedure
[ Bit-vector, SLP]

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 whether or not to branch on generalized upper bounds (GUBs).
[ 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 at the end of the cascading process, after the last variable has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after each column has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after cascading a column was not successful
[ Callback, Cascading, SLP]
Set a user callback to be called when an evaluation of a coefficient fails during the solve
[ Callback, Numerics]
Set a user callback to be called during the Xpress-SLP augmentation process
[ Callback, SLP]
Set a user callback to be called when an SLP problem is about to be destroyed
[ Callback]
Set a user callback used to override the update of variables with small determining column
[ Callback, Cascading, SLP]
Set a user callback to be called during MISLP when an integer solution is obtained
[ Callback, MISLP]
Set a user callback to be called at the end of each SLP iteration
[ Callback, SLP]
Set a user callback to be called at the start of each SLP iteration
[ Callback, SLP]
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 whenever Xpress NonLinear outputs a line of text according to XSLP_ECHOXPRSMESSAGES.
[ Callback, Logging]
Set a user callback to be called every time a new multistart job finishes.
[ Callback, 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]
Set a user callback to be called during MISLP when an optimal SLP solution is obtained at a node
[ Callback, MISLP]
Set a user callback to be called during MISLP after the set-up of the SLP problem to be solved at a node, but before SLP optimization
[ Callback, MISLP]
Set a user callback to be called after the nonlinear presolver has been applied.
[ Callback, SLP]
Set a user callback to be called before the linearization is updated
[ Callback, SLP]
Set a user callback to be called at the end of the SLP optimization
[ Callback, SLP]
Set a user callback to be called during MISLP after the SLP optimization at each node.
[ Callback, MISLP]
Set a user callback to be called at the start of the SLP optimization
[ Callback, SLP]

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]
Set a user callback to be called at the end of the cascading process, after the last variable has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after each column has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after cascading a column was not successful
[ Callback, Cascading, SLP]
Set a user callback used to override the update of variables with small determining column
[ Callback, Cascading, SLP]
Set the determining row of a variable
[ Cascading, Data Input, SLP]

Cascading controls

Bit map describing the cascading to be used
[ Cascading, SLP]
Maximum number of iterations for cascading with non-linear determining rows
[ Cascading, Limits, SLP]
Absolute cascading print tolerance
[ Cascading, Logging, SLP]
Relative cascading print tolerance
[ Cascading, Logging, 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]
The range around the previous value where variables are fixed in cascading if the determining column is below XSLP_DRCOLTOL.
[ Cascading, SLP]

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

Specifies rules for adding MIP knapsack cuts.
[ Cuts, Knitro-MINLP]
Determines whihc cuts to apply in the MISLP search when the default SLP-in-MIP strategy is used.
[ Cuts, MISLP]

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

Establish a re-calculation sequence for SLP variables with determining rows.
[ Data Input, SLP]
Set a variable specific cascade iteration limit
[ Data Input, SLP]
Change the status setting of a constraint
[ Bit-vector, Data Input, SLP]
Set or change the initial penalty error weight for a row
[ Data Input, SLP]
A combined version of XSLPmsaddjob and XSLPmsaddpreset.
[ Data Input, Multistart]
Adds a multistart job to the multistart pool
[ Data Input, Multistart]
Loads a preset of jobs into the multistart job pool.
[ Data Input, Multistart]
Transfer the current solution to initial values
[ Data Input]
Set the determining row of a variable
[ Cascading, Data Input, SLP]
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

Get the initial penalty error weight for a row
[ Data Information, SLP]

Data Information attributes

Number of SLP variables
[ Data Information, SLP]

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]
Specifies how to compute the (approximate) Hessian of the Lagrangian.
[ 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]
Tolerance used when calculating derivatives
[ Derivatives, Tolerances]
Absolute zero acceptance tolerance used when calculating derivatives
[ Derivatives, Tolerances]
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]
Restore the Xpress NonLinear problem from a file created by XSLPsave
[ File IO, Save Restore]
Save the Xpress NonLinear problem to file
[ File IO, Save Restore]
Save the Xpress NonLinear problem to a named file
[ File IO, Save Restore]
Define an output file to be used to receive messages from Xpress NonLinear
[ File IO, Logging]
Write the current problem to a file in extended MPS or text format
[ File IO, Problem Information]
Write the current solution to an MPS like file format
[ File IO, Solution]

File IO controls

Name of the set of initial values to be used
[ File IO]
Name of the set of tolerance sets to be used
[ File IO, SLP]

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]
Branch and Bound: This specifies the MINLP heuristic strategy.
[ Heuristics, SLP]

Knitro

Reference section for controls related to the Knitro solver.

Knitro controls

Indicates which algorithm to use to solve the problem
[ Knitro, Solution Process]
Controls the maximum number of consecutive conjugate gradient (CG) steps before Knitro will try to enforce that a step is taken using direct linear algebra.
[ Knitro, Limits]
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 the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
[ Knitro, Limits]
Specifies the maximum number of crossover iterations before termination.
[ Knitro, Limits]
Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
[ Knitro, Limits]
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 the final relative stopping tolerance for the feasibility error.
[ Knitro, Tolerances]
Specifies the final absolute stopping tolerance for the feasibility error.
[ Knitro, Tolerances]
Specifies how to compute the gradients of the objective and constraint functions.
[ Derivatives, Knitro]
Specifies how to compute the (approximate) Hessian of the Lagrangian.
[ 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 the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
[ Knitro, Limits]
Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
[ Knitro, Limits]
Specifies the maximum number of iterations before termination.
[ Knitro, Limits]
This value specifies the threshold for deciding whether or not a variable is determined to be an integer.
[ Knitro, Knitro-MINLP, Tolerances]
The absolute integrality gap stop tolerance for MIP.
[ Knitro, Knitro-MINLP, Tolerances]
The relative integrality gap stop tolerance for MIP.
[ Knitro, Knitro-MINLP, Tolerances]
Specifies the extreme limits of the objective function for purposes of determining unboundedness.
[ Knitro, Limits]
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]
Controls the level of output produced by Knitro.
[ Knitro, Logging]
Determine whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints.
[ Knitro, Presolve]
Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
[ Knitro, Presolve, Tolerances]
Performs a scaling of the objective and constraint functions based on their values at the initial point.
[ Knitro, Numerics]
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 whether or not to branch on generalized upper bounds (GUBs).
[ 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]
The absolute integrality gap stop tolerance for MIP.
[ Knitro, Knitro-MINLP, Tolerances]
The relative integrality gap stop tolerance for MIP.
[ Knitro, Knitro-MINLP, Tolerances]
Specifies rules for adding MIP knapsack cuts.
[ Cuts, Knitro-MINLP]
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 nodes explored.
[ Knitro-MINLP, Limits]
Specifies the maximum number of subproblem solves allowed (0 means no limit).
[ Knitro-MINLP, Limits]
Specifies which MIP method to use.
[ Knitro-MINLP, Solution Process]
Specifies node printing interval for XKTR_PARAM_MIP_OUTLEVEL when XKTR_PARAM_MIP_OUTLEVEL > 0.
[ Knitro-MINLP, Logging]
Specifies how much MIP information to print.
[ 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

Controls the maximum number of consecutive conjugate gradient (CG) steps before Knitro will try to enforce that a step is taken using direct linear algebra.
[ Knitro, Limits]
Indicates the maximum allowable number of backtracks during the linesearch of the Interior/Direct algorithm before reverting to a CG step.
[ Knitro, Limits]
Specifies the maximum number of crossover iterations before termination.
[ Knitro, Limits]
Indicates the maximum number of refactorizations of the KKT system per iteration of the Interior/Direct algorithm before reverting to a CG step.
[ Knitro, Limits]
Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
[ Knitro, Limits]
Specifies the number of limited memory pairs stored when approximating the Hessian using the limited-memory quasi-Newton BFGS option.
[ Knitro, Limits]
Specifies the maximum number of iterations before termination.
[ Knitro, Limits]
Specifies the maximum number of nodes explored.
[ Knitro-MINLP, Limits]
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]
Specifies the extreme limits of the objective function for purposes of determining unboundedness.
[ Knitro, Limits]
Number of initial SLP iterations using the barrier method
[ Limits, Linearizations, 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]
Maximum number of iterations for cascading with non-linear determining rows
[ Cascading, Limits, SLP]
The maximum number of consecutive infeasible SLP iterations which can occur before Xpress-SLP terminates
[ Limits, SLP]
The maximum number of SLP iterations
[ Limits, SLP]
Number of iterations in the line search
[ Limits, SLP]
Number of iterations in the pattern search preceding the line search
[ Limits, SLP]
Maximum number of zero length line search steps before line search is deactivated
[ Limits, SLP]
The maximum time in seconds that the SLP optimization will run before it terminates
[ Limits]
Number of SLP iterations to check when considering a node for cutting off
[ Limits, MISLP]
Number of SLP iterations to check when considering a node for cutting off
[ Limits, MISLP]
Maximum number of SLP iterations at each node
[ Limits, MISLP]
The maximum number of jobs to create during the multistart search.
[ Limits, Multistart]
The maximum total time to be spent in the mutlistart search.
[ Limits, Multistart]
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]
Number of consecutive times a placeholder entry is zero before being considered for deletion
[ Limits, SLP]

Linearizations

Reference section for functions, controls, and attributes related to solving the linearizations in SLP.

Linearizations controls

Default crossover activation behaviour for barrier start
[ Linearizations, SLP]
Number of initial SLP iterations using the barrier method
[ Limits, Linearizations, 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]
Controls behaviour when the barrier is used to solve the linearizations
[ 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]
Default algorithm to be used during the tree search in MISLP
[ Linearizations, MISLP]
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

Number of infeasible constraints found at the point of linearization
[ Linearizations, SLP]

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]
Set a user callback to be called whenever Xpress NonLinear outputs a line of text according to XSLP_ECHOXPRSMESSAGES.
[ Callback, Logging]
Define an output file to be used to receive messages from Xpress NonLinear
[ File IO, Logging]

Logging controls

Specifies node printing interval for XKTR_PARAM_MIP_OUTLEVEL when XKTR_PARAM_MIP_OUTLEVEL > 0.
[ Knitro-MINLP, Logging]
Specifies how much MIP information to print.
[ Knitro-MINLP, Logging]
Controls the level of output produced by Knitro.
[ Knitro, Logging]
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP]
Frequency with which to save the model
[ Logging, SLP]
Absolute cascading print tolerance
[ Cascading, Logging, SLP]
Relative cascading print tolerance
[ Cascading, Logging, SLP]
Formatting string for creation of names for SLP delta vectors
[ Logging, SLP]
Position of first character of SLP variable name used to create name of delta vector
[ Logging, SLP]
Controls if the XSLP message callback should relay messages from the XPRS library.
[ Logging]
Position of first character of constraint name used to create name of penalty error vectors
[ Logging, SLP]
Level of printing during SLP iterations
[ Logging, SLP]
Formatting string for creation of names for SLP negative penalty delta vectors
[ Logging, SLP]
Formatting string for creation of names for SLP negative penalty error vectors
[ Logging, SLP]
Frequency with which MIP status is printed
[ Logging, MISLP]
The level of logging during the multistart run.
[ Logging, Multistart]
Formatting string for creation of the names of the SLP penalty transfer vectors
[ Logging, SLP]
Iteration from which to record row penalty information
[ Logging, SLP]
Formatting string for creation of the names of the SLP penalty rows
[ Logging, SLP]
Formatting string for creation of names for SLP positive penalty delta vectors
[ Logging, SLP]
Formatting string for creation of names for SLP positive penalty error vectors
[ Logging, SLP]
Decay term for primal integral computation
[ Logging]
Reference solution value to take into account when calculating the primal integral
[ Logging]
Formatting string for creation of names for SLP lower step bound rows
[ Logging, SLP]
Name of the set of initial step bounds to be used
[ Logging, SLP]
Position of first character of SLP variable name used to create name of SLP lower and upper step bound rows
[ Logging, SLP]
Formatting string for creation of names for SLP upper step bound rows
[ Logging, SLP]
Frequency with which SLP status is printed
[ Logging, SLP]
Mask of variable or row names that are to be traced through the SLP iterates
[ Logging, SLP]
Controls the information printed for XSLP_TRACEMASK.
[ Bit-vector, Logging, SLP]
Formatting string for creation of names for SLP update rows
[ Logging, SLP]
Position of first character of SLP variable name used to create name of SLP update row
[ Logging, SLP]

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

Set a user callback to be called during MISLP when an integer solution is obtained
[ Callback, MISLP]
Set a user callback to be called during MISLP when an optimal SLP solution is obtained at a node
[ Callback, MISLP]
Set a user callback to be called during MISLP after the set-up of the SLP problem to be solved at a node, but before SLP optimization
[ Callback, MISLP]
Set a user callback to be called during MISLP after the SLP optimization at each node.
[ Callback, MISLP]

MISLP controls

Determines whihc cuts to apply in the MISLP search when the default SLP-in-MIP strategy is used.
[ Cuts, MISLP]
Determines if the parallel features of SLP should be guaranteed to be deterministic
[ MISLP, Parallel, SLP]
Bitmap describing the MISLP algorithms to be used
[ Bit-vector, MISLP]
Absolute objective function cutoff for MIP termination
[ MISLP, Tolerances]
Absolute objective function cutoff for MIP termination
[ MISLP, Tolerances]
Number of SLP iterations to check when considering a node for cutting off
[ Limits, MISLP]
Number of SLP iterations to check when considering a node for cutting off
[ Limits, MISLP]
Default algorithm to be used during the tree search in MISLP
[ Linearizations, MISLP]
Absolute penalty error cost tolerance for MIP cut-off
[ MISLP, Tolerances]
Relative penalty error cost tolerance for MIP cut-off
[ MISLP, Tolerances]
Bitmap describing the step-bound fixing strategy during MISLP
[ MISLP]
Maximum number of SLP iterations at each node
[ Limits, MISLP]
Frequency with which MIP status is printed
[ Logging, MISLP]
Number of SLP iterations at each node over which to measure objective function variation
[ MISLP, SLP-convergence]
Absolute objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
Relative objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
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]
Number of integer solutions found in MISLP.
[ MISLP, Solution]

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]
Unique identifier for the current job
[ Misc, Multistart]
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

A combined version of XSLPmsaddjob and XSLPmsaddpreset.
[ Data Input, Multistart]
Adds a multistart job to the multistart pool
[ Data Input, Multistart]
Loads a preset of jobs into the multistart job pool.
[ Data Input, Multistart]
Removes all scheduled jobs from the multistart job pool
[ Multistart]
Set a user callback to be called every time a new multistart job finishes.
[ Callback, 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 level of logging during the multistart run.
[ Logging, Multistart]
The maximum number of jobs to create during the multistart search.
[ Limits, Multistart]
The maximum total time to be spent in the mutlistart search.
[ Limits, 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]
The maximum number of threads to be used in multistart
[ Multistart, Parallel]

Multistart attributes

Unique identifier for the current job
[ Misc, Multistart]
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]
Set a user callback to be called when an evaluation of a coefficient fails during the solve
[ Callback, Numerics]

Numerics controls

Performs a scaling of the objective and constraint functions based on their values at the initial point.
[ Knitro, Numerics]
Value returned by a divide-by-zero in a formula
[ Numerics]
Alternative LP level control values for numerically challengeing problems
[ Linearizations, Numerics, SLP]
When to re-scale the SLP problem
[ Numerics, SLP]
Iteration limit used in determining when to re-scale the SLP matrix
[ 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]
Determines if the parallel features of SLP should be guaranteed to be deterministic
[ MISLP, Parallel, SLP]
The maximum number of threads to be used in multistart
[ Multistart, Parallel]
Default number of threads to be used
[ Parallel]
Defines if user functions are allowed to be called in parallel
[ Parallel, User Functions]

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]
Determine whether or not to use the Knitro presolver to try to simplify the model by removing variables or constraints.
[ Knitro, Presolve]
Determines the tolerance used by the Knitro presolver to remove variables and constraints from the model.
[ Knitro, Presolve, Tolerances]
The maximum size of a bound that can be introduced by nonlinear presolve.
[ Presolve, SLP]
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]
Tolerance for nonlinear eliminations during SLP presolve
[ Presolve, Tolerances]
This control determines the level of changes presolve may carry out on the problem and whether column/row indices may change
[ Presolve]
Bitmap indicating the SLP presolve actions to be taken
[ Bit-vector, 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 a single matrix coefficient as a formula split into tokens.
[ 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 coefficients into the SLP problem.
[ Problem Information, SLP]
Load non-linear formulas into the SLP problem
[ Problem Information]
Write the current problem to a file in extended MPS or text format
[ File IO, Problem Information]

Problem Information attributes

Number of nonlinear coefficients
[ Problem Information, SLP]
Number of delta vectors created during augmentation
[ Problem Information, SLP]
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 SLP variables appearing only in coefficients
[ Problem Information, SLP]
Number of variables set up with an integer delta in the problem
[ Problem Information, SLP]
Number of negative penalty error vectors
[ 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]
Index of column costing the penalty delta row
[ Problem Information, SLP]
Index of equality row holding the penalties for delta vectors
[ Problem Information, SLP]
Number of penalty delta vectors
[ Problem Information, SLP]
Index of column costing the penalty error row
[ Problem Information, SLP]
Index of equality row holding the penalties for penalty error vectors
[ Problem Information, SLP]
Number of penalty error vectors
[ Problem Information, SLP]
Number of positive penalty error vectors
[ Problem Information, SLP]
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 coefficients to the SLP problem.
[ 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]
Changes the type of the delta assigned to a nonlinear variable
[ Problem Modification, SLP]
Add or replace a single matrix formula using a parsed or unparsed formula
[ Problem Modification]
Delete coefficients from the current problem.
[ Problem Modification, SLP]
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

Restore the Xpress NonLinear problem from a file created by XSLPsave
[ File IO, Save Restore]
Save the Xpress NonLinear problem to file
[ File IO, Save Restore]
Save the Xpress NonLinear problem to a named file
[ File IO, Save Restore]

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]
Add non-linear coefficients to the SLP problem.
[ Problem Modification, SLP]
Re-calculate consistent values for SLP variables based on the current values of the remaining variables.
[ Cascading, SLP, Solution Process]
Establish a re-calculation sequence for SLP variables with determining rows.
[ Data Input, SLP]
Set a variable specific cascade iteration limit
[ Data Input, SLP]
Add or change a single matrix coefficient using a parsed or unparsed formula.
[ Problem Modification, SLP]
Changes the type of the delta assigned to a nonlinear variable
[ Problem Modification, SLP]
Change the status setting of a constraint
[ Bit-vector, Data Input, SLP]
Set or change the initial penalty error weight for a row
[ Data Input, SLP]
Create the full augmented SLP matrix and data structures, ready for optimization
[ SLP, Solution Process]
Delete coefficients from the current problem.
[ Problem Modification, SLP]
Retrieve a single matrix coefficient as a formula split into tokens.
[ Problem Information, SLP]
Retrieve the list of positions of the nonlinear coefficients in the problem.
[ Problem Information, SLP]
Get current column information.
[ SLP, Solution]
Get current row information.
[ SLP, Solution]
Retrieve the status setting of a constraint
[ Bit-vector, SLP, Solution]
Get the initial penalty error weight for a row
[ Data Information, SLP]
Load non-linear coefficients into the SLP problem.
[ Problem Information, SLP]
Reset the SLP problem to match a just augmented system
[ SLP, Solution Process]
Set a user callback to be called at the end of the cascading process, after the last variable has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called at the start of the cascading process, before any variables have been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after each column has been cascaded
[ Callback, Cascading, SLP]
Set a user callback to be called after cascading a column was not successful
[ Callback, Cascading, SLP]
Set a user callback to be called during the Xpress-SLP augmentation process
[ Callback, SLP]
Set a user callback used to override the update of variables with small determining column
[ Callback, Cascading, SLP]
Set a user callback to be called at the end of each SLP iteration
[ Callback, SLP]
Set a user callback to be called at the start of each SLP iteration
[ Callback, SLP]
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 after the nonlinear presolver has been applied.
[ Callback, SLP]
Set a user callback to be called before the linearization is updated
[ Callback, SLP]
Set a user callback to be called at the end of the SLP optimization
[ Callback, SLP]
Set a user callback to be called at the start of the SLP optimization
[ Callback, SLP]
Set the determining row of a variable
[ Cascading, Data Input, SLP]
Removes the augmentation and returns the problem to its pre-linearization state
[ SLP, Solution Process]
Updates the current linearization
[ SLP, Solution Process]

SLP controls

Bit map describing the SLP algorithm(s) to be used
[ Bit-vector, SLP]
Bit map activating additional options supporting model / solution path analysis
[ Bit-vector, Logging, SLP]
Absolute delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Bit map describing the SLP augmentation method(s) to be used
[ Bit-vector, SLP]
Frequency with which to save the model
[ Logging, SLP]
Default crossover activation behaviour for barrier start
[ Linearizations, SLP]
Number of initial SLP iterations using the barrier method
[ Limits, Linearizations, 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]
Controls behaviour when the barrier is used to solve the linearizations
[ Linearizations, SLP]
The maximum size of a bound that can be introduced by nonlinear presolve.
[ Presolve, SLP]
Bit map describing the cascading to be used
[ Cascading, SLP]
Maximum number of iterations for cascading with non-linear determining rows
[ Cascading, Limits, SLP]
Absolute cascading print tolerance
[ Cascading, Logging, SLP]
Relative cascading print tolerance
[ Cascading, Logging, SLP]
Shrink ratio used to impose strict convergence on variables converged in extended criteria only
[ SLP]
Absolute validation tolerance for applying XSLP_CLAMPSHRINK
[ SLP, Tolerances]
Relative validation tolerance for applying XSLP_CLAMPSHRINK
[ SLP, Tolerances]
Bit map describing which convergence tests should be carried out
[ Bit-vector, SLP, SLP-convergence]
Closure convergence tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Formatting string for creation of names for SLP delta vectors
[ Logging, SLP]
Maximum penalty cost multiplier for penalty delta vectors
[ SLP]
Position of first character of SLP variable name used to create name of delta vector
[ Logging, SLP]
Number of SLP iterations during which to apply XSLP_DELTA_Z
[ SLP]
Determines if the parallel features of SLP should be guaranteed to be deterministic
[ MISLP, Parallel, SLP]
Tolerance on DJ value for determining if a variable is at its step bound
[ SLP, 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]
The range around the previous value where variables are fixed in cascading if the determining column is below XSLP_DRCOLTOL.
[ Cascading, SLP]
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]
Position of first character of constraint name used to create name of penalty error vectors
[ Logging, SLP]
Absolute tolerance for error vectors
[ SLP, Tolerances]
Absolute tolerance for printing error vectors
[ SLP, Tolerances]
Factor for increasing cost multiplier on individual penalty error vectors
[ SLP]
Absolute tolerance on penalty vectors
[ SLP, Tolerances]
Relative tolerance on penalty vectors
[ SLP, Tolerances]
Absolute tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
Relative tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
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]
Bit map for controlling solution updates
[ Bit-vector, SLP, Solution]
Base for calculating penalty costs
[ SLP]
Bit map selectin which heuristics to run if the problem has variable with an integer delta
[ Heuristics, SLP]
Branch and Bound: This specifies the MINLP heuristic strategy.
[ Heuristics, SLP]
The maximum number of consecutive infeasible SLP iterations which can occur before Xpress-SLP terminates
[ Limits, SLP]
Alternative LP level control values for numerically challengeing problems
[ Linearizations, Numerics, SLP]
The maximum number of SLP iterations
[ Limits, SLP]
Absolute impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Level of printing during SLP iterations
[ Logging, SLP]
Number of iterations in the line search
[ Limits, SLP]
Number of iterations in the pattern search preceding the line search
[ Limits, SLP]
Iteration in which to active the line search
[ SLP]
Maximum number of zero length line search steps before line search is deactivated
[ Limits, SLP]
Nonzero tolerance for dropping coefficients from the linearization.
[ SLP]
Maximum penalty weight for delta or error vectors
[ SLP]
Factor by which the net objective is taken into account in the merit function
[ SLP, Solution]
Factor by which step bounds can be decreased beneath XSLP_ATOL_A
[ SLP]
Formatting string for creation of names for SLP negative penalty delta vectors
[ Logging, SLP]
Formatting string for creation of names for SLP negative penalty error vectors
[ Logging, SLP]
Minimum penalty weight for delta or error vectors
[ SLP]
Absolute effective matrix element convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative effective matrix element convergence tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Absolute static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Formatting string for creation of the names of the SLP penalty transfer vectors
[ Logging, SLP]
Iteration from which to record row penalty information
[ Logging, SLP]
Formatting string for creation of the names of the SLP penalty rows
[ Logging, SLP]
Formatting string for creation of names for SLP positive penalty delta vectors
[ Logging, SLP]
Formatting string for creation of names for SLP positive penalty error vectors
[ Logging, SLP]
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]
Formatting string for creation of names for SLP lower step bound rows
[ Logging, SLP]
Name of the set of initial step bounds to be used
[ Logging, SLP]
Position of first character of SLP variable name used to create name of SLP lower and upper step bound rows
[ Logging, SLP]
SLP iteration after which step bounds are first applied
[ SLP]
Formatting string for creation of names for SLP upper step bound rows
[ Logging, SLP]
When to re-scale the SLP problem
[ Numerics, SLP]
Iteration limit used in determining when to re-scale the SLP matrix
[ Numerics, SLP]
Multiplier to reduce a step bound
[ SLP]
Defines an overwrite / adjustment of step bounds for improving iterations
[ SLP]
Frequency with which SLP status is printed
[ Logging, SLP]
Absolute slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Stop optimization and return error code if internal function argument is out of range
[ SLP]
Name of the set of tolerance sets to be used
[ File IO, SLP]
Mask of variable or row names that are to be traced through the SLP iterates
[ Logging, SLP]
Controls the information printed for XSLP_TRACEMASK.
[ Bit-vector, Logging, SLP]
The number of consecutive SLP iterations that may have an unfinished status before the solve is terminated.
[ Linearizations, SLP]
Formatting string for creation of names for SLP update rows
[ Logging, SLP]
Position of first character of SLP variable name used to create name of SLP update row
[ Logging, SLP]
Minimum improvement in validation targets to continue iterating
[ SLP, SLP-convergence, Tolerances]
Optimality target tolerance
[ SLP, SLP-convergence, Tolerances]
Feasiblity target tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute tolerance for the XSLPvalidate procedure
[ SLP, Tolerances]
Relative tolerance for the XSLPvalidatekkt procedure
[ SLP, Tolerances]
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]
Absolute static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
[ SLP, SLP-convergence]
Absolute extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
Relative extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Absolute static objective function (1) tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective function (1) tolerance
[ SLP, SLP-convergence, Tolerances]
Bitmap determining the behavior of the placeholder deletion procedure
[ Bit-vector, SLP]
Number of consecutive times a placeholder entry is zero before being considered for deletion
[ Limits, SLP]
SLP iteration at which criteria for deletion of placeholder entries are first activated.
[ SLP]

SLP attributes

Number of nonlinear coefficients
[ Problem Information, SLP]
Current value of penalty cost multiplier for penalty delta vectors
[ SLP, Solution]
Current value of penalty cost multiplier for penalty error vectors
[ SLP, Solution]
Number of delta vectors created during augmentation
[ Problem Information, SLP]
Number of infeasible constraints found at the point of linearization
[ Linearizations, SLP]
Total penalty costs in the solution
[ SLP, Solution]
Number of variables with an exploration-type delta set up in the problem
[ Problem Information, SLP]
Number of SLP variables appearing only in coefficients
[ Problem Information, SLP]
Number of variables set up with an integer delta in the problem
[ Problem Information, SLP]
The iteration in which the returned solution has been found.
[ SLP, Solution]
Number of negative penalty error vectors
[ 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]
Index of column costing the penalty delta row
[ Problem Information, SLP]
Index of equality row holding the penalties for delta vectors
[ Problem Information, SLP]
Number of penalty delta vectors
[ Problem Information, SLP]
Total activity of penalty delta vectors
[ SLP, Solution]
Total penalty cost attributed to penalty delta vectors
[ SLP, Solution]
Index of column costing the penalty error row
[ Problem Information, SLP]
Index of equality row holding the penalties for penalty error vectors
[ Problem Information, SLP]
Number of penalty error vectors
[ Problem Information, SLP]
Total activity of penalty error vectors
[ SLP, Solution]
Total penalty cost attributed to penalty error vectors
[ SLP, Solution]
Number of positive penalty error vectors
[ Problem Information, SLP]
Number of step-bounded variables converged only on extended criteria
[ SLP, SLP-convergence]
Number of variables with a minimum perturbation step set up in the problem
[ Problem Information, SLP]
Number of unconverged variables with coefficients in constraining rows
[ SLP, SLP-convergence]
Number of unconverged values
[ SLP, SLP-convergence]
Number of SLP variables
[ Data Information, SLP]
Vertex solution index
[ SLP, Solution]
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

Absolute delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Bit map describing which convergence tests should be carried out
[ Bit-vector, SLP, SLP-convergence]
Closure convergence tolerance
[ SLP, SLP-convergence, 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]
Absolute tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
Relative tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
Absolute impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Number of SLP iterations at each node over which to measure objective function variation
[ MISLP, SLP-convergence]
Absolute objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
Relative objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
Absolute effective matrix element convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative effective matrix element convergence tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Absolute static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Minimum improvement in validation targets to continue iterating
[ SLP, SLP-convergence, Tolerances]
Optimality target tolerance
[ SLP, SLP-convergence, Tolerances]
Feasiblity target tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Absolute static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Number of SLP iterations over which to measure the objective for the extended convergence continuation criterion
[ SLP, SLP-convergence]
Absolute extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
Relative extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
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]
Absolute static objective function (1) tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective function (1) tolerance
[ SLP, SLP-convergence, Tolerances]

SLP-convergence attributes

Number of step-bounded variables converged only on extended criteria
[ SLP, SLP-convergence]
Number of unconverged variables with coefficients in constraining rows
[ SLP, SLP-convergence]
Number of unconverged values
[ SLP, SLP-convergence]

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]
Reset the SLP problem to match a just augmented system
[ SLP, Solution Process]
Removes the augmentation and returns the problem to its pre-linearization state
[ SLP, Solution Process]
Updates the current linearization
[ SLP, Solution Process]

Solution Process controls

Indicates which algorithm to use to solve the problem
[ Knitro, Solution Process]
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 MIP method to use.
[ 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]
Get current column information.
[ SLP, Solution]
Get current row information.
[ SLP, Solution]
Retrieve the status setting of a constraint
[ Bit-vector, SLP, 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]
Write the current solution to an MPS like file format
[ File IO, Solution]

Solution controls

Bit map for controlling solution updates
[ Bit-vector, SLP, Solution]
Factor by which the net objective is taken into account in the merit function
[ SLP, Solution]

Solution attributes

Current value of penalty cost multiplier for penalty delta vectors
[ SLP, Solution]
Current value of penalty cost multiplier for penalty error vectors
[ SLP, Solution]
Total penalty costs in the solution
[ SLP, Solution]
The iteration in which the returned solution has been found.
[ SLP, Solution]
Number of integer solutions found in MISLP.
[ MISLP, Solution]
Objective function value excluding any penalty costs
[ Solution]
Total activity of penalty delta vectors
[ SLP, Solution]
Total penalty cost attributed to penalty delta vectors
[ SLP, Solution]
Total activity of penalty error vectors
[ SLP, Solution]
Total penalty cost attributed to penalty error vectors
[ SLP, 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]
Vertex solution index
[ SLP, 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 final relative stopping tolerance for the feasibility error.
[ Knitro, Tolerances]
Specifies the final absolute stopping tolerance for the feasibility error.
[ 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]
The absolute integrality gap stop tolerance for MIP.
[ Knitro, Knitro-MINLP, Tolerances]
The relative integrality gap stop tolerance for MIP.
[ 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 delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative delta convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute tolerance for deducing constant derivatives
[ Tolerances]
Relative tolerance for deducing constant derivatives
[ Tolerances]
Absolute validation tolerance for applying XSLP_CLAMPSHRINK
[ SLP, Tolerances]
Relative validation tolerance for applying XSLP_CLAMPSHRINK
[ SLP, Tolerances]
Closure convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Tolerance used when calculating derivatives
[ Derivatives, Tolerances]
Absolute zero acceptance tolerance used when calculating derivatives
[ Derivatives, Tolerances]
Tolerance on DJ value for determining if a variable is at its step bound
[ SLP, 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]
Absolute tolerance for error vectors
[ SLP, Tolerances]
Absolute tolerance for printing error vectors
[ SLP, Tolerances]
Absolute tolerance on penalty vectors
[ SLP, Tolerances]
Relative tolerance on penalty vectors
[ SLP, Tolerances]
Absolute tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
Relative tolerance on total penalty costs
[ SLP, SLP-convergence, Tolerances]
When set, this defines a target feasibility tolerance to which the linearizations are solved to
[ Linearizations, SLP, Tolerances]
Absolute impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative impact convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute objective function cutoff for MIP termination
[ MISLP, Tolerances]
Absolute objective function cutoff for MIP termination
[ MISLP, Tolerances]
Absolute penalty error cost tolerance for MIP cut-off
[ MISLP, Tolerances]
Relative penalty error cost tolerance for MIP cut-off
[ MISLP, Tolerances]
Absolute objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
Relative objective function tolerance for MIP termination
[ MISLP, SLP-convergence, Tolerances]
Absolute effective matrix element convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative effective matrix element convergence tolerance
[ SLP, SLP-convergence, 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]
Absolute static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (2) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Tolerance for nonlinear eliminations during SLP presolve
[ Presolve, Tolerances]
Minimum absolute value for a variable which is identified as nonzero during SLP presolve
[ Presolve, Tolerances]
Absolute slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative slack convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Minimum improvement in validation targets to continue iterating
[ SLP, SLP-convergence, Tolerances]
Optimality target tolerance
[ SLP, SLP-convergence, Tolerances]
Feasiblity target tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute tolerance for the XSLPvalidate procedure
[ SLP, Tolerances]
Relative tolerance for the XSLPvalidatekkt procedure
[ SLP, Tolerances]
Relative tolerance for the XSLPvalidate procedure
[ Tolerances]
Absolute static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective (3) convergence tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
Relative extended convergence continuation tolerance
[ SLP, SLP-convergence, Tolerances]
Absolute static objective function (1) tolerance
[ SLP, SLP-convergence, Tolerances]
Relative static objective function (1) tolerance
[ SLP, SLP-convergence, 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]
Defines if user functions are allowed to be called in parallel
[ Parallel, 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.