<?xml version='1.0' encoding='ISO-8859-1'  ?>
<!-- $Revision: 1.1.6.10.10.2 $ $Date: 2005/01/16 02:28:28 $ -->

<index version="1.0">
<indexitem>active constraints
    <indexitem target="linprog.html#191625">linprog example</indexitem>
    <indexitem target="lsqlin.html#413731">lsqlin example</indexitem>
    <indexitem target="quadprog.html#411066">quadprog example</indexitem>
</indexitem>
<indexitem>active set method
    <indexitem target="fmincon.html#411181">fmincon medium-scale algorithm</indexitem>
    <indexitem target="linprog.html#414218">linprog medium-scale algorithm</indexitem>
    <indexitem target="lsqlin.html#264092">lsqlin medium-scale algorithm</indexitem>
    <indexitem target="quadprog.html#355418">quadprog medium-scale algorithm</indexitem>
    <indexitem target="tutor18b.html#26758">sequential quadratic programming (SQP)</indexitem>
</indexitem>
<indexitem target="fgoalattain.html#250">attainment factor</indexitem>
<indexitem target="fzero.html#437184">axis crossing. See zero of a function</indexitem>
<indexitem target="tutori3b.html#130">banana function</indexitem>
<indexitem target="tutori4b.html#144">BFGS formula
    <indexitem target="fmincon.html#411181">fmincon medium-scale algorithm</indexitem>
    <indexitem target="fminunc.html#276919">fminunc medium-scale algorithm</indexitem>
</indexitem>
<indexitem target="bintprog.html#203422">bintprog</indexitem>
<indexitem target="fzero.html#191193">bisection search</indexitem>
<indexitem target="tutori6d.html#3477">bound constraints, large-scale</indexitem>
<indexitem target="tutori6d.html#3477">box constraints. See bound constraints</indexitem>
<indexitem target="tutor11d.html#3810">centering parameter</indexitem>
<indexitem target="tutori2d.html#3266">CG. See conjugate gradients</indexitem>
<indexitem target="tutor11d.html#3772">complementarity conditions</indexitem>
<indexitem>complex variables
    <indexitem target="lsqcurvefit.html#192147">lsqcurvefit</indexitem>
    <indexitem target="lsqnonlin.html#540">lsqnonlin</indexitem>
</indexitem>
<indexitem target="tutori2d.html#3266">conjugate gradients</indexitem>
<indexitem target="fmincon.html#186849">constrained minimization
    <indexitem>large-scale example
        <indexitem target="tutori25.html#15403">with bound constraints and banded preconditioner</indexitem>
        <indexitem target="tutori26.html#16303">with equality constraints</indexitem>
    </indexitem>
    <indexitem target="tutoria8.html#10912">medium-scale example</indexitem>
</indexitem>
<indexitem target="tutor21b.html#27234">-constraint method</indexitem>
<indexitem>constraints
    <indexitem target="tutori5d.html#3397">linear
        <indexitem target="fmincon.html#431228">fmincon</indexitem>
        <indexitem target="fminimax.html#187549">fminimax</indexitem>
    </indexitem>
    <indexitem target="tutori13.html#11119">positive</indexitem>
</indexitem>
<indexitem>continuous derivative
    <indexitem target="tutori3b.html#131">gradient methods</indexitem>
</indexitem>
<indexitem target="tutor15b.html#26598">convex problem</indexitem>
<indexitem target="lsqcurvefit.html#192040">curve-fitting
    <indexitem target="tutoria3.html#29863">categories</indexitem>
    <indexitem target="ref_int2.html#1974">functions that apply 21</indexitem>
</indexitem>
<indexitem target="lsqcurvefit.html#192040">data-fitting
    <indexitem target="tutoria3.html#29863">categories</indexitem>
    <indexitem target="ref_int2.html#1974">functions that apply 21</indexitem>
</indexitem>
<indexitem target="tutor11d.html#3837">dense columns, constraint matrix</indexitem>
<indexitem target="fminunc.html#435315">DFP formula</indexitem>
<indexitem target="tutori2d.html#3283">direction of negative curvature</indexitem>
<indexitem target="tutori43.html#34234">discontinuities</indexitem>
<indexitem>discontinuous problems
    <indexitem target="fminsearch.html#188494">fminsearch</indexitem>
    <indexitem target="fminunc.html#280040">fminunc</indexitem>
</indexitem>
<indexitem target="tutori43.html#34242">discrete variables</indexitem>
<indexitem target="tutor11d.html#3741">dual problem</indexitem>
<indexitem target="tutor11d.html#3777">duality gap</indexitem>
<indexitem>equality constraints
    <indexitem target="tutori32.html#18266">dense columns</indexitem>
    <indexitem target="tutori12.html#11071">medium-scale example</indexitem>
</indexitem>
<indexitem target="quadprog.html#596">equality constraints inconsistent warning, quadprog</indexitem>
<indexitem>equality constraints, linear
    <indexitem target="tutori5d.html#3397">large-scale</indexitem>
</indexitem>
<indexitem>equation solving
    <indexitem target="tutoria3.html#10736">categories</indexitem>
    <indexitem target="ref_int2.html#2586">functions that apply 20</indexitem>
</indexitem>
<indexitem target="tutori22.html#27453">error, Out of memory.</indexitem>
<indexitem target="tutor11d.html#3772">feasibility conditions</indexitem>
<indexitem target="tutor18b.html#26918">feasible point, finding</indexitem>
<indexitem target="fgoalattain.html#814427">fgoalattain
    <indexitem target="tutori17.html#11313">example</indexitem>
</indexitem>
<indexitem target="tutor12d.html#3865">fixed variables</indexitem>
<indexitem target="tutori17.html#26782">fixed-step ODE solver</indexitem>
<indexitem target="fminbnd.html#466368">fminbnd</indexitem>
<indexitem target="fmincon.html#186828">fmincon
    <indexitem>large-scale example
        <indexitem target="tutori25.html#15403">with bound constraints and banded preconditioner</indexitem>
        <indexitem target="tutori26.html#16303">with equality constraints</indexitem>
    </indexitem>
    <indexitem target="tutoria8.html#10912">medium-scale example</indexitem>
</indexitem>
<indexitem target="fminimax.html#187438">fminimax
    <indexitem target="tutori17.html#79540">example</indexitem>
</indexitem>
<indexitem target="fminsearch.html#188436">fminsearch</indexitem>
<indexitem target="fminunc.html#189290">fminunc
    <indexitem target="tutori23.html#12003">large-scale example</indexitem>
    <indexitem target="tutoria7.html#25828">medium-scale example</indexitem>
    <indexitem target="tutori43.html#34226">warning messages</indexitem>
</indexitem>
<indexitem target="fseminf.html#189647">fseminf</indexitem>
<indexitem target="fsolve.html#190456">fsolve
    <indexitem target="tutori20.html#11440">large-scale Jacobian</indexitem>
    <indexitem target="tutori15.html#52557">medium-scale analytic Jacobian</indexitem>
    <indexitem target="tutori16.html#52648">medium-scale finite difference Jacobian</indexitem>
</indexitem>
<indexitem target="fsolve.html#356140">fsolve medium-scale default</indexitem>
<indexitem target="ref_int3.html#10534">function arguments 23</indexitem>
<indexitem target="tutori43.html#34234">function discontinuities</indexitem>
<indexitem>functions
    <indexitem target="ref_intr.html#5533">grouped by category 20</indexitem>
</indexitem>
<indexitem target="tutori9d.html#3696">f(x) = one half ||C times x + d|| squared</indexitem>
<indexitem target="fzero.html#871409">fzero</indexitem>
<indexitem target="fzmult.html#750090">fzmult</indexitem>
<indexitem target="gangstr.html#750280">gangstr</indexitem>
<indexitem>Gauss-Newton method (large-scale)
    <indexitem target="tutori7d.html#3654">nonlinear least-squares</indexitem>
</indexitem>
<indexitem>Gauss-Newton method (medium-scale)
    <indexitem target="tutor14b.html#50873">implementation, nonlinear equations</indexitem>
    <indexitem target="tutor12b.html#210">implementation, nonlinear least squares</indexitem>
    <indexitem target="tutor10b.html#199">least-squares optimization</indexitem>
    <indexitem target="tutor13b.html#51788">solving nonlinear equations</indexitem>
</indexitem>
<indexitem target="tutori43.html#34267">global minimum</indexitem>
<indexitem target="tutor22d.html#27310">goal attainment
    <indexitem target="tutori17.html#11313">example</indexitem>
    <indexitem target="fgoalattain.html#130">fgoalattain</indexitem>
</indexitem>
<indexitem target="fgoalattain.html#251">goaldemo</indexitem>
<indexitem target="fminbnd.html#184879">golden section search</indexitem>
<indexitem target="tutori11.html#11061">gradient checking, analytic</indexitem>
<indexitem target="tutori10.html#11004">gradient examples</indexitem>
<indexitem target="tutoria4.html#75959">gradient function</indexitem>
<indexitem>gradient methods
    <indexitem target="tutori3b.html#131">continuous first derivative</indexitem>
    <indexitem target="tutori4b.html#137">quasi-Newton</indexitem>
    <indexitem target="tutori3b.html#130">unconstrained optimization</indexitem>
</indexitem>
<indexitem target="tutor18b.html#33703">Hessian modified message</indexitem>
<indexitem target="tutor18b.html#33703">Hessian modified twice message</indexitem>
<indexitem target="tutori24.html#15322">Hessian sparsity structure</indexitem>
<indexitem target="tutori7b.html#171">Hessian update
    <indexitem target="tutor18b.html#26691">stage of SQP implementation</indexitem>
</indexitem>
<indexitem target="tutori4b.html#144">Hessian updating methods</indexitem>
<indexitem target="linprog.html#191642">inconsistent constraints</indexitem>
<indexitem target="quadprog.html#752030">indefinite problems</indexitem>
<indexitem target="tutor18b.html#33703">infeasible message</indexitem>
<indexitem target="tutori43.html#34230">infeasible optimization problems</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="tutori42.html#12753">inline objects</indexitem>
<indexitem target="ref_int3.html#10534">input arguments 23</indexitem>
<indexitem target="tutori43.html#34242">integer variables</indexitem>
<indexitem target="tutor10d.html#3718">interior-point linear programming</indexitem>
<indexitem target="tutori2b.html#33771">introduction to optimization</indexitem>
<indexitem>Jacobian
    <indexitem target="tutori15.html#52557">analytic</indexitem>
    <indexitem target="tutori16.html#52648">finite difference</indexitem>
    <indexitem target="tutori20.html#11440">large-scale nonlinear equations</indexitem>
</indexitem>
<indexitem target="tutori21.html#11660">Jacobian sparsity pattern</indexitem>
<indexitem target="tutor15b.html#26598">Kuhn-Tucker equations</indexitem>
<indexitem>Lagrange multipliers
    <indexitem target="tutor12d.html#3870">large-scale linear programming</indexitem>
</indexitem>
<indexitem target="tutori19.html#67829">large-scale functionality coverage</indexitem>
<indexitem target="tutoriab.html#7867">large-scale methods
    <indexitem target="ref_int2.html#2617">demos 21</indexitem>
    <indexitem target="tutori18.html#39857">examples</indexitem>
</indexitem>
<indexitem target="tutor10b.html#202">least squares
    <indexitem target="tutoria3.html#29863">categories</indexitem>
    <indexitem target="ref_int2.html#1974">functions that apply 21</indexitem>
</indexitem>
<indexitem target="tutor11b.html#204">Levenberg-Marquardt method
    <indexitem target="lsqcurvefit.html#437066">lsqcurvefit medium-scale default</indexitem>
    <indexitem target="lsqnonlin.html#437206">lsqnonlin medium-scale default</indexitem>
    <indexitem target="tutor11b.html#207">search direction</indexitem>
</indexitem>
<indexitem>line search
    <indexitem target="fminunc.html#276919">fminunc medium-scale default</indexitem>
    <indexitem target="fsolve.html#356140">fsolve medium-scale default</indexitem>
    <indexitem target="lsqcurvefit.html#410553">lsqcurvefit medium-scale default</indexitem>
    <indexitem target="lsqnonlin.html#280062">lsqnonlin medium-scale default</indexitem>
    <indexitem target="tutori5b.html#15468">unconstrained optimization</indexitem>
</indexitem>
<indexitem target="tutoria5.html#19276">line search strategy</indexitem>
<indexitem target="tutori5d.html#3397">linear constraints
    <indexitem target="fmincon.html#431228">fmincon</indexitem>
    <indexitem target="fminimax.html#187549">fminimax</indexitem>
</indexitem>
<indexitem target="fsolve.html#190575">linear equations solve</indexitem>
<indexitem>linear least squares
    <indexitem target="lsqlin.html#139608">constrained</indexitem>
    <indexitem target="tutori9d.html#3692">large-scale algorithm</indexitem>
    <indexitem target="tutori30.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="tutor18b.html#33659">implementation</indexitem>
    <indexitem target="tutor10d.html#3709">large-scale algorithm</indexitem>
    <indexitem>large-scale example
        <indexitem target="tutori32.html#18266">with dense columns in equalities</indexitem>
        <indexitem target="tutori31.html#94932">with equalities and inequalities</indexitem>
    </indexitem>
    <indexitem target="tutori2b.html#129">problem</indexitem>
</indexitem>
<indexitem target="linprog.html#749961">linprog
    <indexitem>large-scale example
        <indexitem target="tutori32.html#18266">with dense columns in equalities</indexitem>
        <indexitem target="tutori31.html#94932">with equalities and inequalities</indexitem>
    </indexitem>
</indexitem>
<indexitem target="tutor10d.html#3718">LIPSOL</indexitem>
<indexitem target="tutoria9.html#10960">lower bounds</indexitem>
<indexitem target="lsqcurvefit.html#357110">lsqcurvefit</indexitem>
<indexitem target="lsqlin.html#139309">lsqlin
    <indexitem target="tutori30.html#26715">large-scale example</indexitem>
</indexitem>
<indexitem target="lsqnonlin.html#749">lsqnonlin
    <indexitem target="tutori43.html#34250">convergence</indexitem>
    <indexitem target="tutori21.html#11658">large-scale example</indexitem>
    <indexitem target="tutori17.html#79967">medium-scale example</indexitem>
</indexitem>
<indexitem target="lsqnonneg.html#369">lsqnonneg</indexitem>
<indexitem target="tutori13.html#42372">maximization</indexitem>
<indexitem target="tutoriaa.html#10204">medium-scale methods
    <indexitem target="ref_int2.html#4702">demos 22</indexitem>
</indexitem>
<indexitem target="tutor10d.html#3718">Mehrotra's predictor-corrector algorithm</indexitem>
<indexitem target="tutor18b.html#31262">merit function</indexitem>
<indexitem target="tutori17.html#79540">minimax examples</indexitem>
<indexitem target="fminimax.html#187444">minimax problem, solving</indexitem>
<indexitem>minimization
    <indexitem target="tutoria3.html#10640">categories</indexitem>
    <indexitem target="ref_int2.html#3204">functions that apply 20</indexitem>
</indexitem>
<indexitem target="tutor21b.html#27016">multiobjective optimization
    <indexitem target="tutori17.html#11157">examples</indexitem>
    <indexitem target="fgoalattain.html#130">fgoalattain</indexitem>
</indexitem>
<indexitem target="tutori17.html#26782">NCD. See Nonlinear Control Design</indexitem>
<indexitem>negative curvature direction
    <indexitem target="tutori3d.html#3359">in PCG algorithm</indexitem>
    <indexitem target="tutori2d.html#3283">in trust-region methods</indexitem>
</indexitem>
<indexitem target="quadprog.html#752030">negative definite problems</indexitem>
<indexitem target="tutori3b.html#131">Nelder and Mead</indexitem>
<indexitem>Newton direction
    <indexitem target="tutori2d.html#3266">approximate</indexitem>
</indexitem>
<indexitem>Newton's method
    <indexitem target="tutor13b.html#51887">systems of nonlinear equations</indexitem>
    <indexitem target="tutori3b.html#131">unconstrained optimization</indexitem>
</indexitem>
<indexitem target="tutor18b.html#33703">no update message</indexitem>
<indexitem target="quadprog.html#752030">nonconvex problems</indexitem>
<indexitem target="tutor21b.html#27082">noninferior solution</indexitem>
<indexitem target="tutori17.html#26782">Nonlinear Control Design (NCD) Blockset</indexitem>
<indexitem>nonlinear data-fitting
    <indexitem target="fminsearch.html#871841">fminsearch</indexitem>
    <indexitem target="fminunc.html#871784">fminunc</indexitem>
    <indexitem target="lsqnonlin.html#84417">lsqnonlin</indexitem>
</indexitem>
<indexitem>nonlinear equations
    <indexitem target="tutor13b.html#51887">Newton's method</indexitem>
</indexitem>
<indexitem>nonlinear equations (large-scale)
    <indexitem target="tutori20.html#11440">example with Jacobian</indexitem>
    <indexitem target="fsolve.html#190456">solving</indexitem>
</indexitem>
<indexitem target="tutor13b.html#45514">nonlinear equations (medium-scale)
    <indexitem target="tutori15.html#52557">analytic Jacobian example</indexitem>
    <indexitem target="tutori16.html#52648">finite difference Jacobian example</indexitem>
    <indexitem target="tutor13b.html#51788">Gauss-Newton method</indexitem>
    <indexitem target="fsolve.html#190456">solving</indexitem>
    <indexitem target="tutor13b.html#51887">trust-region dogleg method</indexitem>
</indexitem>
<indexitem target="tutor12b.html#208">nonlinear least squares
    <indexitem target="fminsearch.html#871841">fminsearch</indexitem>
    <indexitem target="fminunc.html#871784">fminunc</indexitem>
    <indexitem target="tutori7d.html#3642">large-scale algorithm</indexitem>
    <indexitem target="tutori21.html#11658">large-scale example</indexitem>
    <indexitem target="lsqcurvefit.html#192040">lsqcurvefit</indexitem>
    <indexitem target="lsqnonlin.html#84417">lsqnonlin</indexitem>
</indexitem>
<indexitem target="tutori2b.html#129">nonlinear programming</indexitem>
<indexitem target="tutori7d.html#3675">normal equations</indexitem>
<indexitem target="tutori9d.html#3697">normal equations</indexitem>
<indexitem target="tutoria2.html#10635">objective function
    <indexitem target="tutori43.html#34246">return values</indexitem>
</indexitem>
<indexitem target="tutor11d.html#3747">optimality conditions linear programming</indexitem>
<indexitem target="optimget.html#243287">optimget</indexitem>
<indexitem>optimization
    <indexitem target="ref_intr.html#5533">functions by category 20</indexitem>
    <indexitem target="tutori43.html#34267">getting to a global minimum</indexitem>
    <indexitem target="tutori43.html#34230">handling infeasibility</indexitem>
    <indexitem target="tutori43.html#12775">helpful hints</indexitem>
    <indexitem target="tutori2b.html#33771">introduction</indexitem>
    <indexitem target="tutori43.html#34246">objective function return values</indexitem>
    <indexitem target="tutori43.html#12775">troubleshooting</indexitem>
    <indexitem target="tutori3b.html#130">unconstrained</indexitem>
</indexitem>
<indexitem target="tutori33.html#12472">optimization parameters structure
    <indexitem target="optimget.html#243290">optimget</indexitem>
    <indexitem target="optimset.html#242629">optimset</indexitem>
</indexitem>
<indexitem target="optimset.html#242625">optimset</indexitem>
<indexitem>options parameters
    <indexitem target="ref_int6.html#19175">descriptions 27</indexitem>
    <indexitem target="optimset.html#497358">possible values</indexitem>
    <indexitem target="ref_int2.html#1998">utility functions 21</indexitem>
</indexitem>
<indexitem target="tutori22.html#27453">Out of memory. error</indexitem>
<indexitem target="ref_int3.html#10534">output arguments 23</indexitem>
<indexitem target="tutori35.html#12687">output display</indexitem>
<indexitem target="tutori37.html#12752">output function</indexitem>
<indexitem target="tutori2d.html#3266">PCG. See preconditioned conjugate gradients</indexitem>
<indexitem target="tutori3d.html#3329">preconditioned conjugate gradients
    <indexitem target="tutori3d.html#3346">algorithm</indexitem>
    <indexitem target="tutor11d.html#3837">in large-scale linear programming</indexitem>
    <indexitem target="tutori2d.html#3266">in trust-region methods</indexitem>
</indexitem>
<indexitem target="tutori20.html#11561">preconditioner
    <indexitem target="tutori25.html#15403">banded</indexitem>
    <indexitem target="tutori3d.html#3330">in PCG method</indexitem>
</indexitem>
<indexitem target="tutor11d.html#3791">predictor-corrector algorithm</indexitem>
<indexitem target="tutor12d.html#3862">preprocessing
    <indexitem target="tutor11d.html#3723">linear programming</indexitem>
</indexitem>
<indexitem target="tutor11d.html#3741">primal problem</indexitem>
<indexitem target="tutor11d.html#3781">primal-dual algorithm</indexitem>
<indexitem target="tutor10d.html#3718">primal-dual interior-point</indexitem>
<indexitem>projection method
    <indexitem target="quadprog.html#355418">quadprog medium-scale algorithm</indexitem>
    <indexitem target="tutor18b.html#26758">sequential quadratic programming (SQP)</indexitem>
</indexitem>
<indexitem target="quadprog.html#215">quadprog
    <indexitem target="tutori28.html#36247">large-scale example</indexitem>
</indexitem>
<indexitem target="tutori2b.html#129">quadratic programming
    <indexitem target="fmincon.html#434912">fmincon</indexitem>
    <indexitem target="tutori8d.html#3682">large-scale algorithm</indexitem>
    <indexitem target="tutori28.html#36247">large-scale example</indexitem>
    <indexitem target="quadprog.html#213">quadprog</indexitem>
</indexitem>
<indexitem>quasi-Newton method
    <indexitem target="tutori6b.html#166">implementation</indexitem>
</indexitem>
<indexitem target="tutori4b.html#137">quasi-Newton methods
    <indexitem target="fminunc.html#435315">fminunc medium-scale algorithm</indexitem>
    <indexitem target="tutori4b.html#137">unconstrained optimization</indexitem>
</indexitem>
<indexitem target="tutori8d.html#3687">reflective line search</indexitem>
<indexitem target="tutori6d.html#3490">reflective steps
    <indexitem target="tutori6d.html#3629">definition</indexitem>
</indexitem>
<indexitem target="tutori9b.html#9100">residual</indexitem>
<indexitem target="tutor19b.html#53423">revised simplex algorithm</indexitem>
<indexitem>Rosenbrock
    <indexitem target="fminsearch.html#870869">banana function</indexitem>
</indexitem>
<indexitem target="tutori3b.html#130">Rosenbrock's function</indexitem>
<indexitem target="tutori7d.html#3668">S</indexitem>
<indexitem target="fseminf.html#189732">sampling interval</indexitem>
<indexitem target="tutori2d.html#3221">secular equation</indexitem>
<indexitem target="fseminf.html#189650">semi-infinite constraints</indexitem>
<indexitem target="tutor11d.html#3837">Sherman-Morrison formula</indexitem>
<indexitem target="tutori17.html#11303">signal processing example</indexitem>
<indexitem target="tutoria9.html#10960">simple bounds</indexitem>
<indexitem target="fminsearch.html#188489">simplex search
    <indexitem target="tutori3b.html#131">unconstrained optimization</indexitem>
</indexitem>
<indexitem target="tutori17.html#11160">Simulink, multiobjective example</indexitem>
<indexitem target="tutor12d.html#3869">singleton rows</indexitem>
<indexitem target="tutor13b.html#45514">solving nonlinear systems of equations</indexitem>
<indexitem target="tutori21.html#11660">sparsity pattern Jacobian</indexitem>
<indexitem target="tutori24.html#15322">sparsity structure, Hessian</indexitem>
<indexitem target="tutor16b.html#26624">SQP method
    <indexitem target="fmincon.html#434912">fmincon</indexitem>
    <indexitem target="tutor18b.html#26748">implementation</indexitem>
</indexitem>
<indexitem target="fminunc.html#435315">steepest descent</indexitem>
<indexitem target="tutor11d.html#3856">stopping criteria, large-scale linear programming</indexitem>
<indexitem target="tutor12d.html#4237">structural rank</indexitem>
<indexitem>subspace
    <indexitem target="tutori2d.html#3266">determination of</indexitem>
</indexitem>
<indexitem target="tutori2d.html#3235">subspace, two-dimensional</indexitem>
<indexitem>systems of nonlinear equations
    <indexitem target="fsolve.html#190456">solving</indexitem>
</indexitem>
<indexitem target="tutori2d.html#3139">trust region</indexitem>
<indexitem>trust-region dogleg method (medium-scale)
    <indexitem target="tutor14b.html#50873">implementation for nonlinear equations</indexitem>
    <indexitem target="tutor13b.html#51887">systems of nonlinear equations</indexitem>
</indexitem>
<indexitem target="tutori2d.html#3235">two-dimensional subspace</indexitem>
<indexitem>unbounded solutions warning
    <indexitem target="linprog.html#191646">linprog</indexitem>
    <indexitem target="quadprog.html#620">quadprog</indexitem>
</indexitem>
<indexitem>unconstrained minimization
    <indexitem target="fminsearch.html#188452">fminsearch</indexitem>
    <indexitem target="fminunc.html#189308">fminunc</indexitem>
    <indexitem target="tutori23.html#12003">large-scale example</indexitem>
    <indexitem target="tutoria7.html#25828">medium-scale example</indexitem>
    <indexitem target="fminbnd.html#203678">one dimensional</indexitem>
</indexitem>
<indexitem target="tutori3b.html#130">unconstrained optimization</indexitem>
<indexitem target="tutoria9.html#10960">upper bounds</indexitem>
<indexitem target="tutori17.html#26782">variable-step ODE solver</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="tutori43.html#34238">warnings displayed</indexitem>
<indexitem target="tutor21b.html#27150">weighted sum strategy</indexitem>
<indexitem target="tutori3d.html#3359">zero curvature direction</indexitem>
<indexitem target="fsolve.html#190456">zero finding</indexitem>
<indexitem target="fzero.html#437005">zero of a function, finding</indexitem>
<indexitem target="getting5.html#6804">||C times x minus d|| squared</indexitem>

</index>
