Table Of Contents

Optimization Nodes (G Dataflow)

Version:
    Last Modified: December 4, 2016

    Use the Optimization nodes to determine local minima and maxima of real 1D or n-dimension functions.

    You can choose between optimization algorithms based on derivatives of the function and algorithms working without these derivatives. You also can use special methods like Linear Programming, Levenberg-Marquardt in symbolic form, Pade, and Chebyshev Approximation.

    An overview of the optimization routines is shown in the following illustration.

    node_icon
    Finds a local minimum of a given 1D function.
    node_icon
    Finds a local minimum of a given n-dimension function.
    node_icon
    Finds all local minima of a given 1D function in a given interval.
    node_icon
    Finds all local minima of a given n-dimension function in a given n-dimension interval.
    node_icon
    Solves linear programming problem.

    Recently Viewed Topics