@(@\newcommand{\W}[1]{ \; #1 \; }
\newcommand{\R}[1]{ {\rm #1} }
\newcommand{\B}[1]{ {\bf #1} }
\newcommand{\D}[2]{ \frac{\partial #1}{\partial #2} }
\newcommand{\DD}[3]{ \frac{\partial^2 #1}{\partial #2 \partial #3} }
\newcommand{\Dpow}[2]{ \frac{\partial^{#1}}{\partial {#2}^{#1}} }
\newcommand{\dpow}[2]{ \frac{ {\rm d}^{#1}}{{\rm d}\, {#2}^{#1}} }@)@
This is cppad-20221105 documentation. Here is a link to its
current documentation
.
abs_normal min_nso_linear: Example and Test
Purpose
We minimize the function
@(@
f : \B{R}^3 \rightarrow \B{R}
@)@ defined by
@[@
\begin{array}{rcl}
f( x_0, x_1, x_2 ) & = & x_0^2 + 2 (x_0 + x_1)^2 + | x_2 |
\end{array}
@]@
Discussion
This routine uses abs_min_linear
which uses lp_box
,
a linear programming algorithm.
It is mean to be compared with min_nso_quad.cpp
which uses
a quadratic programing algorithm for the same problem.
To see this comparison, set
level = 1
is both examples.