If , you must supply lsqmon which is suitable for monitoring the minimization process. lsqmon must not change the values of any of its parameters.
If , the dummy method E04FDZ can be used as lsqmon.
Syntax
C# |
---|
public delegate void E04FC_LSQMON( int m, int n, double[] xc, double[] fvec, double[,] fjac, double[] s, int igrade, int niter, int nf ) |
Visual Basic |
---|
Public Delegate Sub E04FC_LSQMON ( _ m As Integer, _ n As Integer, _ xc As Double(), _ fvec As Double(), _ fjac As Double(,), _ s As Double(), _ igrade As Integer, _ niter As Integer, _ nf As Integer _ ) |
Visual C++ |
---|
public delegate void E04FC_LSQMON( int m, int n, array<double>^ xc, array<double>^ fvec, array<double,2>^ fjac, array<double>^ s, int igrade, int niter, int nf ) |
F# |
---|
type E04FC_LSQMON = delegate of m : int * n : int * xc : float[] * fvec : float[] * fjac : float[,] * s : float[] * igrade : int * niter : int * nf : int -> unit |
Parameters
- m
- Type: System..::..Int32On entry: , the numbers of residuals.
- n
- Type: System..::..Int32On entry: , the numbers of variables.
- xc
- Type: array<System..::..Double>[]()[][]On entry: the coordinates of the current point .
- fvec
- Type: array<System..::..Double>[]()[][]On entry: the values of the residuals at the current point .
- fjac
- Type: array<System..::..Double,2>[,](,)[,][,]On entry: contains the value of at the current point , for and .
- s
- Type: array<System..::..Double>[]()[][]On entry: the singular values of the current approximation to the Jacobian matrix. Thus s may be useful as information about the structure of your problem.
- igrade
- Type: System..::..Int32On entry: e04fc estimates the dimension of the subspace for which the Jacobian matrix can be used as a valid approximation to the curvature (see Gill and Murray (1978)). This estimate is called the grade of the Jacobian matrix, and igrade gives its current value.
- niter
- Type: System..::..Int32On entry: the number of iterations which have been performed in e04fc.
- nf
- Type: System..::..Int32On entry: the number of times that lsqfun has been called so far. (However, for intermediate calls of lsqmon, nf is calculated on the assumption that the latest linear search has been successful. If this is not the case, then the evaluations allowed for approximating the Jacobian at the new point will not in fact have been made. nf will be accurate at the final call of lsqmon.)