What Is Optimization Toolbox?
What Is Optimization Toolbox? What Is Optimization Toolbox?
5 Optimization ToolK1, K2, ..., Kntheta evaluated over an interval S at the point x. Specifythefunction as a function handle of the form @seminfcon, whereseminfcon.m isan M-file, or as an anonymous function. For a description of this M-file, seethe “Input Arguments” on page 8-93 section of the function reference page.Linear inequalities of the form A*x ≤ b are specified by the matrix A andthe vector b.Linear equalities of the form Aeq*x = beq are specified by the matrix Aeqand the vector beq.Bounds are lower and upper bounds on the variables, specified as vectors.Function EquivalentFor the function that corresponds to this solver and more information on theproblem definition, see the fseminf function.fsolve Problem SetupAlgorithmSpecify whether you want to use large or medium-scale. Withinmedium scale there are three option choices: the trust-region dogleg, theLevenberg-Marquardt, or the Gauss-Newton algorithm. For more informationon the routines Optimization Toolbox uses for these choices, see “Medium- andLarge-Scale Algorithms” on page 2-7.5-18
Defining the ProblemLinear System of EquationsObjective function (required) is the function describing a system ofnonlinear equations you want to solve. Specify the function as a functionhandle of the form @objfun, whereobjfun.m is an M-file, or as an anonymousfunction. For a description of this M-file, see the “Input Arguments” on page8-108 section of the function reference page.Derivatives specifies if the Jacobian is supplied in the objective function or ifit should be approximated by the solver.Start point (required) is the initial point (vector) for the algorithm.Function EquivalentFor the function that corresponds to this solver and more information on theproblem definition, see the fsolve function.fzero Problem SetupFunction to MinimizeEquation (required)isthefunctionwhosezeroistobecomputed. Specifythe function as a function handle of the form @objfun, whereobjfun.m is anM-file, or as an anonymous function. For a description of this M-file, see the“Input Arguments” on page 8-124 section of the function reference page.Interval containing zero of equation has two options. You must eitherenter your own interval using the fields X1 and X2 or specify a point X toenable the algorithm to find an interval containing that point for you. Toenter your own, select Specify interval [X1, X2] and enter the values for5-19
- Page 167 and 168: Multiobjective OptimizationIn the t
- Page 169 and 170: Multiobjective OptimizationThe afor
- Page 171 and 172: Multiobjective OptimizationWhat is
- Page 173 and 174: Multiobjective Optimization(3-51)wh
- Page 175 and 176: Selected BibliographySelected Bibli
- Page 177 and 178: Selected Bibliography[24] Han, S.P.
- Page 179 and 180: 4Large-Scale AlgorithmsLarge-Scale
- Page 181 and 182: Trust-Region Methods for Nonlinear
- Page 183 and 184: Trust-Region Methods for Nonlinear
- Page 185 and 186: Preconditioned Conjugate GradientsP
- Page 187 and 188: Linearly Constrained ProblemsLinear
- Page 189 and 190: Linearly Constrained ProblemsThe sc
- Page 191 and 192: Quadratic ProgrammingQuadratic Prog
- Page 193 and 194: Large-Scale Linear ProgrammingLarge
- Page 195 and 196: Large-Scale Linear ProgrammingThe a
- Page 197 and 198: Large-Scale Linear ProgrammingWhile
- Page 199 and 200: Selected Bibliography[11] Zhang, Y.
- Page 201 and 202: 5Optimization ToolGetting Started w
- Page 203 and 204: Getting Started with the Optimizati
- Page 205 and 206: Selecting a SolverSelecting a Solve
- Page 207 and 208: Defining the ProblemDefining the Pr
- Page 209 and 210: Defining the ProblemFunction to Min
- Page 211 and 212: Defining the ProblemConstraintsLine
- Page 213 and 214: Defining the ProblemM-file, or as a
- Page 215 and 216: Defining the ProblemBounds are lowe
- Page 217: Defining the Problemfseminf Problem
- Page 221 and 222: Defining the ProblemFunction to Min
- Page 223 and 224: Defining the ProblemConstraintsBoun
- Page 225 and 226: Defining the ProblemFunction to Min
- Page 227 and 228: Defining the ProblemConstraintsWith
- Page 229 and 230: Running a Problem in the Optimizati
- Page 231 and 232: Specifying the Options• Xtoleranc
- Page 233 and 234: Specifying the Optionsoption to a d
- Page 235 and 236: Specifying the OptionsThe following
- Page 237 and 238: Specifying the OptionsMultiobjectiv
- Page 239 and 240: Specifying the OptionsPlot Function
- Page 241 and 242: Specifying the Options• final —
- Page 243 and 244: Importing and Exporting Your WorkIm
- Page 245 and 246: Importing and Exporting Your WorkYo
- Page 247 and 248: Optimization Tool ExamplesOptimizat
- Page 249 and 250: Optimization Tool Examples6 In the
- Page 251 and 252: Optimization Tool Examplesmax Line
- Page 253 and 254: Optimization Tool ExamplesThe Aeq a
- Page 255 and 256: 6Argument and OptionsReferenceThis
- Page 257 and 258: Function ArgumentsInput Arguments (
- Page 259 and 260: Function ArgumentsInput Arguments (
- Page 261 and 262: Function ArgumentsOutput Arguments
- Page 263 and 264: Optimization OptionsOptimization Op
- Page 265 and 266: Optimization OptionsOptimization Op
- Page 267 and 268: Optimization OptionsOptimization Op
5 <strong>Optimization</strong> ToolK1, K2, ..., Kntheta evaluated over an interval S at the point x. Specifythefunction as a function handle of the form @seminfcon, whereseminfcon.m isan M-file, or as an anonymous function. For a description of this M-file, seethe “Input Arguments” on page 8-93 section of the function reference page.Linear inequalities of the form A*x ≤ b are specified by the matrix A andthe vector b.Linear equalities of the form Aeq*x = beq are specified by the matrix Aeqand the vector beq.Bounds are lower and upper bounds on the variables, specified as vectors.Function EquivalentFor the function that corresponds to this solver and more information on theproblem definition, see the fseminf function.fsolve Problem SetupAlgorithmSpecify whether you want to use large or medium-scale. Withinmedium scale there are three option choices: the trust-region dogleg, theLevenberg-Marquardt, or the Gauss-Newton algorithm. For more informationon the routines <strong>Optimization</strong> <strong>Toolbox</strong> uses for these choices, see “Medium- andLarge-Scale Algorithms” on page 2-7.5-18
Change language