What Is Optimization Toolbox?

lsqnonlinoutputupperUpper bounds ubStructure containing information about theoptimization. The fields of the structure areiterationsfuncCountalgorithmcgiterationsstepsizeNumber of iterations takenThe number of functionevaluationsAlgorithm usedNumber of PCG iterations(large-scale algorithm only)The final step size taken(medium-scale algorithm only)firstorderopt Measure of first-order optimality(large-scale algorithm only)For large-scale bound constrainedproblems, the first-orderoptimality is the infinity normof v.*g, wherev is defined as in“Box Constraints” on page 4-10,and g is the gradient g = J T F (see“Nonlinear Least-Squares” onpage 4-12).Note The sum of squares should not be formed explicitly. Instead, yourfunction should return a vector of function values. See “Examples” onpage 8-174.OptionsOptimization options. You can set or change the values of these optionsusing the optimset function. Some options apply to all algorithms,some are only relevant when you are using the large-scale algorithm,and others are only relevant when you are using the medium-scale8-170