•
|
Click the Scroll Lock button () to stop the window from scrolling the log during a solver call, for example.
|
•
|
Click the Scroll Lock button again to resume scrolling.
|
•
|
To change the size of the buffer, go to the Preferences dialog box, choose the General page, and, under Log and messages, then enter a maximum buffer size (in characters) in the Log window size (characters) field. The default is 300,000 characters. This buffer size also applies to the Log stored in the solvers for the last run.
|
•
|
The iteration number (Iter).
|
-
|
The solution error (SolEst), if Solution is selected from the Termination criterion list for the solver.
|
-
|
The residual error (ResEst), if Residual is selected from the Termination criterion list for the solver.
|
-
|
Both the solution error and the residual error (SolEst and ResEst), if Solution or residual or Solution and residual is selected from the Termination criterion list for the solver. The convergence is then based on the minimum of the solution error or the residual error multiplied by the residual factor.
|
•
|
•
|
The size of the undamped Newton step (Stepsize) in the error estimate norm.
|
•
|
The numbers of residuals (#Res), Jacobians (#Jac), and linear-system solutions computed (#Sol) so far.
|
•
|
The time step number (Step).
|
•
|
•
|
The step size (Stepsize).
|
•
|
•
|
•
|
The number of minor iterations for the current major iteration (Minor). This value should be 1 when the solver is close to the solution.
|
•
|
The step length taken in the current search direction (Step). This value should be 1 when the solver is close to the solution.
|
•
|
The maximum complementarity gap (Error). It is an estimate of the degree of nonoptimality of the reduced costs. For convergence, this value should be smaller than the Optimality tolerance.
|
•
|
•
|
The cumulative number of outer iterations (Iter). One outer iteration per line is reported in the log.
|
•
|
The number of inner iterations for the current outer iteration (Inner). This is the number of attempts needed to find a conservative approximating subproblem, which in some sense measures the nonlinearity of the problem.
|
•
|
The cumulative number of model evaluations (nPDE). Each inner iteration requires a model evaluation in order to check the conservativeness of the approximation. Gradients are only computed once for each outer iteration.
|
•
|
The estimated error (Error). The error is defined as the maximum relative change in any control variable since last outer iteration, computed as a percentage of the distance between the control variable’s bounds.
|
•
|
•
|
The maximum violation of any constraint (MaxInfeas). For a feasible solution, this number must be zero. It may be nonzero in the first outer iterations if the initial guess is infeasible.
|
•
|
The current Levenberg-Marquardt factor (lmFact). A small factor typically indicates fast convergence.
|
•
|
The estimated error based on the gradient, the objective function, and the control variables (Error). For convergence, this value should be smaller than the Optimality tolerance.
|
•
|