Simulink Control Design™ - MathWorks

(Tuis.) #1

Input Arguments


Name-Value Pair Arguments


Specify optional comma-separated pairs of Name,Value arguments. Name is the
argument name and Value is the corresponding value. Name must appear inside quotes.
You can specify several name and value pair arguments in any order as
Name1,Value1,...,NameN,ValueN.
Example: 'DisplayReport','off' suppresses the display of the operating point search
report to the Command Window.

OptimizerType — Optimizer type used by the optimization algorithm
'graddescent-elim' (default) | 'graddescent' | 'graddescent-proj' |
'lsqnonlin' | 'lsqnonlin-proj' | 'simplex'

Optimizer type used by the optimization algorithm, specified as the comma-separated pair
consisting of 'OptimizerType' and one of the following:


  • 'graddescent-elim' — Enforce an equality constraint to force the time derivatives
    of states to be zero (dx/dt = 0, x(k+1) = x(k)) and output signals to be equal to
    their specified known values. The optimizer fixes the states, x, and inputs, u, that are
    marked as Known in an operating point specification, and optimizes the remaining
    variables.

  • 'graddescent' — Enforce an equality constraint to force the time derivatives of
    states to be zero (dx/dt = 0, x(k+1) = x(k)) and the output signals to be equal to
    their specified known values. The optimizer also minimizes the error between the
    states, x, and inputs, u, and their respective known values from an operating point
    specification. If there are not any inputs or states marked as Known, findop attempts
    to minimize the deviation between the initial guesses for x and u, and their trimmed
    values.

  • 'graddescent-proj' — In addition to 'graddescent', enforce consistency of
    model initial conditions at each function evaluation. To specify whether constraints are
    hard or soft, use the ConstraintType option. This optimization method does not
    support analytical Jacobians.

  • 'lsqnonlin' — Fix the states, x, and inputs, u, marked as Known in an operating
    point specification, and optimize the remaining variables. The algorithm tries to
    minimize both the error in the time derivatives of the states (dx/dt = 0, x(k+1) =
    x(k)) and the error between the outputs and their specified known values.


15 Alphabetical List

Free download pdf