| Optimization Toolbox |
 |
- active constraints
linprog example
lsqlin example
quadprog example
- active set method
fmincon medium-scale algorithm
linprog medium-scale algorithm
lsqlin medium-scale algorithm
quadprog medium-scale algorithm
- sequential quadratic programming (SQP)
- arguments, additional
- attainment factor
- axis crossing. See zero of a function
- banana function
- BFGS formula
fmincon medium-scale algorithm
fminunc medium-scale algorithm
- bisection search
- bound constraints, large-scale
- box constraints. See bound constraints
- centering parameter
- CG. See conjugate gradients
- code
- updating to Version 2 syntax
- complementarity conditions
- complex variables <1> <2>
- conjugate gradients
- constrained minimization
- large-scale example <1> <2>
- medium-scale example
- constraints
- linear <1> <2> <3>
- positive
- continuous derivative
- gradient methods
- convex problem
- cubic interpolation
- curve-fitting
- categories
- functions that apply
- data-fitting
- categories
- functions that apply
- dense columns, constraint matrix
- DFP formula
- direction of negative curvature
- discontinuities
- discontinuous problems <1> <2>
- discrete variables
- dual problem
- duality gap
-constraint method
- equality constraints
- dense columns
- medium-scale example
- equality constraints inconsistent warning,
quadprog
- equality constraints, linear
- large-scale
- equation solving
- categories
- functions that apply
- error,
Out of memory.
- feasibility conditions
- feasible point, finding
fgoalattain
- example
- fixed variables
- fixed-step ODE solver
fminbnd
fmincon
- large-scale example <1> <2>
- medium-scale example
fminimax
- example
fminsearch
fminunc
- large-scale example
- medium-scale example
- warning messages
fseminf
fsolve
- large-scale Jacobian
- medium-scale analytic Jacobian
- medium-scale finite difference Jacobian
fsolve medium-scale default
- function arguments
- function discontinuities
- functions
- grouped by category
fzero
fzmult
gangstr
- Gauss-Newton method (large-scale)
- nonlinear least-squares
- Gauss-Newton method (medium-scale)
- implementation, nonlinear equations
- implementation, nonlinear least squares
- least-squares optimization
- solving nonlinear equations
- global minimum
- global variables
- goal attainment <1> <2>
- example
goaldemo
- golden section search
- gradient checking, analytic
- gradient examples
- gradient function
- gradient methods
- continuous first derivative
- quasi-Newton
- unconstrained optimization
Hessian modified message
Hessian modified twice message
- Hessian sparsity structure
- Hessian update <1> <2>
- Hessian updating methods
- inconsistent constraints
- indefinite problems
infeasible message
- infeasible optimization problems
- infeasible problems
- infeasible solution warning
linprog
quadprog
- inline objects
- input arguments
- integer variables
- interior-point linear programming
- introduction to optimization
- iterative display
- Jacobian
- analytic
- finite difference
- large-scale nonlinear equations
- Jacobian sparsity pattern
- Kuhn-Tucker equations
- Lagrange multipliers
- large-scale linear programming
- large-scale functionality coverage
- large-scale methods
- demos
- examples
- least squares
- categories
- functions that apply
- Levenberg-Marquardt method
lsqcurvefit medium-scale default
lsqnonlin medium-scale default
- search direction
- line search
- cubic interpolation
fminunc medium-scale default
fsolve medium-scale default
lsqcurvefit medium-scale default
lsqnonlin medium-scale default
- quadratic interpolation
- unconstrained optimization
- line search strategy
- linear constraints <1> <2> <3>
- linear equations solve
- linear least squares
- constrained
- large-scale algorithm
- large-scale example
- nonnegative
- unconstrained
- linear programming
- implementation
- large-scale algorithm
- large-scale example <1> <2>
- problem
linprog
- large-scale example <1> <2>
- LIPSOL
- lower bounds
lsqcurvefit
lsqlin
- large-scale example
lsqnonlin
- convergence
- large-scale example
- medium-scale example
lsqnonneg
- maximization
- medium-scale methods
- demos
- Mehrotra's predictor-corrector algorithm <1> <2>
- merit function
- minimax examples
- minimax problem, solving
- minimization
- categories
- functions that apply
- multiobjective optimization <1> <2>
- examples
- NCD. See Nonlinear Control Design
- negative curvature direction <1> <2>
- negative definite problems
- Nelder and Mead
- Newton direction
- approximate
- Newton's method
- systems of nonlinear equations
- unconstrained optimization
no update message
- nonconvex problems
- noninferior solution
- Nonlinear Control Design (NCD) Blockset
- nonlinear data-fitting
- nonlinear equations
- Newton's method
- nonlinear equations (large-scale)
- example with Jacobian
- solving
- nonlinear equations (medium-scale)
- analytic Jacobian example
- finite difference Jacobian example
- Gauss-Newton method
- solving
- trust-region dogleg method
- nonlinear least squares <1> <2> <3>
- large-scale algorithm
- large-scale example
- nonlinear programming
- normal equations <1> <2>
- objective function
- return values
- optimality conditions linear programming
optimget
- optimization
- functions by category
- getting to a global minimum
- handling infeasibility
- helpful hints
- introduction
- objective function return values
- troubleshooting
- unconstrained
- optimization parameters structure <1> <2> <3>
optimset
- options parameters
- descriptions
- possible values
- utility functions
Out of memory. error
- output arguments
- output display
- output headings
- large-scale algorithms
- medium-scale algorithms
- PCG. See preconditioned conjugate gradients
- preconditioned conjugate gradients <1> <2> <3>
- algorithm
- preconditioner <1> <2>
- banded
- predictor-corrector algorithm
- preprocessing
- linear programming <1> <2>
- primal problem
- primal-dual algorithm
- primal-dual interior-point
- projection method
quadprog medium-scale algorithm
- sequential quadratic programming (SQP)
quadprog
- large-scale example
- quadratic interpolation
- quadratic programming <1> <2> <3>
- large-scale algorithm
- large-scale example
- quasi-Newton method
- implementation
- quasi-Newton methods
fminunc medium-scale algorithm
- unconstrained optimization
- reflective line search
- reflective steps <1> <2>
- residual
- Rosenbrock's function
- sampling interval
- secular equation
- semi-infinite constraints
- Sherman-Morrison formula
- signal processing example
- simple bounds
- simplex search
- unconstrained optimization
- Simulink, multiobjective example
- singleton rows
- solving nonlinear systems of equations
- sparsity pattern Jacobian
- sparsity structure, Hessian
- SQP method <1> <2> <3>
- steepest descent
- stopping criteria, large-scale linear programming
- structural rank
- subspace
- determination of
- subspace, two-dimensional
- systems of nonlinear equations
- solving
- trust region
- trust-region dogleg method (medium-scale)
- implementation for nonlinear equations
- systems of nonlinear equations
- two-dimensional subspace
- typographical conventions
- typographical conventions (table)
- unbounded solutions warning
linprog
quadprog
- unconstrained minimization <1> <2>
- large-scale example
- medium-scale example
- one dimensional
- unconstrained optimization
- updating code to Version 2 syntax
- upper bounds
- variable-step ODE solver
- Version 2
- changes to calling sequence
- converting Version 1.5 code
- warning
- equality constraints inconsistent,
quadprog
- infeasible solution,
linprog
- infeasible solution,
quadprog
- stuck at minimum,
fsolve
- unbounded solutions,
linprog
- unbounded solutions,
quadprog
- warnings displayed
- weighted sum strategy
- zero curvature direction
- zero finding
- zero of a function, finding
| quadprog | |