<?xml version='1.0' encoding='ISO-8859-1'  ?>
<!-- $Revision: 1.3 $ $Date: 2000/09/08 23:05:14 $ -->

<index version="1.0">
<indexitem target="linprog.html#191625">active constraints</indexitem>
<indexitem target="lsqlin.html#413731">active constraints</indexitem>
<indexitem target="quadprog.html#411066">active constraints</indexitem>
<indexitem target="opt2pt20.html#26758">active set method</indexitem>
<indexitem target="fmincon.html#186913">active set method</indexitem>
<indexitem target="linprog.html#437028">active set method</indexitem>
<indexitem target="lsqlin.html#264092">active set method</indexitem>
<indexitem target="quadprog.html#437236">active set method</indexitem>
<indexitem target="opttu13a.html#11137">arguments, additional</indexitem>
<indexitem target="fgoalattain.html#250">attainment factor</indexitem>
<indexitem target="fzero.html#437184">axis crossing. See zero of a function</indexitem>
<indexitem target="opt2pt13.html#132">banana function</indexitem>
<indexitem target="opt2pt14.html#144">BFGS formula</indexitem>
<indexitem target="fmincon.html#434912">BFGS formula</indexitem>
<indexitem target="fminunc.html#435315">BFGS formula</indexitem>
<indexitem target="fzero.html#191193">bisection search</indexitem>
<indexitem target="opt36.html#3477">bound constraints, large-scale</indexitem>
<indexitem target="opt36.html#3477">box constraints. See bound constraints</indexitem>
<indexitem target="opt311.html#3810">centering parameter</indexitem>
<indexitem target="opt32.html#3266">CG. See conjugate gradients</indexitem>
<indexitem>code
    <indexitem target="opttu37a.html#18656">updating to Version 2 syntax</indexitem>
</indexitem>
<indexitem target="opt311.html#3772">complementarity conditions</indexitem>
<indexitem target="opttut36.html#34248">complex values</indexitem>
<indexitem target="lsqcurvefit.html#192147">complex variables</indexitem>
<indexitem target="lsqnonlin.html#540">complex variables</indexitem>
<indexitem target="opt32.html#3266">conjugate gradients</indexitem>
<indexitem target="fmincon.html#186849">constrained minimization
    <indexitem target="opttut22.html#15403">large-scale example</indexitem>
    <indexitem target="opttut23.html#16303">large-scale example</indexitem>
    <indexitem target="opttut17.html#10912">medium-scale example</indexitem>
</indexitem>
<indexitem>constraints
    <indexitem target="opt35.html#3397">linear</indexitem>
    <indexitem target="fmincon.html#431228">linear</indexitem>
    <indexitem target="fminimax.html#187549">linear</indexitem>
    <indexitem target="opttu12a.html#11119">positive</indexitem>
</indexitem>
<indexitem target="opt2pt13.html#131">continuous function and gradient methods</indexitem>
<indexitem target="notesto8.html#15698">conventions in our documentation (table)</indexitem>
<indexitem target="opt2p15a.html#26598">convex problem</indexitem>
<indexitem target="opt2pt15.html#14974">cubic interpolation</indexitem>
<indexitem target="lsqcurvefit.html#192040">curve-fitting
    <indexitem target="opttut13.html#29863">categories</indexitem>
    <indexitem target="optref.html#1974">functions that apply</indexitem>
</indexitem>
<indexitem target="lsqcurvefit.html#192040">data-fitting
    <indexitem target="opttut13.html#29863">categories</indexitem>
    <indexitem target="optref.html#1974">functions that apply</indexitem>
</indexitem>
<indexitem target="opt311.html#3837">dense columns, constraint matrix</indexitem>
<indexitem target="fminunc.html#435315">DFP formula</indexitem>
<indexitem target="opt32.html#3283">direction of negative curvature</indexitem>
<indexitem target="opttut36.html#34234">discontinuities</indexitem>
<indexitem target="opt2pt13.html#131">discontinuities</indexitem>
<indexitem target="fminsearch.html#188494">discontinuous problems</indexitem>
<indexitem target="fminunc.html#280040">discontinuous problems</indexitem>
<indexitem target="opttut36.html#34242">discrete variables</indexitem>
<indexitem target="opt311.html#3741">dual problem</indexitem>
<indexitem target="opt311.html#3777">duality gap</indexitem>
<indexitem target="opt2pt23.html#27234">-constraint method</indexitem>
<indexitem>equality constraints
    <indexitem target="opttut29.html#18266">dense columns</indexitem>
    <indexitem target="opttut11.html#11071">medium-scale example</indexitem>
</indexitem>
<indexitem target="quadprog.html#596">equality constraints inconsistent warning, quadprog</indexitem>
<indexitem>equality constraints, linear
    <indexitem target="opt35.html#3397">large-scale</indexitem>
</indexitem>
<indexitem>equation solving
    <indexitem target="opttut13.html#10736">categories</indexitem>
    <indexitem target="optref.html#2586">functions that apply</indexitem>
</indexitem>
<indexitem target="opttu19a.html#27453">error, Out of memory.</indexitem>
<indexitem target="opt311.html#3772">feasibility conditions</indexitem>
<indexitem target="opt2pt20.html#26918">feasible point, finding</indexitem>
<indexitem target="fgoalattain.html#203422">fgoalattain
    <indexitem target="opttu14a.html#11313">example</indexitem>
</indexitem>
<indexitem target="opt312.html#3865">fixed variables</indexitem>
<indexitem target="opttu14a.html#26782">fixed-step ODE solver</indexitem>
<indexitem target="fminbnd.html#466368">fminbnd</indexitem>
<indexitem target="fmincon.html#186828">fmincon
    <indexitem target="opttut22.html#15403">large-scale example</indexitem>
    <indexitem target="opttut23.html#16303">large-scale example</indexitem>
    <indexitem target="opttut17.html#10912">medium-scale example</indexitem>
</indexitem>
<indexitem target="fminimax.html#187438">fminimax
    <indexitem target="opttu14a.html#11247">example</indexitem>
</indexitem>
<indexitem target="fminsearch.html#188436">fminsearch</indexitem>
<indexitem target="fminunc.html#189290">fminunc
    <indexitem target="opttut20.html#12003">large-scale example</indexitem>
    <indexitem target="opttut16.html#25828">medium-scale example</indexitem>
    <indexitem target="opttut36.html#34226">warning messages</indexitem>
</indexitem>
<indexitem target="fseminf.html#189647">fseminf</indexitem>
<indexitem target="fsolve.html#190456">fsolve
    <indexitem target="opttu17a.html#11440">large-scale example</indexitem>
    <indexitem target="opttu13a.html#11140">medium-scale example</indexitem>
</indexitem>
<indexitem target="optref2.html#2675">function arguments</indexitem>
<indexitem target="opttut36.html#34234">function discontinuities</indexitem>
<indexitem>functions
    <indexitem target="optref.html#5533">grouped by type of optimization</indexitem>
    <indexitem target="opttu37a.html#18656">updating to Version 2</indexitem>
</indexitem>
<indexitem target="fzero.html#191118">fzero</indexitem>
<indexitem target="opt37.html#3654">Gauss-Newton</indexitem>
<indexitem target="opt2pt10.html#199">Gauss-Newton method</indexitem>
<indexitem target="opt2pt10.html#203">Gauss-Newton method</indexitem>
<indexitem target="opt2p14a.html#41189">Gauss-Newton method</indexitem>
<indexitem target="fsolve.html#436986">Gauss-Newton method</indexitem>
<indexitem target="lsqcurvefit.html#437066">Gauss-Newton method</indexitem>
<indexitem target="lsqnonlin.html#437206">Gauss-Newton method</indexitem>
<indexitem target="opttut36.html#34267">global minimum</indexitem>
<indexitem target="opttu13a.html#11137">global variables</indexitem>
<indexitem target="opt2pt24.html#27310">goal attainment</indexitem>
<indexitem target="fgoalattain.html#130">goal attainment
    <indexitem target="opttu14a.html#11313">example</indexitem>
</indexitem>
<indexitem target="fgoalattain.html#251">goaldemo</indexitem>
<indexitem target="fminbnd.html#184879">golden section search</indexitem>
<indexitem target="opttut10.html#11061">gradient checking, analytic</indexitem>
<indexitem target="opttut19.html#11004">gradient examples</indexitem>
<indexitem target="opttut14.html#19033">gradient function</indexitem>
<indexitem target="opt2pt13.html#131">gradient methods</indexitem>
<indexitem target="opt2p19a.html#33703">Hessian modified message</indexitem>
<indexitem target="opt2p19a.html#33703">Hessian modified twice message</indexitem>
<indexitem target="opttut21.html#15322">Hessian sparsity structure</indexitem>
<indexitem target="opt2pt17.html#171">Hessian update</indexitem>
<indexitem target="opt2p19a.html#26691">Hessian update</indexitem>
<indexitem target="linprog.html#191642">inconsistent constraints</indexitem>
<indexitem target="quadprog.html#743">indefinite problems</indexitem>
<indexitem target="opt2p19a.html#33703">infeasible message</indexitem>
<indexitem target="fmincon.html#186918">infeasible problems</indexitem>
<indexitem>infeasible solution warning
    <indexitem target="linprog.html#437051">linprog</indexitem>
    <indexitem target="quadprog.html#437247">quadprog</indexitem>
</indexitem>
<indexitem target="opttut36.html#34246">infinite loop</indexitem>
<indexitem target="opttut35.html#12753">inline objects</indexitem>
<indexitem target="optref2.html#2675">input arguments</indexitem>
<indexitem target="opttut36.html#34242">integer variables</indexitem>
<indexitem target="opt310.html#3718">interior-point linear programming</indexitem>
<indexitem target="opt2pt12.html#33771">introduction to optimization</indexitem>
<indexitem target="opttut34.html#12726">iterative display</indexitem>
<indexitem target="opttu17a.html#11440">Jacobian examples</indexitem>
<indexitem target="opttu18a.html#11660">Jacobian sparsity pattern</indexitem>
<indexitem target="opt2p15a.html#26598">Kuhn-Tucker equations</indexitem>
<indexitem>Lagrange multipliers
    <indexitem target="opt312.html#3870">large-scale linear programming</indexitem>
</indexitem>
<indexitem target="opttu16a.html#21056">large-scale functionality coverage</indexitem>
<indexitem>large-scale methods
    <indexitem target="optref.html#2617">demos</indexitem>
    <indexitem target="opttu15a.html#39857">examples</indexitem>
</indexitem>
<indexitem target="opt2pt10.html#202">least squares
    <indexitem target="opttut13.html#29863">categories</indexitem>
    <indexitem target="optref.html#1974">functions that apply</indexitem>
</indexitem>
<indexitem target="opt2pt11.html#204">Levenberg-Marquardt method</indexitem>
<indexitem target="opt2p14a.html#105">Levenberg-Marquardt method</indexitem>
<indexitem target="fsolve.html#436986">Levenberg-Marquardt method</indexitem>
<indexitem target="lsqcurvefit.html#437066">Levenberg-Marquardt method</indexitem>
<indexitem target="lsqnonlin.html#437206">Levenberg-Marquardt method</indexitem>
<indexitem target="fminunc.html#189362">line search</indexitem>
<indexitem target="fsolve.html#356187">line search</indexitem>
<indexitem target="fsolve.html#356230">line search</indexitem>
<indexitem target="lsqcurvefit.html#355692">line search</indexitem>
<indexitem target="lsqnonlin.html#622">line search</indexitem>
<indexitem target="opttut14.html#19276">line search strategy</indexitem>
<indexitem target="opt35.html#3397">linear constraints</indexitem>
<indexitem target="fmincon.html#431228">linear constraints</indexitem>
<indexitem target="fminimax.html#187549">linear constraints</indexitem>
<indexitem target="fsolve.html#190575">linear equations solve</indexitem>
<indexitem>linear least squares
    <indexitem target="lsqlin.html#139608">constrained</indexitem>
    <indexitem target="opt39.html#3692">large-scale algorithm</indexitem>
    <indexitem target="opttut27.html#26715">large-scale example</indexitem>
    <indexitem target="lsqnonneg.html#424534">nonnegative</indexitem>
    <indexitem target="lsqlin.html#496321">unconstrained</indexitem>
</indexitem>
<indexitem target="linprog.html#191531">linear programming
    <indexitem target="opt2pt20.html#33659">implementation</indexitem>
    <indexitem target="opt310.html#3709">large-scale algorithm</indexitem>
    <indexitem target="opttut28.html#18232">large-scale example</indexitem>
    <indexitem target="opttut29.html#18266">large-scale example</indexitem>
    <indexitem target="opt2pt12.html#129">problem</indexitem>
</indexitem>
<indexitem target="linprog.html#191525">linprog
    <indexitem target="opttut28.html#18232">large-scale example</indexitem>
    <indexitem target="opttut29.html#18266">large-scale example</indexitem>
</indexitem>
<indexitem target="opt310.html#3718">LIPSOL</indexitem>
<indexitem target="opttut18.html#10960">lower bounds</indexitem>
<indexitem target="lsqcurvefit.html#357110">lsqcurvefit</indexitem>
<indexitem target="lsqlin.html#139309">lsqlin
    <indexitem target="opttut27.html#26715">large-scale example</indexitem>
</indexitem>
<indexitem target="lsqnonlin.html#749">lsqnonlin
    <indexitem target="opttut36.html#34250">convergence</indexitem>
    <indexitem target="opttu18a.html#11658">large-scale example</indexitem>
    <indexitem target="opttu14a.html#11195">medium-scale example</indexitem>
</indexitem>
<indexitem target="lsqnonneg.html#369">lsqnonneg</indexitem>
<indexitem target="opttu12a.html#11110">maximization</indexitem>
<indexitem>medium-scale methods
    <indexitem target="optref.html#4702">demos</indexitem>
</indexitem>
<indexitem target="opt310.html#3718">Mehrotra's predictor-corrector algorithm</indexitem>
<indexitem target="opt311.html#3791">Mehrotra's predictor-corrector algorithm</indexitem>
<indexitem target="opt2pt21.html#31262">merit function</indexitem>
<indexitem target="opttu14a.html#11247">minimax examples</indexitem>
<indexitem target="fminimax.html#187444">minimax problem, solving</indexitem>
<indexitem>minimization
    <indexitem target="opttut13.html#10640">categories</indexitem>
    <indexitem target="optref.html#3204">functions that apply</indexitem>
</indexitem>
<indexitem target="opt2pt23.html#27016">multiobjective optimization</indexitem>
<indexitem target="fgoalattain.html#130">multiobjective optimization
    <indexitem target="opttu14a.html#11157">examples</indexitem>
</indexitem>
<indexitem target="opttu14a.html#26782">NCD. See Nonlinear Control Design</indexitem>
<indexitem target="opt32.html#3283">negative curvature direction</indexitem>
<indexitem target="opt33.html#3359">negative curvature direction</indexitem>
<indexitem target="quadprog.html#743">negative definite problems</indexitem>
<indexitem target="opt2pt13.html#131">Nelder and Mead</indexitem>
<indexitem>Newton direction
    <indexitem target="opt32.html#3266">approximate</indexitem>
</indexitem>
<indexitem target="opt2pt13.html#131">Newton's method</indexitem>
<indexitem target="opt2p19a.html#33703">no update message</indexitem>
<indexitem target="quadprog.html#743">nonconvex problems</indexitem>
<indexitem target="opt2pt23.html#27082">noninferior solution</indexitem>
<indexitem target="opttu14a.html#26782">Nonlinear Control Design (NCD) Blockset</indexitem>
<indexitem target="lsqnonlin.html#84417">nonlinear data-fitting</indexitem>
<indexitem target="fsolve.html#190474">nonlinear equations, solving</indexitem>
<indexitem target="opt2p12a.html#208">nonlinear least squares</indexitem>
<indexitem target="lsqcurvefit.html#192040">nonlinear least squares</indexitem>
<indexitem target="lsqnonlin.html#84417">nonlinear least squares
    <indexitem target="opt37.html#3642">large-scale algorithm</indexitem>
    <indexitem target="opttu18a.html#11658">large-scale example</indexitem>
</indexitem>
<indexitem target="opt2pt12.html#129">nonlinear programming</indexitem>
<indexitem target="opttu17a.html#11440">nonlinear system of equations, large-scale example</indexitem>
<indexitem target="opt37.html#3675">normal equations</indexitem>
<indexitem target="opt39.html#3697">normal equations</indexitem>
<indexitem target="opttut14.html#29944">objective function</indexitem>
<indexitem target="opttut36.html#34230">objective function, undefined values</indexitem>
<indexitem target="opt311.html#3747">optimality conditions linear programming</indexitem>
<indexitem target="optimget.html#243287">optimget</indexitem>
<indexitem>optimization
    <indexitem target="optref.html#5533">functions for each type</indexitem>
    <indexitem target="opt2pt12.html#33771">introduction</indexitem>
</indexitem>
<indexitem target="opttut30.html#12472">optimization parameters structure</indexitem>
<indexitem target="optimget.html#243290">optimization parameters structure</indexitem>
<indexitem target="optimset.html#242629">optimization parameters structure</indexitem>
<indexitem target="optimset.html#242625">optimset</indexitem>
<indexitem>options parameters
    <indexitem target="optref3.html#3896">descriptions</indexitem>
    <indexitem target="optimset.html#497358">possible values</indexitem>
    <indexitem target="optref.html#1998">utility functions</indexitem>
</indexitem>
<indexitem target="opttu19a.html#27453">Out of memory. error</indexitem>
<indexitem target="optref2.html#2675">output arguments</indexitem>
<indexitem target="opttut32.html#12687">output display</indexitem>
<indexitem target="opttut34.html#12726">output headings
    <indexitem target="opttut34.html#12726">large-scale algorithms</indexitem>
    <indexitem target="opttut33.html#12688">medium-scale algorithms</indexitem>
</indexitem>
<indexitem target="opt32.html#3266">PCG. See preconditioned conjugate gradients</indexitem>
<indexitem target="opt32.html#3266">preconditioned conjugate gradients</indexitem>
<indexitem target="opt33.html#3329">preconditioned conjugate gradients</indexitem>
<indexitem target="opt311.html#3837">preconditioned conjugate gradients
    <indexitem target="opt33.html#3346">algorithm</indexitem>
</indexitem>
<indexitem target="opttu17a.html#11561">preconditioner</indexitem>
<indexitem target="opt33.html#3330">preconditioner
    <indexitem target="opttut22.html#15403">banded</indexitem>
</indexitem>
<indexitem target="opt311.html#3791">predictor-corrector algorithm</indexitem>
<indexitem>preprocessing
    <indexitem target="opt311.html#3723">linear programming</indexitem>
    <indexitem target="opt312.html#3862">linear programming</indexitem>
</indexitem>
<indexitem target="opt311.html#3741">primal problem</indexitem>
<indexitem target="opt311.html#3781">primal-dual algorithm</indexitem>
<indexitem target="opt310.html#3718">primal-dual interior-point</indexitem>
<indexitem target="opt2pt20.html#26758">projection method</indexitem>
<indexitem target="quadprog.html#437236">projection method</indexitem>
<indexitem target="quadprog.html#215">quadprog
    <indexitem target="opttut25.html#36247">large-scale example</indexitem>
</indexitem>
<indexitem target="opt2pt15.html#5971">quadratic interpolation</indexitem>
<indexitem target="opt2pt12.html#129">quadratic programming</indexitem>
<indexitem target="fmincon.html#434912">quadratic programming</indexitem>
<indexitem target="quadprog.html#213">quadratic programming
    <indexitem target="opt38.html#3682">large-scale algorithm</indexitem>
    <indexitem target="opttut25.html#36247">large-scale example</indexitem>
</indexitem>
<indexitem target="opt2pt14.html#137">quasi-Newton method</indexitem>
<indexitem target="opt2pt16.html#167">quasi-Newton method</indexitem>
<indexitem target="fminunc.html#435315">quasi-Newton method</indexitem>
<indexitem target="opt38.html#3687">reflective line search</indexitem>
<indexitem target="opt36.html#3490">reflective steps</indexitem>
<indexitem target="opt36.html#3629">reflective steps</indexitem>
<indexitem target="opt2pt19.html#9100">residual</indexitem>
<indexitem target="opt2pt13.html#132">Rosenbrock's function</indexitem>
<indexitem target="fseminf.html#189732">sampling interval</indexitem>
<indexitem target="opt32.html#3221">secular equation</indexitem>
<indexitem target="fseminf.html#189650">semi-infinite constraints</indexitem>
<indexitem target="opt311.html#3837">Sherman-Morrison formula</indexitem>
<indexitem target="opttu14a.html#11303">signal processing example</indexitem>
<indexitem target="opttut18.html#10960">simple bounds</indexitem>
<indexitem target="opt2pt13.html#131">simplex search</indexitem>
<indexitem target="fminsearch.html#188489">simplex search</indexitem>
<indexitem target="opttu14a.html#11160">Simulink, multiobjective example</indexitem>
<indexitem target="opt312.html#3869">singleton rows</indexitem>
<indexitem target="opttu18a.html#11660">sparsity pattern Jacobian</indexitem>
<indexitem target="opttut21.html#15322">sparsity structure, Hessian</indexitem>
<indexitem target="opt2p16a.html#26624">SQP method</indexitem>
<indexitem target="opt2pt20.html#26748">SQP method</indexitem>
<indexitem target="fmincon.html#434912">SQP method</indexitem>
<indexitem target="fminunc.html#435315">steepest descent</indexitem>
<indexitem target="opt311.html#3856">stopping criteria, large-scale linear programming</indexitem>
<indexitem target="opt312.html#4237">structural rank</indexitem>
<indexitem>subspace
    <indexitem target="opt32.html#3266">determination of</indexitem>
</indexitem>
<indexitem target="opt32.html#3235">subspace, two-dimensional</indexitem>
<indexitem>syntax
    <indexitem target="opttu37a.html#18656">updating to Version 2</indexitem>
</indexitem>
<indexitem target="fsolve.html#190474">system of equations, solving</indexitem>
<indexitem target="opt32.html#3139">trust region</indexitem>
<indexitem target="opt32.html#3235">two-dimensional subspace</indexitem>
<indexitem target="notesto8.html#14201">typographical conventions</indexitem>
<indexitem>unbounded solutions warning
    <indexitem target="linprog.html#191646">linprog</indexitem>
    <indexitem target="quadprog.html#620">quadprog</indexitem>
</indexitem>
<indexitem target="fminsearch.html#188452">unconstrained minimization</indexitem>
<indexitem target="fminunc.html#189308">unconstrained minimization
    <indexitem target="opttut20.html#12003">large-scale example</indexitem>
    <indexitem target="opttut16.html#25828">medium-scale example</indexitem>
    <indexitem target="fminbnd.html#203678">one dimensional</indexitem>
</indexitem>
<indexitem target="opt2pt13.html#131">unconstrained optimization</indexitem>
<indexitem target="opttu37a.html#18656">updating code to Version 2 syntax</indexitem>
<indexitem target="opttut18.html#10960">upper bounds</indexitem>
<indexitem target="opttu14a.html#26782">variable-step ODE solver</indexitem>
<indexitem>Version 2
    <indexitem target="opttu39a.html#18691">changes to calling sequence</indexitem>
    <indexitem target="opttu37a.html#18656">converting Version 1.5 code</indexitem>
</indexitem>
<indexitem>warning
    <indexitem target="quadprog.html#596">equality constraints inconsistent, quadprog</indexitem>
    <indexitem target="linprog.html#437051">infeasible solution, linprog</indexitem>
    <indexitem target="quadprog.html#437247">infeasible solution, quadprog</indexitem>
    <indexitem target="fsolve.html#408412">stuck at minimum, fsolve</indexitem>
    <indexitem target="linprog.html#191646">unbounded solutions, linprog</indexitem>
    <indexitem target="quadprog.html#620">unbounded solutions, quadprog</indexitem>
</indexitem>
<indexitem target="opttut36.html#34238">warnings displayed</indexitem>
<indexitem target="opt2pt23.html#27150">weighted sum strategy</indexitem>
<indexitem target="opt33.html#3359">zero curvature direction</indexitem>
<indexitem target="fsolve.html#190474">zero finding</indexitem>
<indexitem target="fzero.html#437005">zero of a function, finding</indexitem>

</index>
