next up previous [pdf]

Next: Results Up: Linear Programming Previous: Mapping Optimization Problems to

$ L_1$ Formulation

To satisfy the $ L_1$ optimization criteria for a data fitting problem, with data $ {\bf d}$ of length $ {N_D}$, and model $ {\bf m}$ of size $ {N_M}$, modeled by $ \vert{\bf Lm - d}\vert = r$, we set up the following to specify the terms in (15) and (16):


$\displaystyle {\bf A}$ $\displaystyle =$ $\displaystyle \begin{bmatrix}{\bf I}_{2N_D} & - {\bf L} \\
{\bf I}_{2N_D} & - {\bf L}
\end{bmatrix}$ (17)
$\displaystyle {\bf b}$ $\displaystyle =$ $\displaystyle \begin{bmatrix}{\bf d} \ {\bf -d} \end{bmatrix}$ (18)
$\displaystyle {\bf c}^{T}$ $\displaystyle =$ $\displaystyle \begin{bmatrix}0 & {\bf 1}_{2N_M} \end{bmatrix}$ (19)

The initial model can be stored in $ {\bf x}$, which will be updated. The final value of auxiliary variables $ {\bf x_s}$ represents the status of the model regularization constraints (which can also be assigned an initial value).

$\displaystyle {\bf x}$ $\displaystyle =$ $\displaystyle {\bf m}$ (20)
$\displaystyle {\bf x_s}$ $\displaystyle =$ $\displaystyle {\bf m}_{regularization}$ (21)

In this format, the matrices can be fed directly into the GLPK function call in C or Octave.


next up previous [pdf]

Next: Results Up: Linear Programming Previous: Mapping Optimization Problems to

2009-10-19