Table Of Contents

Quadratic Programming (Active Set) (G Dataflow)

Version:
    Last Modified: August 28, 2017

    Solves the quadratic programming problem using the active set method.

    connector_pane_image
    datatype_icon

    warm start

    Boolean value that specifies whether to allow a warm start of the optimization.

    True Uses the indexes of the active constraints from the previous solution as the initial set of active constraints for the current problem.
    False Does not use the indexes of the active constraints from the previous solution as the initial set of active constraints for the current problem.

    Default: False

    datatype_icon

    objective function

    Coefficients of the quadratic and linear terms of the objective function 0.5x * Q * x + c * x.

    datatype_icon

    Q

    Quadratic term, in the form of a matrix, of the objective function.

    datatype_icon

    c

    Linear term, in the form of a vector, of the objective function.

    datatype_icon

    start

    Values of the variables at which the optimization starts.

    datatype_icon

    parameter bounds

    Upper and lower numeric limits for the parameters being optimized.

    datatype_icon

    minimum

    Smallest allowed values of the parameters being optimized.

    This input must be empty or the same size as start. This input must be the same size as maximum. This input does not allow exceptional values, such as Inf, -Inf, or NaN.

    datatype_icon

    maximum

    Greatest allowed values of the parameters being optimized.

    This input must be empty or the same size as start. This input must be the same size as minimum. This input does not allow exceptional values, such as Inf, -Inf, or NaN.

    datatype_icon

    equality constraints

    Components of the linear equality constraint equation A * x = b.

    datatype_icon

    A

    Matrix term of the linear equality constraint equation.

    datatype_icon

    b

    Vector term of the linear equality constraint equation.

    datatype_icon

    inequality constraints

    Components of the linear inequality constraint minimumD * xmaximum.

    datatype_icon

    D

    Matrix term of the linear inequality constraint.

    datatype_icon

    minimum

    Smallest allowed value of the linear inequality constraint.

    datatype_icon

    maximum

    Greatest allowed value of the linear inequality constraint.

    datatype_icon

    error in

    Error conditions that occur before this node runs.

    The node responds to this input according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Default: No error

    datatype_icon

    stopping criteria

    Conditions that terminate the optimization.

    This node terminates the optimization if this node reaches all the tolerance thresholds or passes any of the maximum thresholds.

    datatype_icon

    function tolerance

    Minimum relative change in function values between two internal iterations.

    Definition of Relative Change in Function Values

    The relative change in function values between two internal iterations is defined as follows:

    abs ( f n f n 1 ) abs ( f n ) + ε

    where

    • fn is the function value of the current iteration
    • fn - 1 is the function value of the previous iteration
    • ε is the machine epsilon

    Default: 1E-08

    datatype_icon

    parameter tolerance

    Minimum relative change in parameter values between two internal iterations.

    Definition of Relative Change in Parameter Values

    The relative change in parameter values between two internal iterations is defined as follows:

    abs ( P n P n 1 ) abs ( P n ) + ε

    where

    • Pn is the parameter value of the current iteration
    • Pn - 1 is the parameter value of the previous iteration
    • ε is the machine epsilon

    Default: 1E+06

    datatype_icon

    gradient tolerance

    Minimum 2-norm of the gradient.

    Default: 1E+06

    datatype_icon

    maximum iterations

    Maximum number of iterations that the node runs in the optimization.

    Default: 10000

    datatype_icon

    maximum function calls

    Maximum number of calls to the objective function allowed in the optimization.

    Default: 10000

    datatype_icon

    maximum time

    Maximum amount of time in seconds allowed for the optimization.

    Default: -1 — The optimization never times out.

    datatype_icon

    minimum

    Values of the variables where the objective function has the local minimum.

    datatype_icon

    f(minimum)

    Value of the objective function at minimum.

    datatype_icon

    Lagrangian multipliers

    Coefficients of the Lagrangian function that correspond to the equality and inequality constraints.

    If the objective function has three equality constraints and two inequality constraints, the first three Lagrangian multipliers correspond to the equality constraints, and the last two Lagrangian multipliers correspond to the inequality constraints.

    datatype_icon

    error out

    Error information.

    The node produces this output according to standard error behavior.

    Standard Error Behavior

    Many nodes provide an error in input and an error out output so that the node can respond to and communicate errors that occur while code is running. The value of error in specifies whether an error occurred before the node runs. Most nodes respond to values of error in in a standard, predictable way.

    error in does not contain an error error in contains an error
    If no error occurred before the node runs, the node begins execution normally.

    If no error occurs while the node runs, it returns no error. If an error does occur while the node runs, it returns that error information as error out.

    If an error occurred before the node runs, the node does not execute. Instead, it returns the error in value as error out.

    Where This Node Can Run:

    Desktop OS: Windows

    FPGA: This product does not support FPGA devices

    Web Server: Not supported in VIs that run in a web application


    Recently Viewed Topics