What Is Optimization Toolbox?
What Is Optimization Toolbox? What Is Optimization Toolbox?
fsolveOutputArguments“Function Arguments” on page 6-2 contains general descriptions ofarguments returned by fsolve. For more information on the outputheadings for fsolve, see “Function-Specific Output Headings” on page2-82.This section provides function-specific details for exitflag and output:exitflagoutputInteger identifying the reason the algorithmterminated. The following lists the values ofexitflag and the corresponding reasons thealgorithm terminated.1 Function converged to a solution x.2 Change in x was smaller than thespecified tolerance.3 Change in the residual was smallerthan the specified tolerance.4 Magnitude of search direction wassmaller than the specified tolerance.0 Number of iterations exceededoptions.MaxIter or number offunction evaluations exceededoptions.FunEvals.-1 Algorithm was terminated by theoutput function.-2 Algorithm appears to be convergingto a point that is not a root.-3 Trust radius became too small.-4 Line search cannot sufficientlydecrease the residual along thecurrent search direction.Structure containing information about theoptimization. The fields of the structure areiterationsNumber of iterations taken8-110
fsolvefuncCountalgorithmcgiterationsstepsizeNumber of function evaluationsAlgorithm used.Number of PCG iterations (large-scalealgorithm only)Final step size taken (medium-scalealgorithm only)firstorderopt Measure of first-order optimality(large-scale algorithm only)For large-scale problems, thefirst-order optimality is the infinitynorm of the gradient g = J T F (see“Nonlinear Least-Squares” on page4-12).OptionsOptimization options used by fsolve. Some options apply to allalgorithms, some are only relevant when using the large-scalealgorithm, and others are only relevant when using the medium-scalealgorithm. You can use optimset to set or change the values of thesefields in the options structure, options. See “Optimization Options” onpage 6-8 for detailed information.The LargeScale option specifies a preference for which algorithm touse. It is only a preference because certain conditions must be metto use the large-scale algorithm. For fsolve, the nonlinear system ofequations cannot be underdetermined; that is, the number of equations(the number of elements of F returned by fun) mustbeatleastasmanyas the length of x or else the medium-scale algorithm is used:LargeScaleUse large-scale algorithm if possible when set to'on'. Use medium-scale algorithm when set to'off'. The default for fsolve is 'off'.8-111
- Page 343 and 344: fminimaxIf nonlcon returns a vector
- Page 345 and 346: fminimaxlambdamaxfvaloutputStructur
- Page 347 and 348: fminimaxMeritFunctionMinAbsMaxOutpu
- Page 349 and 350: fminimaxx0 = [0.1; 0.1]; % Make a s
- Page 351 and 352: fminimax[3] Han, S.P., “A Globall
- Page 353 and 354: fminsearchInputArguments“Function
- Page 355 and 356: fminsearchOutputFcnPlotFcnsTolFunSp
- Page 357 and 358: fminsearcha = sqrt(2);banana = @(x)
- Page 359 and 360: fminuncPurposeEquationFind minimum
- Page 361 and 362: fminuncfunThefunctiontobeminimized.
- Page 363 and 364: fminuncexitflaggradhessianoutputInt
- Page 365 and 366: fminuncLarge-Scale and Medium-Scale
- Page 367 and 368: fminuncHessianHessMultIf 'on', fmin
- Page 369 and 370: fminuncPrecondBandWidthTolPCGUpper
- Page 371 and 372: fminuncx0 = [1,1];[x,fval] = fminun
- Page 373 and 374: fminunc“Trust-Region Methods for
- Page 375 and 376: fseminfPurposeEquationFind minimum
- Page 377 and 378: fseminf“Avoiding Global Variables
- Page 379 and 380: fseminfoptions“Options” on page
- Page 381 and 382: fseminflambdaoutput5 Magnitude of d
- Page 383 and 384: fseminfOutputFcnPlotFcnsRelLineSrch
- Page 385 and 386: fseminfSecond, write an M-file, myc
- Page 387 and 388: fseminfThe plot command inside 'myc
- Page 389 and 390: fseminfThe goal was to minimize the
- Page 391 and 392: fsolvePurposeEquationSolve system o
- Page 393: fsolvefunThe nonlinear system of eq
- Page 397 and 398: fsolvePlotFcnsTolFunPlots various m
- Page 399 and 400: fsolveJacobPatternMaxPCGIterPrecond
- Page 401 and 402: fsolve[x,fval] = fsolve(@myfun,x0,o
- Page 403 and 404: fsolveYoucanformulateandsolvethepro
- Page 405 and 406: fsolveLimitationsThe function to be
- Page 407 and 408: fzeroPurposeSyntaxDescriptionFind r
- Page 409 and 410: fzeroDisplayFunValCheckOutputFcnLev
- Page 411 and 412: fzerowrite an M-file called f.m.fun
- Page 413 and 414: fzmultPurposeSyntaxMultiplication w
- Page 415 and 416: linprogPurposeEquationSolve linear
- Page 417 and 418: linproglambdaoutput-2 No feasible p
- Page 419 and 420: linprogsubject toFirst, enter the c
- Page 421 and 422: linprogDiagnosticsLarge-Scale Optim
- Page 423 and 424: linprogthe primal objective < -1e+1
- Page 425 and 426: lsqcurvefitPurposeEquationSolve non
- Page 427 and 428: lsqcurvefitfunThe function you want
- Page 429 and 430: lsqcurvefitoutputupperUpper bounds
- Page 431 and 432: lsqcurvefitJacobianMaxFunEvalsMaxIt
- Page 433 and 434: lsqcurvefitJacobPatternMaxPCGIterSp
- Page 435 and 436: lsqcurvefitNote that at the time th
- Page 437 and 438: lsqcurvefitof J with many nonzeros,
- Page 439 and 440: lsqlinPurposeEquationSolve constrai
- Page 441 and 442: lsqlinlambdaoutput3 Change in the r
- Page 443 and 444: lsqlinDiagnosticsDisplayMaxIterTypi
fsolvefuncCountalgorithmcgiterationsstepsizeNumber of function evaluationsAlgorithm used.Number of PCG iterations (large-scalealgorithm only)Final step size taken (medium-scalealgorithm only)firstorderopt Measure of first-order optimality(large-scale algorithm only)For large-scale problems, thefirst-order optimality is the infinitynorm of the gradient g = J T F (see“Nonlinear Least-Squares” on page4-12).Options<strong>Optimization</strong> options used by fsolve. Some options apply to allalgorithms, some are only relevant when using the large-scalealgorithm, and others are only relevant when using the medium-scalealgorithm. You can use optimset to set or change the values of thesefields in the options structure, options. See “<strong>Optimization</strong> Options” onpage 6-8 for detailed information.The LargeScale option specifies a preference for which algorithm touse. It is only a preference because certain conditions must be metto use the large-scale algorithm. For fsolve, the nonlinear system ofequations cannot be underdetermined; that is, the number of equations(the number of elements of F returned by fun) mustbeatleastasmanyas the length of x or else the medium-scale algorithm is used:LargeScaleUse large-scale algorithm if possible when set to'on'. Use medium-scale algorithm when set to'off'. The default for fsolve is 'off'.8-111
Change language