findopOptions

R2026b

Option set for findop

Syntax

opt = findopOptions(model)

opt = findopOptions(model,Name,Value)

Description

opt = findopOptions(model) creates a default option set for computing the operating point of a specified nonlinear ARX or Hammerstein-Wiener model. Use dot notation to modify this option set for your specific application. Options that you do not modify retain their default values.

opt = findopOptions(model,Name,Value) creates an option set with options specified by one or more Name,Value pair arguments.

Examples

Create Default Option Set for Operating Point Search

Create a default option set for findop using an idnlarx model.

opt = findopOptions(idnlarx);

Create and Modify Default Operating Point Search Options

Create a default option set for findop using an idnlhw model.

opt = findopOptions(idnlhw);

Use dot notation to specify a subspace Gauss-Newton least squares search with a maximum of 25 iterations.

opt.SearchMethod = 'gn';
opt.SearchOptions.MaxIterations = 25;

Specify Options for Operating Point Search

Create an option set for findop using an idnlarx model. Specify a steepest descent least squares search with default search options.

opt = findopOptions(idnlarx,'SearchMethod','grad');

Input Arguments

model — Estimated nonlinear model

idnlarx model | idnlhw model

Estimated nonlinear model, specified as one of the following:

• idnlarx model

• idnlhw model

Name-Value Arguments

Specify optional pairs of arguments as Name1=Value1,...,NameN=ValueN, where Name is the argument name and Value is the corresponding value. Name-value arguments must appear after other arguments, but the order of the pairs does not matter.

Before R2021a, use commas to separate each name and value, and enclose Name in quotes.

Example: 'SearchMethod','grad' specifies a steepest descent least squares search method

SearchMethod — Numerical search method used for iterative parameter estimation

'auto' (default) | 'gn' | 'gna' | 'lm' | 'grad' | 'lsqnonlin' | 'patternsearch' | 'fmincon' | 'adam' | 'sgdm' | 'lbfgs'

Numerical search method used for iterative parameter estimation, specified as the one of the values in the following table.

SearchMethod	Description
'auto'	Automatic method selection A combination of the line search algorithms, 'gn', 'lm', 'gna', and 'grad', is tried in sequence at each iteration. The first descent direction leading to a reduction in estimation cost is used.
'gn'	Subspace Gauss-Newton least-squares search Singular values of the Jacobian matrix less than GnPinvConstant*eps*max(size(J))*norm(J) are discarded when computing the search direction. J is the Jacobian matrix. The Hessian matrix is approximated as JTJ. If this direction shows no improvement, the function tries the gradient direction.
'gna'	Adaptive subspace Gauss-Newton search Eigenvalues less than gamma*max(sv) of the Hessian are ignored, where sv contains the singular values of the Hessian. The Gauss-Newton direction is computed in the remaining subspace. gamma has the initial value InitialGnaTolerance (see Advanced in 'SearchOptions' for more information). This value is increased by the factor LMStep each time the search fails to find a lower value of the criterion in fewer than five bisections. This value is decreased by the factor 2*LMStep each time a search is successful without any bisections.
'lm'	Levenberg-Marquardt least squares search Each parameter value is -pinv(H+d*I)*grad from the previous value. H is the Hessian, I is the identity matrix, and grad is the gradient. d is a number that is increased until a lower value of the criterion is found. This algorithm requires Optimization Toolbox™ software.
'grad'	Steepest descent least-squares search
'lsqnonlin'	Trust-region-reflective algorithm of lsqnonlin (Optimization Toolbox) This algorithm requires Optimization Toolbox software.
'patternsearch'	Solver for nonlinearities without well-defined gradients You can use the patternsearch (Global Optimization Toolbox) solver to find the minimum of a nonlinear function that does not have a well-defined gradient. This solver requires Global Optimization Toolbox software.
'fmincon'	Constrained nonlinear solvers You can use the sequential quadratic programming (SQP) and trust-region-reflective algorithms of the fmincon (Optimization Toolbox) solver. If you have Optimization Toolbox software, you can also use the interior-point and active-set algorithms of the fmincon solver. Specify the algorithm in the SearchOptions.Algorithm option. The fmincon algorithms might result in improved estimation results in the following scenarios: Constrained minimization problems when bounds are imposed on the model parameters. Model structures where the loss function is a nonlinear or nonsmooth function of the parameters. Multiple-output model estimation. A determinant loss function is minimized by default for multiple-output model estimation. fmincon algorithms are able to minimize such loss functions directly. The other search methods such as 'lm' and 'gn' minimize the determinant loss function by alternately estimating the noise variance and reducing the loss value for a given noise variance value. Hence, the fmincon algorithms can offer better efficiency and accuracy for multiple-output model estimations.
'adam'	Adaptive moment estimation (Adam) Adam is a first-order adaptive gradient solver. It supports mini-batch operation when data is segmented into multiple frames or batches. For more information, see Adaptive Moment Estimation (Deep Learning Toolbox).
'sgdm'	Stochastic gradient descent with momentum (SGDM) SGDM is a first-order momentum-based gradient solver. It supports mini-batch operation when data is segmented into multiple frames or batches. For more information, see Stochastic Gradient Descent with Momentum (Deep Learning Toolbox).
'lbfgs'	Limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) L-BFGS is a quasi-Newton solver that approximates the inverse Hessian using a limited history of curvature pairs. For more information, see Limited-Memory BFGS (Deep Learning Toolbox).

SearchOptions — Option set for the search algorithm

search option set

Option set for the search algorithm, specified as the comma-separated pair consisting of 'SearchOptions' and a search option set with fields that depend on the value of SearchMethod.

SearchOptions Structure When SearchMethod Is Specified as 'gn', 'gna', 'lm', 'grad', or 'auto'

Field Name	Description	Default
Tolerance	Minimum percentage difference between the current value of the loss function and its expected improvement after the next iteration, specified as a positive scalar. When the percentage of expected improvement is less than Tolerance, the iterations stop. The estimate of the expected loss-function improvement at the next iteration is based on the Gauss-Newton vector computed for the current parameter value.	0.01
MaxIterations	Maximum number of iterations during loss-function minimization, specified as a positive integer. The iterations stop when MaxIterations is reached or another stopping criterion is satisfied, such as Tolerance. Setting MaxIterations = 0 returns the result of the start-up procedure. Use sys.Report.Termination.Iterations to get the actual number of iterations during an estimation, where sys is an idtf model.	20
Advanced	Advanced search settings, specified as a structure with the following fields. Field Name Description Default GnPinvConstant Jacobian matrix singular value threshold, specified as a positive scalar. Singular values of the Jacobian matrix that are smaller than GnPinvConstant*max(size(J)*norm(J)*eps) are discarded when computing the search direction. Applicable when SearchMethod is 'gn'. 10000 InitialGnaTolerance Initial value of gamma, specified as a positive scalar. Applicable when SearchMethod is 'gna'. 0.0001 LMStartValue Starting value of search-direction length d in the Levenberg-Marquardt method, specified as a positive scalar. Applicable when SearchMethod is 'lm'. 0.001 LMStep Size of the Levenberg-Marquardt step, specified as a positive integer. The next value of the search-direction length d in the Levenberg-Marquardt method is LMStep times the previous one. Applicable when SearchMethod is 'lm'. 2 MaxBisections Maximum number of bisections used for line search along the search direction, specified as a positive integer. 25 MaxFunctionEvaluations Maximum number of calls to the model file, specified as a positive integer. Iterations stop if the number of calls to the model file exceeds this value. Inf MinParameterChange Smallest parameter update allowed per iteration, specified as a nonnegative scalar. 0 RelativeImprovement Relative improvement threshold, specified as a nonnegative scalar. Iterations stop if the relative improvement of the criterion function is less than this value. 0 StepReduction Step reduction factor, specified as a positive scalar that is greater than 1. The suggested parameter update is reduced by the factor StepReduction after each try. This reduction continues until MaxBisections tries are completed or a lower value of the criterion function is obtained. StepReduction is not applicable for a SearchMethod of 'lm' (Levenberg-Marquardt method). 2

SearchOptions Structure When SearchMethod Is Specified as 'lsqnonlin'

Field Name	Description	Default
FunctionTolerance	Termination tolerance on the loss function that the software minimizes to determine the estimated parameter values, specified as a positive scalar. The value of FunctionTolerance is the same as that of opt.SearchOptions.Advanced.TolFun.	1e-5
StepTolerance	Termination tolerance on the estimated parameter values, specified as a positive scalar. The value of StepTolerance is the same as that of opt.SearchOptions.Advanced.TolX.	1e-6
MaxIterations	Maximum number of iterations during loss-function minimization, specified as a positive integer. The iterations stop when MaxIterations is reached or another stopping criterion is satisfied, such as FunctionTolerance. The value of MaxIterations is the same as that of opt.SearchOptions.Advanced.MaxIter.	20

SearchOptions Structure When SearchMethod Is Specified as 'patternsearch'

Field Name	Description	Default
Algorithm	patternsearch optimization algorithm, specified as one of these values: 'classic' 'nups' 'nups-gps' 'nups-mads' For algorithm details, see How Pattern Search Polling Works (Global Optimization Toolbox) and Nonuniform Pattern Search (NUPS) Algorithm (Global Optimization Toolbox). For examples of algorithm effects, see Explore patternsearch Algorithms (Global Optimization Toolbox) and Explore patternsearch Algorithms in Optimize Live Editor Task (Global Optimization Toolbox).	'nups'
FunctionTolerance	Termination tolerance on the loss function that the software minimizes to determine the estimated parameter values, specified as a positive scalar.	1e-6
StepTolerance	Termination tolerance on the estimated parameter values, specified as a positive scalar.	1e-6
MaxIterations	Maximum number of iterations during loss function minimization, specified as a positive integer. The iterations stop when MaxIterations is reached or another stopping criterion is satisfied, such as FunctionTolerance.	'100*numberOfVariables', where numberOfVariables is the number of problem variables
UseParallel	Option to enable or disable parallel processing for improved performance, specified as one of these values: "off" — Run in serial on the MATLAB® client. "auto" — Use a parallel pool if one is open or if MATLAB can automatically create one. If a parallel pool is not available, run in serial on the MATLAB client. "on" — Use a parallel pool if one is open or if MATLAB can automatically create one. If a parallel pool is not available, throw an error. If you do not have a parallel pool open and automatic pool creation is enabled, MATLAB opens a pool using the default cluster profile. To use a parallel pool to run computations in MATLAB, you must have Parallel Computing Toolbox™. Before R2026b: To run in parallel, set UseParallel to true.	"off"

SearchOptions Structure When SearchMethod Is Specified as 'fmincon'

Field Name	Description	Default
Algorithm	fmincon optimization algorithm, specified as one of the following: 'sqp' — Sequential quadratic programming algorithm. The algorithm satisfies bounds at all iterations, and it can recover from NaN or Inf results. It is not a large-scale algorithm. For more information, see Sparsity in Optimization Algorithms (Optimization Toolbox). 'trust-region-reflective' — Subspace trust-region method based on the interior-reflective Newton method. It is a large-scale algorithm. 'interior-point' — Large-scale algorithm that requires Optimization Toolbox software. The algorithm satisfies bounds at all iterations, and it can recover from NaN or Inf results. 'active-set' — Requires Optimization Toolbox software. The algorithm can take large steps, which adds speed. It is not a large-scale algorithm. For more information about the algorithms, see Constrained Nonlinear Optimization Algorithms (Optimization Toolbox) and Choosing the Algorithm (Optimization Toolbox).	'sqp'
FunctionTolerance	Termination tolerance on the loss function that the software minimizes to determine the estimated parameter values, specified as a positive scalar.	1e-6
StepTolerance	Termination tolerance on the estimated parameter values, specified as a positive scalar.	1e-6
MaxIterations	Maximum number of iterations during loss function minimization, specified as a positive integer. The iterations stop when MaxIterations is reached or another stopping criterion is satisfied, such as FunctionTolerance.	100

SearchOptions Structure When SearchMethod Is Specified as 'adam'

Field Name	Description	Default
LearnRate	Learning rate, or the step size, used for training, specified as a positive scalar. If the learning rate is too small, then training can take a long time. If the learning rate is too large, then training can be fast but it might reach a suboptimal result, diverge, or oscillate. The learning rate is denoted by α in the Adaptive Moment Estimation (Deep Learning Toolbox) section. If you specify LearnRateSchedule as "piecewise", then LearnRate is the learning rate before any scheduled drops.	0.001
GradientDecayFactor	Exponential decay rate of gradient moving average for the Adam solver, specified as a positive scalar less than 1. It controls the smoothing of the exponentially decaying average of past gradients. The gradient decay rate is denoted by β1 in the Adaptive Moment Estimation (Deep Learning Toolbox) section. If the value of GradientDecayFactor is closer to 1, then the smoothing increases. If the value of GradientDecayFactor is closer to 0, then recent gradients have more impact on the training.	0.9
SquaredGradientDecayFactor	Exponential decay rate of squared gradient moving average for the Adam solver, specified as a positive scalar less than 1. It controls the smoothing of the exponentially decaying average of past squared gradients. The squared gradient decay rate is denoted by β2 in the Adaptive Moment Estimation (Deep Learning Toolbox) section. Larger values of SquaredGradientDecayFactor adapt more slowly but provide a more stable variance estimate.	0.999
Epsilon	Small constant for numerical stability, specified as a positive scalar. To avoid division by zero when updating network parameters, the solver adds this constant to the denominator. Epsilon is denoted by ϵ in the Adaptive Moment Estimation (Deep Learning Toolbox) section.	1e-8
MaxEpochs	Maximum number of parameter updates or iterations to use for training, specified as a nonnegative integer. If you specify MaxEpochs as 0, the software disables iterations and only runs initialization or post-processing.	200
MaxFunctionEvaluations	Maximum number of objective function evaluations, specified as a positive integer.	intmax
LearnRateSchedule	Learning rate schedule type, specified as "none" or "piecewise". "none" — No learning rate schedule. This schedule keeps the learning rate constant and equal to LearnRate. "piecewise" — Piecewise learning rate schedule. This schedule multiplies the learning rate by LearnRateDropFactor every LearnRateDropPeriod number of iterations.	"none"
LearnRateDropFactor	Multiplicative factor for dropping the learning rate, specified as a positive scalar less than or equal to 1. You can specify this option only when you specify the LearnRateSchedule training option as "piecewise". The software multiplies the learning rate with the factor specified by LearnRateDropFactor every time a certain number of iterations passes. Specify the number of iterations using the LearnRateDropPeriod training option.	0.1
LearnRateDropPeriod	Number of iterations in between learning rate drops, specified as a positive integer. You can specify this option only when you specify the LearnRateSchedule training option as "piecewise". The software multiplies the learning rate with the drop factor every time the number of iterations specified by LearnRateDropPeriod passes. Specify the drop factor using the LearnRateDropFactor training option.	10
MinCostValue	Target objective value, specified as a nonnegative scalar. If the objective value at the current iteration is less than or equal to MinCostValue, the training stops.	0
ModelSelection	Iteration used to return the model parameters, specified as "best" or "last". If you specify ModelSelection as "best", the software returns the parameters corresponding to the iteration with the lowest objective value. If you specify ModelSelection as "last", the software returns the parameters corresponding to the final iteration.	"best"
Advanced	Structure used to specify advanced search options consisting of these fields:
	WeightDecay — Strength of L2 regularization applied to learnable parameters, specified as a nonnegative scalar. If WeightDecay>0 and UseDecoupledWeightDecay=1, weight decay is applied in a decoupled manner before update computations. If WeightDecay>0 and UseDecoupledWeightDecay=0, classical L2 regularization is applied by augmenting gradients before update computations. To disable this option, specify WeightDecay as 0.	0
	UseDecoupledWeightDecay — Flag to control whether weight decay is applied directly to parameters or is folded into the gradient as L2 penalty, specified as a logical scalar. If UseDecoupledWeightDecay=1, decoupled weight decay is applied directly. If UseDecoupledWeightDecay=0, L2 penalty term is added to the gradient. Decoupling prevents regularization strength from being implicitly modulated by momentum dynamics.	1
	ClipGradNorm — Maximum allowed L2 norm of the flattened gradient vector, specified as a nonnegative scalar. If the gradient norm exceeds this value, the gradient is rescaled. This rescaling helps prevent unstable updates when gradients spike, such as in recurrent models or stiff dynamical systems. To disable this option, specify ClipGradNorm as 0.	0
	NormEpsilon — Small constant used to avoid division by zero and underflow when computing safe norms and normalized quantities, especially when ClipGradNorm is enabled, specified as a positive scalar.	1e-12

SearchOptions Structure When SearchMethod Is Specified as 'sgdm'

Field Name	Description	Default
LearnRate	Learning rate, or the step size, used for training, specified as a positive scalar. If the learning rate is too small, then training can take a long time. If the learning rate is too large, then training can be fast but it might reach a suboptimal result, diverge, or oscillate. The learning rate is denoted by α in the Stochastic Gradient Descent with Momentum (Deep Learning Toolbox) section. If you specify LearnRateSchedule as "piecewise", then LearnRate is the learning rate before any scheduled drops.	0.01
Momentum	Momentum coefficient, specified as a positive scalar less than or equal to 1. This coefficient controls the contribution of the previous gradient step to the current iteration. The momentum coefficient is denoted by γ in the Stochastic Gradient Descent with Momentum (Deep Learning Toolbox) section. If the value of Momentum is closer to 1, then the smoothing increases. If the value of Momentum is closer to 0, then the solver behaves closer to the stochastic gradient descent algorithm.	0.95
MaxEpochs	Maximum number of parameter updates or iterations to use for training, specified as a nonnegative integer. If you specify MaxEpochs as 0, the software disables iterations and only runs initialization or post-processing.	200
MaxFunctionEvaluations	Maximum number of objective function evaluations, specified as a positive integer.	intmax
LearnRateSchedule	Learning rate schedule type, specified as "none" or "piecewise". "none" — No learning rate schedule. This schedule keeps the learning rate constant and equal to LearnRate. "piecewise" — Piecewise learning rate schedule. This schedule multiplies the learning rate by LearnRateDropFactor every LearnRateDropPeriod number of iterations.	"none"
LearnRateDropFactor	Multiplicative factor for dropping the learning rate, specified as a positive scalar less than or equal to 1. You can specify this option only when you specify the LearnRateSchedule training option as "piecewise". The software multiplies the learning rate with the factor specified by LearnRateDropFactor every time a certain number of iterations passes. Specify the number of iterations using the LearnRateDropPeriod training option.	0.1
LearnRateDropPeriod	Number of iterations in between learning rate drops, specified as a positive integer. You can specify this option only when you specify the LearnRateSchedule training option as "piecewise". The software multiplies the learning rate with the drop factor every time the number of iterations specified by LearnRateDropPeriod passes. Specify the drop factor using the LearnRateDropFactor training option.	10
MinCostValue	Target objective value, specified as a nonnegative scalar. If the objective value at the current iteration is less than or equal to MinCostValue, the training stops.	0
ModelSelection	Iteration used to return the model parameters, specified as "best" or "last". If you specify ModelSelection as "best", the software returns the parameters corresponding to the iteration with the lowest objective value. If you specify ModelSelection as "last", the software returns the parameters corresponding to the final iteration.	"best"
Advanced	Structure used to specify advanced search options consisting of these fields:
	WeightDecay — Strength of L2 regularization applied to learnable parameters, specified as a nonnegative scalar. If WeightDecay>0 and UseDecoupledWeightDecay=1, weight decay is applied in a decoupled manner before update computations. If WeightDecay>0 and UseDecoupledWeightDecay=0, classical L2 regularization is applied by augmenting gradients before update computations. To disable this option, specify WeightDecay as 0.	0
	UseDecoupledWeightDecay — Flag to control whether weight decay is applied directly to parameters or is folded into the gradient as L2 penalty, specified as a logical scalar. If UseDecoupledWeightDecay=1, decoupled weight decay is applied directly. If UseDecoupledWeightDecay=0, L2 penalty term is added to the gradient. Decoupling prevents regularization strength from being implicitly modulated by momentum dynamics.	1
	ClipGradNorm — Maximum allowed L2 norm of the flattened gradient vector, specified as a nonnegative scalar. If the gradient norm exceeds this value, the gradient is rescaled. This rescaling helps prevent unstable updates when gradients spike, such as in recurrent models or stiff dynamical systems. To disable this option, specify ClipGradNorm as 0.	0
	NormEpsilon — Small constant used to avoid division by zero and underflow when computing safe norms and normalized quantities, especially when ClipGradNorm is enabled, specified as a positive scalar.	1e-12

SearchOptions Structure When SearchMethod Is Specified as 'lbfgs'

Field Name	Description	Default
MaxIterations	Maximum number of quasi-Newton iterations to use for training, specified as a nonnegative integer. Each iteration forms a search direction using the stored curvature pairs and then performs a line search. If you specify MaxIterations as 0, the software disables iterations and only runs initialization or post-processing.	200
MaxFunctionEvaluations	Maximum number of objective function evaluations, including evaluations performed by line search, specified as a positive integer.	intmax
HistorySize	Number of curvature pairs or state updates to store, specified as a positive integer. The L-BFGS algorithm uses a history of gradient calculations to approximate the Hessian matrix recursively. Larger values of HistorySize can improve the Hessian approximation but will increase memory usage and cost per iteration. For more information, see the Limited-Memory BFGS (Deep Learning Toolbox) section.	10
GradientTolerance	Stopping tolerance on the relative gradient, specified as a positive scalar. The software stops training when the relative gradient is less than or equal to GradientTolerance.	1e-6
StepTolerance	Stopping tolerance on the step size, specified as a positive scalar. StepTolerance specifies the minimum allowable change in the parameters between successive iterations. The software stops training when the step that the algorithm takes is less than or equal to StepTolerance.	1e-12
FunctionTolerance	Stopping tolerance on the improvement in the objective value, specified as a positive scalar. FunctionTolerance specifies the minimum required decrease in the objective function value between iterations. The software stops training when the objective value improvement is less than or equal to FunctionTolerance.	1e-12
LineSearchMethod	Method to find a suitable step size, specified as one of these values: "strong-wolfe" — Search for a step size that satisfies the strong Wolfe conditions (sufficient decrease and strong curvature). This method maintains a positive definite approximation of the inverse Hessian matrix. "weak-wolfe" — Search for a step size that satisfies the weak Wolfe conditions (sufficient decrease and curvature). This method maintains a positive definite approximation of the inverse Hessian matrix. It can accept longer steps. "armijo" — Search for a learning rate that satisfies sufficient decrease conditions only. This method does not maintain a positive definite approximation of the inverse Hessian matrix. It is often more tolerant of noisy gradients but can accept shorter steps.	"strong-wolfe"
MaxNumLineSearchIterations	Maximum number of line search trials per iteration to determine the step size, specified as a positive integer.	40
InitialStepSize	Step size for the starting line search trial, specified as a positive scalar.	1.0
Advanced	Structure used to specify advanced search options consisting of these fields:
	MinStepSize — Smallest step size permitted by line search, specified as a positive scalar. If the step size for a trial goes below this value, the line search fails and the solver can stop or fall back depending on the implementation.	1e-16
	MaxStepSize — Largest step size permitted by line search, specified as a positive scalar. This upper bound for the trial step size prevents excessively large moves that can cause numerical overflow or objective evaluation failures.	1e+16
	GradientClipNorm — Maximum allowed L2 norm of the gradient vector used by the quasi-Newton update and line search, specified as a nonnegative scalar. If the gradient norm exceeds this value, the gradient is rescaled. This rescaling helps improve robustness on problems with occasional gradient spikes or poor scaling. To disable this option, specify GradientClipNorm as 0.	0
	WolfeC1 — Armijo condition (sufficient decrease) constant for Wolfe line search, specified as a positive scalar less than 1. Smaller values of WolfeC1 make sufficient decrease easier to satisfy.	1e-4
	WolfeC2 — Curvature condition constant for Wolfe line search, specified as positive scalar less than 1. Larger values of WolfeC2 make the curvature condition easier to satisfy whereas smaller values enforce a stronger curvature requirement.	0.9
	ZoomMaxIterations — Maximum number of iterations allowed in the "zoom" procedure of Wolfe line search, specified as a positive integer.	40
	BacktrackingFactor — Step size shrink factor during backtracking used to reduce trial step sizes when conditions are not satisfied, specified as a positive scalar less than 1. Values closer to 0 shrink the step size more aggressively while values closer to 1 shrink the step size more conservatively.	0.5
	CurvatureThreshold — Number to control whether a new curvature pair is accepted into the limited-memory history, specified as a positive scalar. Specifying CurvatureThreshold prevents storing nearly singular or noisy curvature information that can destabilize the inverse-Hessian approximation.	1e-10
	PowellDamping — Number to control the amount of Powell damping applied when the curvature condition is weak, specified as a nonnegative number less than 1. Damping enforces positive curvature and a positive-definite inverse-Hessian approximation. To disable this option, specify PowellDamping as 0.	0
	UseInitialScaling — Flag to control whether the initial inverse-Hessian is scaled each iteration using curvature information, specified as a logical scalar. This scaling often improves practical performance.	1

To specify field values in SearchOptions, create a default findopOptions set and modify the fields using dot notation. Any fields that you do not modify retain their default values.

opt = findopOptions;
opt.SearchOptions.MaxIterations = 15;
opt.SearchOptions.Advanced.RelImprovement = 0.5;

Output Arguments

opt — Option set for findop command

findopOptions object

Option set for findop command, returned as a findopOptions object.

Extended Capabilities

Automatic Parallel Support

Accelerate code by automatically running computation in parallel using Parallel Computing Toolbox™.

The findopOptions object has automatic parallel support if its SearchMethod property is set to "patternsearch".

To run computations in parallel, set the SearchMethod property to "patternsearch" and the SearchOptions.UseParallel property to "on" or "auto".

Version History

Introduced in R2015a

R2026b: Enhanced control over parallel execution with SearchOptions.UseParallel property

When the SearchMethod property is "patternsearch", the SearchOptions.UseParallel property now accepts "off", "auto", or "on" values instead of true or false. This change gives you more control over when to use a parallel pool for parallel execution.

Specifying the SearchOptions.UseParallel property as true or false is not recommended.

R2026b: New Adam, SGDM, and L-BFGS solvers available for estimation

You can now use the adaptive moment estimation (Adam), stochastic gradient descent with momentum (SGDM), or limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) solvers to estimate models by setting the SearchMethod property to 'adam', 'sgdm', or 'lbfgs', respectively. You can change the default search option set using the SearchOptions property.

R2025a: New pattern search solver available for estimation

You can now set the SearchMethod property to 'patternsearch' to estimate a system that has a nonlinearity without a well-defined gradient. You can change the default option set for this search algorithm using the SearchOptions property. This method requires Global Optimization Toolbox software.

R2018a: Renaming of Estimation and Analysis Options

The names of some estimation and analysis options were changed in R2018a. Prior names still work.