<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing with OASIS Tables v3.0 20080202//EN" "journalpub-oasis3.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:oasis="http://docs.oasis-open.org/ns/oasis-exchange/table" dtd-version="3.0"><?xmltex \makeatother\@nolinetrue\makeatletter?>
  <front>
    <journal-meta>
<journal-id journal-id-type="publisher">GMD</journal-id>
<journal-title-group>
<journal-title>Geoscientific Model Development</journal-title>
<abbrev-journal-title abbrev-type="publisher">GMD</abbrev-journal-title>
<abbrev-journal-title abbrev-type="nlm-ta">Geosci. Model Dev.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">1991-9603</issn>
<publisher><publisher-name>Copernicus GmbH</publisher-name>
<publisher-loc>Göttingen, Germany</publisher-loc>
</publisher>
</journal-meta>

    <article-meta>
      <article-id pub-id-type="doi">10.5194/gmd-8-791-2015</article-id><title-group><article-title>Optimization of model parameters and experimental designs with the Optimal Experimental Design Toolbox (v1.0) exemplified by sedimentation in salt marshes</article-title>
      </title-group><?xmltex \runningtitle{Optimization of model parameters and experimental designs}?><?xmltex \runningauthor{J.~Reimer et al.}?>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes" rid="aff1">
          <name><surname>Reimer</surname><given-names>J.</given-names></name>
          <email>jor@informatik.uni-kiel.de</email>
        <ext-link>https://orcid.org/0000-0002-1831-5401</ext-link></contrib>
        <contrib contrib-type="author" corresp="no" rid="aff2">
          <name><surname>Schuerch</surname><given-names>M.</given-names></name>
          
        </contrib>
        <contrib contrib-type="author" corresp="no" rid="aff1">
          <name><surname>Slawig</surname><given-names>T.</given-names></name>
          
        </contrib>
        <aff id="aff1"><label>1</label><institution>Institute of Computer Science, Future Ocean – Kiel Marine
Sciences, Christian-Albrechts-University Kiel,<?xmltex \hack{\newline}?> 24098 Kiel,
Germany</institution>
        </aff>
        <aff id="aff2"><label>2</label><institution>Institute of Geography, Future Ocean – Kiel Marine
Sciences, Christian-Albrechts-University Kiel, 24098 Kiel, Germany</institution>
        </aff>
      </contrib-group>
      <author-notes><corresp id="corr1">J. Reimer (jor@informatik.uni-kiel.de)</corresp></author-notes><pub-date><day>25</day><month>March</month><year>2015</year></pub-date>
      
      <volume>8</volume>
      <issue>3</issue>
      <fpage>791</fpage><lpage>804</lpage>
      <history>
        <date date-type="received"><day>6</day><month>August</month><year>2014</year></date>
           <date date-type="rev-request"><day>26</day><month>September</month><year>2014</year></date>
           <date date-type="rev-recd"><day>23</day><month>January</month><year>2015</year></date>
           <date date-type="accepted"><day>9</day><month>March</month><year>2015</year></date>
      </history>
      <permissions>
<license license-type="open-access">
<license-p>This work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/3.0/">http://creativecommons.org/licenses/by/3.0/</ext-link></license-p>
</license>
</permissions><self-uri xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015.html">This article is available from https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015.html</self-uri>
<self-uri xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015.pdf">The full text article is available as a PDF file from https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015.pdf</self-uri>


      <abstract>
    <p>The geosciences are a highly suitable field of application for optimizing model
parameters and experimental designs especially because many data are
collected.</p>
    <p>In this paper, the weighted least squares estimator for optimizing model
parameters is presented together with its asymptotic properties. A popular
approach to optimize experimental designs called local optimal experimental
designs is described together with a lesser known approach which takes into
account the potential nonlinearity of the model parameters. These two
approaches have been combined with two methods to solve their underlying
discrete optimization problem.</p>
    <p>All presented methods were implemented in an open-source MATLAB toolbox
called the <italic>Optimal Experimental Design Toolbox</italic> whose structure and
application is described.</p>
    <p>In numerical experiments, the model parameters and experimental design were
optimized using this toolbox. Two existing models for sediment concentration
in seawater and sediment accretion on salt marshes of different complexity
served as an application example. The advantages and disadvantages of these
approaches were compared based on these models.</p>
    <p>Thanks to optimized experimental designs, the parameters of these models
could be determined very accurately with significantly fewer measurements
compared to unoptimized experimental designs. The chosen optimization
approach played a minor role for the accuracy; therefore, the approach with the
least computational effort is recommended.</p>
  </abstract>
    </article-meta>
  </front>
<body>
      

<sec id="Ch1.S1" sec-type="intro">
  <title>Introduction</title>
      <p>Mathematical models often contain roughly known model parameters which are
optimized based on measurements. The resulting accuracy of the model
parameters depends on the conditions, also called experimental setups or
experimental designs, under which these measurements are carried out. These
experimental designs can be optimized so that the resulting accuracy is
maximized. Thus, the effort and cost of measurements can be significantly
reduced.</p>
      <p>The optimization of experimental designs is therefore particularly
interesting for geosciences, where much money is spent on data collection.
However, few application examples exist in this field (see
<xref ref-type="bibr" rid="bib1.bibx12" id="altparen.1"/>, for an overview). This article aims to promote this
approach in geosciences and exemplarily apply it to an existing salt marsh
accretion model (<xref ref-type="bibr" rid="bib1.bibx27" id="altparen.2"/>).</p>
      <p>In optimizing experimental design, the main problem is to quantify the
information content of the measurements to be planned. In general, this can
only be done approximatively. There are several approaches available. In
Sect. <xref ref-type="sec" rid="Ch1.S2"/>, four different approaches to
optimize experimental designs together with the weighted least squares
estimator for model parameters are presented. Each of these four approaches
makes a different trade-off between accuracy and computational effort.</p>
      <p>One approach is based on the linearization of the model with respect to the
parameters and is the most common used approach called local optimal
experimental design. The second more robust approach takes into account the
potential nonlinearity of the model parameters. Both approaches are combined
with two different approaches of solving the underlying discrete optimization
problem.</p>
      <p>To the author's knowledge, there is no open-source software available that
can apply all four of these approaches. The only software using this robust
approach is a closed-source software called VPLAN which was introduced in
<xref ref-type="bibr" rid="bib1.bibx16" id="text.3"/>. For the local optimal approach, several implementations
are available, but there is no open-source software written in MATLAB. All
four approaches, together with approaches to optimize model parameters, were
implemented in a MATLAB toolbox called the <italic>Optimal Experimental Design Toolbox</italic>. Its structure and application is described in
Sect. <xref ref-type="sec" rid="Ch1.S3"/>.</p>
      <p>We have chosen two models as application examples, simulating the suspended sediment concentration on
salt marshes during tidal inundation and resulting accretion rates on these
marshes
(<xref ref-type="bibr" rid="bib1.bibx15 bib1.bibx31 bib1.bibx27" id="altparen.4"/>). Both models are zero-dimensional point models and
differ in their complexity and number of parameters. These models can be used
as a basis to predict the survival capability of salt marshes under the
influence of expected global sea level rise.</p>
      <p>To use these models for local salt marshes, their parameters have to be
adapted to the local environmental conditions. The required measurements are
very time-consuming and costly. Using the presented approaches, these
measurements could be carried out much more efficiently. These two models are
described together with the attendant numerical experiments and the
associated results in Sect. <xref ref-type="sec" rid="Ch1.S4"/>.</p>
</sec>
<sec id="Ch1.S2">
  <?xmltex \opttitle{Optimization of model parameters and\hack{\break} experimental designs}?><title>Optimization of model parameters and<?xmltex \hack{\break}?> experimental designs</title>
      <p>The first step to the optimization of model parameters is the choice of the
estimator. This maps the measurement results onto estimated model parameters.
These estimated parameters are often defined so that they minimize a
so-called misfit function. The misfit function quantifies the distance
between the measurement results and the model output.</p>
      <p>The estimator should be derived from the statistical properties of the
measurement errors, for example, a maximum likelihood estimator. Often the
measurement errors are assumed to be normally distributed; this leads to the
least squares estimators. They are the most widely used class of estimators
since their introduction by Gauss and Legendre (<xref ref-type="bibr" rid="bib1.bibx30" id="altparen.5"/>).</p>
      <p>Their simplest form is the ordinary least squares estimator. Its misfit
function is the sum of the squares of the differences between each
measurement result and the corresponding model output. A generalization is
the weighted least squares estimator which has advantages in the event of
heteroscedastic measurement errors. This estimator and its asymptotic
properties are presented in the following subsection. The generalized least
squares estimator is a further generalization which takes into account the
stochastic dependence of the measurement errors.</p>
<sec id="Ch1.S2.SS1">
  <title>The weighted least squares estimator</title>
      <p>In the following, the weighted least squares estimator is presented. For this
purpose, some notations and assumptions are introduced.</p>
      <p>The model function is denoted by

                <disp-formula id="Ch1.Ex1"><mml:math display="block"><mml:mrow><mml:mi>f</mml:mi><mml:mo>:</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>

          Here, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub><mml:mo>⊆</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the set of feasible
experimental designs, and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>⊂</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> is the set of
feasible model parameters from which the unknown exact parameter vector
<inline-formula><mml:math display="inline"><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is to be determined. Often these sets are
defined by lower and upper bounds.</p>
      <p>The measurement result for every design <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is considered
as a realization of a random variable <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">η</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. Each random variable
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">η</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is assumed to be normally distributed with the expectation
<inline-formula><mml:math display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> and standard deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi></mml:msub><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>.<def-list>
            <def-item><term>A1a.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">η</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi></mml:msub><mml:mo>∼</mml:mo><mml:mi mathvariant="script">N</mml:mi><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>,</mml:mo><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for every <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
          </def-list>Furthermore, these random variables are assumed to be pairwise stochastically
independent.<def-list>
            <def-item><term>A1b.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">η</mml:mi><mml:mi mathvariant="bold-italic">x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">η</mml:mi><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> are stochastically independent for every <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
          </def-list></p>
      <p>If we consider <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> measurement results <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>=</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> with corresponding experimental
designs <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, the weighted least
squares estimation <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the corresponding estimator <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are
defined as
            <disp-formula id="Ch1.E1" content-type="numbered"><mml:math display="block"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:=</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>)</mml:mo><mml:mo>:=</mml:mo><mml:munder><mml:mtext>arg min</mml:mtext><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:munder><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msub><mml:mi mathvariant="italic">ψ</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:math></disp-formula>
          where the misfit function <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ψ</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is defined as

                <disp-formula id="Ch1.Ex2"><mml:math display="block"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ψ</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mi>n</mml:mi></mml:msup><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>,</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:mo>↦</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msup><mml:mfenced close=")" open="("><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p>With the following assumptions, the existence of a minimum is ensured.<def-list>
            <def-item><term>A2.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>,</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>⋅</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is continous for every <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A3.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is compact (closed and bounded).</p>
            </def></def-item>
          </def-list>If <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="italic">ψ</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">y</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is convex, the minimum is also unique.</p>
      <p>The parameter estimation <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in
Eq. (<xref ref-type="disp-formula" rid="Ch1.E1"/>) can be calculated with
an optimization method for continuous optimization problems. A possible
method is the sequential quadratic programming (SQP) algorithm which is, for
example, described in <xref ref-type="bibr" rid="bib1.bibx23" id="text.6"><named-content content-type="post">chapter 18</named-content></xref>.</p>
</sec>
<sec id="Ch1.S2.SS2">
  <title>Asymptotic properties</title>
      <p>Provided certain regularity conditions are met, the least squares estimators
are consistent, asymptotically normally distributed and asymptotically
efficient.</p>
      <p>These asymptotic properties were first proved by <xref ref-type="bibr" rid="bib1.bibx14" id="text.7"/> for the
ordinary least squares estimator and also discussed in <xref ref-type="bibr" rid="bib1.bibx19" id="text.8"/>
and <xref ref-type="bibr" rid="bib1.bibx37" id="text.9"/>. In <xref ref-type="bibr" rid="bib1.bibx35" id="text.10"/>, these properties were proved for the
weighted least squares estimator and for the generalized least squares
estimator in <xref ref-type="bibr" rid="bib1.bibx36" id="text.11"/>. A good summary for all three can be
found in <xref ref-type="bibr" rid="bib1.bibx1" id="text.12"/>.</p>
      <p>Consistency means that the estimated parameters converge in probability to
the unknown exact parameters as the number of measurements goes to infinity;
that is,

                <disp-formula id="Ch1.Ex3"><mml:math display="block"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mover accent="true"><mml:mi mathvariant="italic">⟶</mml:mi><mml:mi>p</mml:mi></mml:mover><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mtext>as</mml:mtext><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi>n</mml:mi><mml:mo>→</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow></mml:math></disp-formula>

          for the weighted least squares estimator <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> with the unknown exact model
parameters <inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula>.</p>
      <p>For consistency, the following assumptions are sufficient in addition to the
previous assumptions A1 to A3 <xref ref-type="bibr" rid="bib1.bibx28" id="paren.13"><named-content content-type="post">p. 565</named-content></xref>.<def-list>
            <def-item><term>A4a.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>B</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> converges uniformly with <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>B</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>,</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:mo>↦</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A4b.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>D</mml:mi><mml:mo mathvariant="normal">¯</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>⇒</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:mrow></mml:math></inline-formula> for all
<inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> with <inline-formula><mml:math display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>D</mml:mi><mml:mo mathvariant="normal">¯</mml:mo></mml:mover><mml:mo>:=</mml:mo><mml:munder><mml:mo movablelimits="false">lim⁡</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>→</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow></mml:munder><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>D</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>,</mml:mo><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:mo>↦</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>(</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msup><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>)</mml:mo><mml:msup><mml:mo>)</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> (<inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi>D</mml:mi><mml:mo mathvariant="normal">¯</mml:mo></mml:mover></mml:math></inline-formula> is well defined by
assumption A4a).</p>
            </def></def-item>
          </def-list></p>
      <p>An estimator is asymptotically efficient if its variance converges to the
Cramér–Rao bound as the number of measurements goes to infinity. The
Cramér–Rao bound (<xref ref-type="bibr" rid="bib1.bibx7 bib1.bibx25" id="altparen.14"/>) is a lower bound for the
variance of any unbiased estimator.</p>
      <p>For asymptotic efficiency, the following assumptions are sufficient in
addition to the previous assumptions A1 to A4 <xref ref-type="bibr" rid="bib1.bibx28" id="paren.15"><named-content content-type="post">p. 571</named-content></xref>.<def-list>
            <def-item><term>A5.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> is an interior point of <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.
Let <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="normal">Ω</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub><mml:mo>⊆</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> be an open neighborhood of
<inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A6.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is twice continuously differentiable
in <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi mathvariant="normal">Ω</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A7.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> converges uniformly with <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="normal">Ω</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>↦</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A8.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>H</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> converges uniformly with <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>H</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mover accent="true"><mml:mi mathvariant="normal">Ω</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mi>p</mml:mi></mml:msub><mml:mo>→</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>↦</mml:mo><mml:msub><mml:mfenced close=")" open="("><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:munderover><mml:mo>(</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mo>∂</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mo>∂</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>∂</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:mfrac><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>)</mml:mo><mml:msup><mml:mo>)</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:msup><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msubsup></mml:mfenced><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>A9.</term><def>

      <p><inline-formula><mml:math display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>M</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is invertible with <inline-formula><mml:math display="inline"><mml:mrow><mml:mover accent="true"><mml:mi>M</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>:=</mml:mo><mml:munder><mml:mo movablelimits="false">lim⁡</mml:mo><mml:mrow><mml:mi>n</mml:mi><mml:mo>→</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow></mml:munder><mml:msup><mml:mi>n</mml:mi><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
            </def></def-item>
          </def-list></p>
      <p>In this case, the Cramér–Rao bound of the weighted least squares
estimator <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the inverse of the Fisher information matrix
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
      <p>Under these assumptions, the asymptotic behavior of the weighted least
squares estimator can be summarized by its convergence in distribution as
follows:
            <disp-formula id="Ch1.E2" content-type="numbered"><mml:math display="block"><mml:mrow><mml:msqrt><mml:mi>n</mml:mi></mml:msqrt><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>)</mml:mo><mml:mover accent="true"><mml:mi mathvariant="italic">⟶</mml:mi><mml:mi>d</mml:mi></mml:mover><mml:mi mathvariant="script">N</mml:mi><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mi>n</mml:mi><mml:mo>)</mml:mo><mml:mtext> as </mml:mtext><mml:mi>n</mml:mi><mml:mo>→</mml:mo><mml:mi mathvariant="normal">∞</mml:mi></mml:mrow></mml:math></disp-formula>
          (see, e.g., <xref ref-type="bibr" rid="bib1.bibx28" id="altparen.16"><named-content content-type="post">chapter 12</named-content></xref> and
<xref ref-type="bibr" rid="bib1.bibx34" id="altparen.17"><named-content content-type="post">chapter 3</named-content></xref>).</p>
</sec>
<sec id="Ch1.S2.SS3">
  <title>Optimal experimental designs</title>
      <p>The accuracy of the weighted least square estimator <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> can be described by
its covariance matrix. Due to the asymptotic distribution
(Eq. <xref ref-type="disp-formula" rid="Ch1.E2"/>), this can be approximated by
the inverse of the information matrix <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>, provided the matrix
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is nonsingular, that is,
            <disp-formula id="Ch1.E3" content-type="numbered"><mml:math display="block"><mml:mrow><mml:mtext>cov</mml:mtext><mml:mo>(</mml:mo><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>≈</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p>Therefore, the unknown model parameters can be determined more accurately the
smaller the (approximated) covariance matrix of the estimator is.</p>
      <p>Criteria <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>:</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mo>→</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mo>∪</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mi mathvariant="normal">∞</mml:mi><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, such as the trace or determinant, are used in order to compare
these matrices (see, e.g., <xref ref-type="bibr" rid="bib1.bibx8" id="altparen.18"/>, for an overview of various
criteria). If the approximation (Eq. <xref ref-type="disp-formula" rid="Ch1.E3"/>)
is used and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is singular, the value of <inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula> is set to
infinity.</p>
      <p>In the context of optimizing experimental designs, we assume <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>n</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>
measurements have been carried out and designs for additional measurements
should be selected from <inline-formula><mml:math display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula> designs <inline-formula><mml:math display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mn mathvariant="normal">1</mml:mn><mml:mo>′</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:mi mathvariant="normal">…</mml:mi><mml:mo>,</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>m</mml:mi><mml:mo>′</mml:mo></mml:msubsup><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>x</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>. The choice for each design <inline-formula><mml:math display="inline"><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi><mml:mo>′</mml:mo></mml:msubsup></mml:mrow></mml:math></inline-formula> is expressed by a weight
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo mathvariant="italic">}</mml:mo></mml:mrow></mml:math></inline-formula>, where <inline-formula><mml:math display="inline"><mml:mn mathvariant="normal">1</mml:mn></mml:math></inline-formula> indicates the selection and <inline-formula><mml:math display="inline"><mml:mn mathvariant="normal">0</mml:mn></mml:math></inline-formula> the contrary.</p>
      <p>Hence, the resulting information matrix, depending on the choice <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> and the parameter vector <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>∈</mml:mo><mml:msub><mml:mi mathvariant="normal">Ω</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, is defined as

                <disp-formula specific-use="align"><mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>:=</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>+</mml:mo><mml:munderover><mml:mo movablelimits="false">∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:msub><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mfrac><mml:mrow><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi><mml:mo>′</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi><mml:mo>′</mml:mo></mml:msubsup><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup></mml:mrow><mml:mrow><mml:msubsup><mml:mi mathvariant="italic">σ</mml:mi><mml:mrow><mml:msubsup><mml:mi mathvariant="bold-italic">x</mml:mi><mml:mi>i</mml:mi><mml:mo>′</mml:mo></mml:msubsup></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup></mml:mrow></mml:mfrac><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p>If the covariance matrix is approximated by the inverse of the information
matrix, optimal (additional) designs, with respect to a criterion <inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula>, are
expressed by a solution of
            <disp-formula id="Ch1.E4" content-type="numbered"><mml:math display="block"><mml:mrow><mml:munder><mml:mtext>arg min</mml:mtext><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
          These optimal designs are called local optimal designs because these designs
are only optimal regarding the previous model parameter estimation
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and not the unknown exact model parameters <inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula>.</p>
      <p>Potential constraints on the choice of the designs can be realized by
constraints on the weight <inline-formula><mml:math display="inline"><mml:mi mathvariant="bold-italic">w</mml:mi></mml:math></inline-formula>. For example, the number or the cost of
the measurements can be limited by linear constraints on <inline-formula><mml:math display="inline"><mml:mi mathvariant="bold-italic">w</mml:mi></mml:math></inline-formula>. These
constraints have to be considered in the above optimization problem
(Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>).</p>
      <p>The formulation (Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>) is useful if additional
experimental designs should be chosen from a finite number of experimental
designs. Otherwise, the optimization problem can be reformulated so that the
additional optimal design variables have to be optimized directly.</p>
</sec>
<sec id="Ch1.S2.SS4">
  <title>Calculation of optimal experimental designs</title>
      <p>A straight-forward way to solve the optimization problem
(Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>) is to test all possible values of <inline-formula><mml:math display="inline"><mml:mi mathvariant="bold-italic">w</mml:mi></mml:math></inline-formula>.
This direct approach is only practical for small <inline-formula><mml:math display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>.</p>
      <p>For bigger <inline-formula><mml:math display="inline"><mml:mi>m</mml:mi></mml:math></inline-formula>, the optimization problem (Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>) is
solved approximately. For this purpose, it is solved in the continuous rather
than the discrete setting; that is, the constraint <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula> is
relaxed to <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>. Accordingly, the problem
            <disp-formula id="Ch1.E5" content-type="numbered"><mml:math display="block"><mml:mrow><mml:munder><mml:mtext>arg min</mml:mtext><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo>[</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo>]</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>
          is solved.</p>
      <p>A possible algorithm to solve this continuous optimization problem is the SQP
algorithm which is, for example, described in <xref ref-type="bibr" rid="bib1.bibx23" id="text.19"><named-content content-type="post">chapter 18</named-content></xref>.</p>
      <p>After the continuous problem (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) is
solved, its solution is projected onto integers with heuristics. An easy way
is to round the continuous solution. Another is to sum up all continuous
weights and then to choose as many designs with the highest continuous
weights. Potential constraints on <inline-formula><mml:math display="inline"><mml:mi>w</mml:mi></mml:math></inline-formula> still have to be considered by solving
the continuous problem and the following projection onto an integer solution.
The second heuristic, for example, preserves constraints on the number of
designs to choose.</p>
      <p>Our numerical experiments with the application examples in
Sect. <xref ref-type="sec" rid="Ch1.S4"/> have shown that the solutions of the
continuous problem (Eq. <xref ref-type="disp-formula" rid="Ch1.E5"/>) are already close
to integer values. This behavior was also observed, for example, in
<xref ref-type="bibr" rid="bib1.bibx16" id="text.20"/> and <xref ref-type="bibr" rid="bib1.bibx17" id="text.21"/>.</p>
</sec>
<sec id="Ch1.S2.SS5">
  <title>Robust optimal experimental designs</title>
      <p>The information matrix <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> depends on the estimated parameters <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
if the parameters are nonlinear. This may lead to suboptimal designs if
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> differs strongly from <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mi>f</mml:mi><mml:mo>(</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
      <p>For this reason, we now consider a method which takes into account a possible
nonlinearity of the parameters. This robust method was presented in
<xref ref-type="bibr" rid="bib1.bibx16" id="text.22"/> and <xref ref-type="bibr" rid="bib1.bibx17" id="text.23"/>.</p>
      <p>The main idea of the method is not to optimize the quality of the covariance
matrix for a single parameter vector <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> as in
Eq. (<xref ref-type="disp-formula" rid="Ch1.E4"/>), but to optimize the worst case quality
within a whole domain which contains the unknown exact parameter vector
<inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> with high probability.</p>
      <p>For this purpose, a confidence region which contains <inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover></mml:math></inline-formula> with
probability <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="italic">α</mml:mi><mml:mo>∈</mml:mo><mml:mo>(</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is approximated by
            <disp-formula id="Ch1.E6" content-type="numbered"><mml:math display="block"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo><mml:mo>:=</mml:mo><mml:mfenced close="}" open="{"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mo>|</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>‖</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msubsup><mml:mo>‖</mml:mo><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mn mathvariant="normal">2</mml:mn></mml:msubsup><mml:mo>≤</mml:mo><mml:mi mathvariant="italic">γ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo></mml:mfenced><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
          Here, <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="italic">γ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is the <inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> quantile of the <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mi mathvariant="italic">χ</mml:mi><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula> distribution
and <inline-formula><mml:math display="inline"><mml:mrow><mml:mo>‖</mml:mo><mml:mi mathvariant="bold-italic">v</mml:mi><mml:msub><mml:mo>‖</mml:mo><mml:mi mathvariant="bold">A</mml:mi></mml:msub><mml:mo>:=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mi mathvariant="bold-italic">v</mml:mi><mml:mi>T</mml:mi></mml:msup><mml:mi mathvariant="bold">A</mml:mi><mml:mi mathvariant="bold-italic">v</mml:mi></mml:mrow></mml:msqrt></mml:mrow></mml:math></inline-formula> denotes
the energy norm of the vector <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">v</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> with respect to
the positive definite matrix <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold">A</mml:mi><mml:mo>∈</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mrow><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>×</mml:mo><mml:msub><mml:mi>n</mml:mi><mml:mi>p</mml:mi></mml:msub></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>.
The approximation of the confidence region arises from linearization of the
model function <inline-formula><mml:math display="inline"><mml:mi>f</mml:mi></mml:math></inline-formula> in point <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and the assumption <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>∼</mml:mo><mml:mi mathvariant="script">N</mml:mi><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula>.</p>
      <p>If the worst case quality in the entire region <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> shall be
optimized, the optimization problem (Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>) becomes
            <disp-formula id="Ch1.E7" content-type="numbered"><mml:math display="block"><mml:mrow><mml:munder><mml:mtext>arg min</mml:mtext><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace width="0.25em" linebreak="nobreak"/><mml:munder><mml:mo movablelimits="false">max⁡</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:munder><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula></p>
      <p>This minimum–maximum optimization problem can be solved only with
considerably more computational effort compared to the optimization problem
(Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>). In order to reduce this effort, the
function <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mo>⋅</mml:mo><mml:mspace linebreak="nobreak" width="0.25em"/><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> is linearized in point <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>
in the following way:

                <disp-formula specific-use="align"><mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>≈</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mspace width="1em" linebreak="nobreak"/><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p>The resulting inner maximization problem can be solved analytically. It is

                <disp-formula specific-use="align"><mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:munder><mml:mo movablelimits="false">max⁡</mml:mo><mml:mrow><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>∈</mml:mo><mml:msub><mml:mi>G</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:munder><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:msup><mml:mo>)</mml:mo><mml:mi>T</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mi mathvariant="italic">γ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mfrac><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:msup><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:msub><mml:mo>‖</mml:mo><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:msub><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

            as can be seen, for example, in <xref ref-type="bibr" rid="bib1.bibx16" id="text.24"/>. With this approach the
optimization problem (Eq. <xref ref-type="disp-formula" rid="Ch1.E7"/>) is replaced by

                <disp-formula specific-use="align" content-type="numbered"><mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:munder><mml:mtext>arg min</mml:mtext><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mspace width="0.25em" linebreak="nobreak"/><mml:mspace linebreak="nobreak" width="0.25em"/><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mlabeledtr id="Ch1.E8"><mml:mtd/><mml:mtd/><mml:mtd><mml:mrow><mml:mspace width="1em" linebreak="nobreak"/><mml:mo>+</mml:mo><mml:mi mathvariant="italic">γ</mml:mi><mml:mo>(</mml:mo><mml:mi mathvariant="italic">α</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mfrac><mml:mn mathvariant="normal">1</mml:mn><mml:mn mathvariant="normal">2</mml:mn></mml:mfrac></mml:msup><mml:mo>‖</mml:mo><mml:msub><mml:mi mathvariant="normal">∇</mml:mi><mml:mi>p</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:msub><mml:mo>‖</mml:mo><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:msub><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mlabeledtr></mml:mtable></mml:math></disp-formula></p>
      <p>This optimization problem again can be solved approximatively by solving the
corresponding continuous problem and projecting this solution onto an integer
solution as described in the previous subsection.</p>
      <p>It should be noted that in this approach
(Eq. <xref ref-type="disp-formula" rid="Ch1.E8"/>), the first and second derivatives
of the model are used. In contrast, only the first derivative is used for
local optimal designs (Eq. <xref ref-type="disp-formula" rid="Ch1.E4"/>).</p>
</sec>
<sec id="Ch1.S2.SS6">
  <title>Efficiency of experimental designs</title>
      <p>A common way to describe the benefit of an experimental design is its
efficiency. The efficiency of an experimental design <inline-formula><mml:math display="inline"><mml:mrow><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:math></inline-formula>
regarding a criterion <inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula> and with <inline-formula><mml:math display="inline"><mml:mi>n</mml:mi></mml:math></inline-formula> previous measurements is defined as
follows:
            <disp-formula id="Ch1.E9" content-type="numbered"><mml:math display="block"><mml:mrow><mml:msub><mml:mi>E</mml:mi><mml:mi mathvariant="italic">ϕ</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>)</mml:mo><mml:mo>:</mml:mo><mml:mo>=</mml:mo><mml:munder><mml:mo movablelimits="false">min⁡</mml:mo><mml:mrow><mml:mover accent="true"><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>∈</mml:mo><mml:mo mathvariant="italic">{</mml:mo><mml:mn mathvariant="normal">0</mml:mn><mml:mo>,</mml:mo><mml:mn mathvariant="normal">1</mml:mn><mml:msup><mml:mo mathvariant="italic">}</mml:mo><mml:mi>m</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mstyle displaystyle="true"><mml:mfrac style="display"><mml:mrow><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">ϕ</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>M</mml:mi><mml:mi>n</mml:mi></mml:msub><mml:mo>(</mml:mo><mml:mi mathvariant="bold-italic">w</mml:mi><mml:mo>,</mml:mo><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo mathvariant="normal" stretchy="false">^</mml:mo></mml:mover><mml:msup><mml:mo>)</mml:mo><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:mfrac></mml:mstyle><mml:mo>.</mml:mo></mml:mrow></mml:math></disp-formula>
          It should be noted that the searched parameter vector <inline-formula><mml:math display="inline"><mml:mover accent="true"><mml:mi mathvariant="bold-italic">p</mml:mi><mml:mo stretchy="false" mathvariant="normal">^</mml:mo></mml:mover></mml:math></inline-formula> is used
here. If this is not known then the efficiency can not be calculated.</p>
      <p>The efficiency is always between 0 and 1 and is larger the better the
experimental design is.</p>
</sec>
</sec>
<sec id="Ch1.S3">
  <title>The Optimal Experimental Design Toolbox</title>
      <p>We implemented the methods presented in the previous section for optimization
of model parameters and experimental designs as a MATLAB toolbox named the
<italic>Optimal Experimental Design Toolbox</italic>.</p>
      <p>MATLAB (<xref ref-type="bibr" rid="bib1.bibx21" id="altparen.25"/>) was chosen because it supports vector and matrix
operations and provides many numerical algorithms, especially for
optimization. Moreover, MATLAB supports object oriented programming and
therefore permits a simple structuring, modification and extension of the
implementation. Another advantage of MATLAB is that it can easily interact
with C and Fortran.</p>
      <p>The toolbox is available at a Git repository (<xref ref-type="bibr" rid="bib1.bibx26" id="altparen.26"/>)
under the GNU General Public License (<xref ref-type="bibr" rid="bib1.bibx10" id="altparen.27"/>). It includes extensive
commented source code, a detailed help integrated in MATLAB and a user
manual.</p>
<sec id="Ch1.S3.SS1">
  <title>Provision of the model function</title>
      <p>For the methods described in Sect. <xref ref-type="sec" rid="Ch1.S2"/>,
the model function and its first and second derivative with respect to the
model parameters are required.</p>
      <p>Actually, the model function is required for the parameter optimization and,
depending on the optimization method, also its first derivative. Its first
derivative is also required for the experimental design optimization. If the
robust method is used its second derivative is also required.</p>
      <p>The <italic>model</italic> interface prescribes how to provide these functions. They
need not be written in MATLAB itself, since MATLAB can call functions in C,
C++ or Fortran.</p>
      <p>The toolbox has several possibilities to provide the derivatives
automatically. The <italic>model</italic>_<italic>fd</italic> class, for example, provides
the derivatives by approximation with finite differences. If the model
function is given as an explicit symbolic function, the
<italic>model</italic>_<italic>explicit</italic> class can provide the derivatives by
symbolic differentiation with the <italic>Symbolic Math Toolbox</italic>.
Listing <xref ref-type="fig" rid="Ch1.F1"/> shows, for example, how a
<italic>model</italic>_<italic>explicit</italic> object is created.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F1"><caption><p>Create a model with a symbolic model
function.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l01.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>In the event that the model function is given as a solution of an initial
value problem, the <italic>Optimal Experimental Design Toolbox</italic> contains the
<italic>model</italic>_<italic>ivp</italic> class. This class solves the parameter dependent
initial value problem and calculates the necessary derivatives.
Listing <xref ref-type="fig" rid="Ch1.F2"/> shows how a <italic>model</italic>_<italic>ivp</italic> object is
created.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F2"><caption><p>Create a model with a model function
given as solution of an initial value problem.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l02.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>The class takes advantage of the fact that the integration and
differentiation of the differential equation can be interchanged if the model
function is sufficiently often continuously differentiable. Required
derivatives of the differential equation and initial value are calculated
again by symbolic differentiation with the <italic>Symbolic Math Toolbox</italic>.
The resulting initial value problems are solved with MATLAB's <italic>ode23s</italic>
function which can also solve stiff problems. Since the arising initial value
problems for the derivatives are mutually independent, the solutions of the
initial value problems can be calculated in parallel using the
<italic>Parallel Computing Toolbox</italic>.</p>
</sec>
<sec id="Ch1.S3.SS2">
  <title>Setup of the solver</title>
      <p>Methods for the optimization of model parameters and experimental designs are
provided by the <italic>solver</italic> class. First, a <italic>solver</italic> object has to
be created and the necessary information has to be passed.</p>
      <p>On the one hand, this is the <italic>model</italic> which has to be set by the
<italic>set</italic>_<italic>model</italic> method (see Listing <xref ref-type="fig" rid="Ch1.F3"/>).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F3"><caption><p>Set the model.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l03.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>On the other hand, an initial guess of the model parameters have to be set by
the <?xmltex \hack{\mbox\bgroup}?><italic>set_initial_parameter_estimation</italic><?xmltex \hack{\egroup}?> method (see
Listing <xref ref-type="fig" rid="Ch1.F4"/>).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F4"><caption><p>Set the initial parameter
estimation.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l04.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>Potential accomplished measurements can be set via the
<?xmltex \hack{\mbox\bgroup}?><italic>set_accomplished_measurements</italic><?xmltex \hack{\egroup}?> method. These measurements
consist of the corresponding experimental designs together with their
variances of the measurement errors. Furthermore, the measurement results themselves
have to be passed for a parameter estimation (see
Listing <xref ref-type="fig" rid="Ch1.F5"/>).</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F5"><caption><p>Set accomplished
measurements.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l05.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>Finally, if an optimization of experimental designs shall be performed, the
selectable measurements have to be set by the
<italic>set</italic>_<italic>selectable</italic>_<italic>measurements</italic> method (see
Listing <xref ref-type="fig" rid="Ch1.F6"/>). These measurements consist of
the experimental designs as well as the variances of the measurement errors.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F6"><caption><p>Set selectable
measurements.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l06.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

<?xmltex \hack{\newpage}?>
</sec>
<sec id="Ch1.S3.SS3">
  <?xmltex \opttitle{Optimization of experimental designs and\hack{\break} model parameters}?><title>Optimization of experimental designs and<?xmltex \hack{\break}?> model parameters</title>
      <p>Once the <italic>solver</italic> object is configured as described in the previous
subsection, experimental designs or model parameters can be optimized via the
<italic>get</italic>_<italic>optimal</italic>_<italic>measurements</italic> (see
Listing <xref ref-type="fig" rid="Ch1.F7"/>) or the
<italic>get</italic>_<italic>optimal</italic>_<italic>parameters</italic> (see
Listing <xref ref-type="fig" rid="Ch1.F8"/>) method, respectively. Constraints on
the experimental designs or model parameters can be passed to the
corresponding method.</p>
      <p>The <italic>get</italic>_<italic>optimal</italic>_<italic>measurements</italic> method can solve
the optimization problem directly by trying all possible combinations or
approximatively.</p>
      <p>For the approximative solving, the continuous problem is solved with the SQP
algorithm (see <xref ref-type="bibr" rid="bib1.bibx23" id="altparen.28"/>, Chapter 18) provided by the
<italic>fmincon</italic> function of the <italic>Optimization Toolbox</italic>. Its solution
is projected onto an integer solution by the second heuristic described in
Sect. <xref ref-type="sec" rid="Ch1.S2.SS4"/>.</p>
      <p>The first derivative of the objective function is provided in analytical
form. This saves much of the computing time compared to derivatives
calculated by finite differences. The Hessian matrix is approximated by the
Broyden–Fletcher–Goldfarb–Shanno (BFGS) update
(<xref ref-type="bibr" rid="bib1.bibx3 bib1.bibx9 bib1.bibx11 bib1.bibx29" id="altparen.29"/>).</p>
      <p>MATLAB's SQP algorithm can recover from infinity. If an infinite function
value is reached during the optimization, the algorithm attempts to take a
smaller step. Thus, if the optimization is started with a regular design,
singular designs do not make any trouble.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F7"><caption><p>Optimize experimental
designs.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l07.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>The <italic>get</italic>_<italic>optimal</italic>_<italic>parameters</italic> method uses the
trust-region-reflective (<xref ref-type="bibr" rid="bib1.bibx5 bib1.bibx6" id="altparen.30"/>) or the
Levenberg–Marquard algorithm (<xref ref-type="bibr" rid="bib1.bibx18 bib1.bibx20 bib1.bibx22" id="altparen.31"/>)
provided by the <italic>lsqnonlin</italic> function of the <italic>Optimization Toolbox</italic> to solve the least squares problem resulting from the parameter
estimation. The first derivative of the objective function is also provided
analytically.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F8"><caption><p>Optimize model
parameters.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l08.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p>Furthermore, the expected quality of the resulting parameter estimation for
any selection of experimental designs can be calculated using the
<italic>get</italic>_<italic>quality</italic> method of the <italic>solver</italic> object. Thus,
for example, the increase in quality by adding or removing experimental
designs can be determined.</p>
</sec>
<sec id="Ch1.S3.SS4">
  <title>Execution time and memory consumption</title>
      <p>The total time required for the optimization of the model parameters or an
experimental design depends crucially on the time required for evaluating the
model function and its first and second derivative with respect to the model
parameters.</p>
      <p>When optimizing model parameters, the model function and its first derivative
has to be evaluated several times with different model parameter vectors at
the accomplished measuring points. When optimizing experimental designs, the
model function and its first and second derivative has to be evaluated for
one model parameter vector but at the accomplished and selectable measuring
points.</p>
      <p>Generally, the execution time increases with the number of parameters, the
number of selectable measurements and the number of accomplished
measurements.</p>
      <p>The implementation of this toolbox favors a low execution time of a low
memory consumption. For this reason, (intermediate) results within a method
call and between successive method calls are saved and reused. An example is
multiple occurring matrix multiplications within a method call. Another
example is a re-optimization of designs with other constraints, such as
another maximum number of allowed measurements. Here, the derivatives of the
model function calculated in the previous optimization are reused.</p>
      <p>Due to the described caching strategy, the total memory consumption depends
linearly on the number of (accomplished and selectable) measurements and
quadratically on the number of parameters. Nevertheless, it should be
possible to solve problems with hundreds of parameters and thousands of
measurements on a standard computer.</p>
</sec>
<sec id="Ch1.S3.SS5">
  <title>Changeable options</title>
      <p>Many settings for the optimization of experimental designs or model
parameters are changeable. These can be altered by the
<italic>set</italic>_<italic>option</italic> method of the <italic>solver</italic> object (see
Listing <xref ref-type="fig" rid="Ch1.F9"/>). The desired options can be set using
property-value pairs, as already known from MATLAB.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F9"><caption><p>Change an
option.</p></caption>
          <?xmltex \igopts{width=236.157874pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-l09.pdf"/>
          <?xmltex \hack{\def\figurename{Listing}}?>

        </fig>

      <p><def-list>
            <def-item><term>Estimation method:</term><def>

      <p>The estimation method for the quality of
experimental designs can be selected by the
<italic>estimation</italic>_<italic>method</italic> option. The standard <italic>point</italic>
estimation method and the robust <italic>region</italic> estimation method, both
presented in Sect. <xref ref-type="sec" rid="Ch1.S2"/>, are supported.
The <italic>region</italic> estimation method is the default setting.</p>
            </def></def-item>
            <def-item><term>Confidence level:</term><def>

      <p>The level of confidence for the confidence region at
the <italic>region</italic> estimation method, represented by <inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">α</mml:mi></mml:math></inline-formula> in
Sect. <xref ref-type="sec" rid="Ch1.S2.SS5"/>, can be set by the <italic>alpha</italic> option.
The default value is <inline-formula><mml:math display="inline"><mml:mn>0.95</mml:mn></mml:math></inline-formula>.</p>
            </def></def-item>
            <def-item><term>Prior parameter estimation:</term><def>

      <p>It can be chosen whether a parameter
optimization should be performed before optimizing experimental designs. This
can be set by the <italic>parameter</italic>_<italic>estimation</italic> option and the
values <italic>yes</italic> or <italic>no</italic>. To save computational time no previous
parameter optimization is performed by default.</p>
            </def></def-item>
            <def-item><term>Quality criterion:</term><def>

      <p>The quality criterion, which is applied to the
covariance matrix and represented in Sect. <xref ref-type="sec" rid="Ch1.S2.SS1"/> as
<inline-formula><mml:math display="inline"><mml:mi mathvariant="italic">ϕ</mml:mi></mml:math></inline-formula>, can also be chosen with the <italic>criterion</italic> option. The
<italic>criterion</italic> interface prescribes the syntax of the criterion function
and its necessary derivatives. The trace of the covariance is the default
criterion and implemented by the <italic>criterion</italic>_<italic>A</italic> class.</p>
            </def></def-item>
            <def-item><term>Parameter scaling:</term><def>

      <p>It can be chosen whether model parameter should be
scaled before optimizing experimental designs or the model parameters
themselves. Scaling means a uniform impact of all model parameters and is
enabled by default. The options are
<italic>edo</italic>_<italic>scale</italic>_<italic>parameters</italic> and
<italic>po</italic>_<italic>scale</italic>_<italic>parameters</italic> with the values <italic>yes</italic>
and <italic>no</italic>.</p>
            </def></def-item>
            <def-item><term>Optimization algorithm for experimental design:</term><def>

      <p>The exact and the
approximative approach for the optimization of an experimental design problem
can be chosen with the <italic>edo</italic>_<italic>algorithm</italic> option and the values
<italic>direct</italic> and <italic>local</italic>_<italic>sqp</italic>. For time reasons, by
default the experimental design problem is solved by the approximative
approach. Furthermore, the number of function evaluations and iterations by
the SQP algorithm can be constrained by the options
<italic>edo</italic>_<italic>max</italic>_<italic>fun</italic>_<italic>evals</italic> and
<italic>edo</italic>_<italic>max</italic>_<italic>iter</italic>.</p>
            </def></def-item>
            <def-item><term>Optimization algorithm for parameter estimation:</term><def>

      <p>The optimization
algorithm for the parameter estimation problem can be chosen with the
<italic>po</italic>_<italic>algorithm</italic> option. The trust-region-reflective
(<xref ref-type="bibr" rid="bib1.bibx5 bib1.bibx6" id="altparen.32"/>) and the Levenberg–Marquard algorithm
(<xref ref-type="bibr" rid="bib1.bibx18 bib1.bibx20 bib1.bibx22" id="altparen.33"/>) can be chosen with the values
<italic>trust-region-reflective</italic> and Levenberg–Marquardt The
trust-region-reflective algorithm is the default algorithm. Furthermore, the
number of function evaluations and iterations can be limited through the
options <italic>po</italic>_<italic>max</italic>_<italic>fun</italic>_<italic>evals</italic> and
<italic>po</italic>_<italic>max</italic>_<italic>iter</italic>.</p>
            </def></def-item>
          </def-list></p>
</sec>
<sec id="Ch1.S3.SS6">
  <title>Help and documentation</title>
      <p>The <italic>Optimal Experimental Design Toolbox</italic> also provides extensive
integrated help. Besides system requirements and version information, a
user's guide with step-by-step instructions on how to optimize experimental
designs and model parameters is included. Demos show how to work with the
toolbox in practice. In addition, a detailed description for every class and
method is available.</p>
      <p>The layout of the help for the <italic>Optimal Experimental Design Toolbox</italic>
is based on the design of the help also used by MATLAB and other toolboxes.
Thus, the user does not have to get reoriented with a new layout.</p>
</sec>
</sec>
<sec id="Ch1.S4">
  <title>Application examples</title>
      <p>In this section, numerical experiments together with their results regarding
the optimization of model parameters and experimental designs are presented
for two models of different complexity. Both models describe the sediment
concentration in seawater during tidal inundation of coastal salt marshes.</p>
      <p>Coastal salt marshes have an important ecological function with their diverse
flora and as a nursery for migratory birds. Furthermore, they have the role
of dissipating current and wave energy and therefore reducing erosional
forces at dikes and coastal areas.</p>
      <p>With these models, the vertical accretion of coastal salt marshes can be
predicted. When considering expected global sea level rise
(<xref ref-type="bibr" rid="bib1.bibx13" id="altparen.34"/>), the future ability of coastal salt marshes to adapt to
rising sea levels and thus to survive can be estimated. Depending on these estimates,
measures to protect these salt marshes can be taken.</p>
      <p>Calibration of the model parameters requires measurements of suspended
sediment concentration during tidal inundation, which are time-consuming and
laborious. For this reason, it is advantageous to know under which conditions
and how many of these measurements should be carried out.</p>
<sec id="Ch1.S4.SS1">
  <title>The models</title>
      <p>Both models are zero-dimensional point models, which describe the sediment
concentration in seawater during tidal inundation of coastal salt marshes.
The first model (C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model) has two model parameters, was described in
<xref ref-type="bibr" rid="bib1.bibx31" id="text.35"/> and was adapted for a salt marsh in
the Wadden Sea (southeastern North Sea), located near Hoernum in the southern
part of the island of Sylt (Germany), by
<xref ref-type="bibr" rid="bib1.bibx27" id="text.36"/>. The second model (C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model)
has three model parameters, is an extension of the first model and subject of
current research.</p>
<sec id="Ch1.S4.SS1.SSS1">
  <?xmltex \opttitle{The C${}_{2}$-model}?><title>The C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model</title>
      <p>The first model is called the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model. Here, the sediment concentration
in kg m<inline-formula><mml:math display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> is modeled by the function <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>C</mml:mi><mml:mo>:</mml:mo><mml:mo>[</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>→</mml:mo><mml:msup><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>. Furthermore, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the start time of the
inundation of the salt marsh and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the end time. The
concentration <inline-formula><mml:math display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula> is given implicitly as the solution of the initial value
problem
              <disp-formula id="Ch1.E10" content-type="numbered"><mml:math display="block"><mml:mtable rowspacing="0.2ex" class="split" columnspacing="1em" displaystyle="true" columnalign="left"><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:msup><mml:mi>C</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:mfenced open="{" close=""><mml:mtable rowspacing="0.2ex" columnspacing="1em" class="cases" columnalign="left left" framespacing="0em"><mml:mtr><mml:mtd><mml:mstyle displaystyle="false"><mml:mfrac><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>+</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>-</mml:mo><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd><mml:mtd><mml:mrow><mml:mtext> if </mml:mtext><mml:msup><mml:mi>h</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>&gt;</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mstyle displaystyle="false"><mml:mfrac><mml:mrow><mml:mo>-</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:mfrac></mml:mstyle></mml:mtd><mml:mtd><mml:mtext> else </mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:mfenced></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd/><mml:mtd><mml:mrow><mml:mtext>for all </mml:mtext><mml:mi>t</mml:mi><mml:mo>∈</mml:mo><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mtext> and </mml:mtext><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mo>)</mml:mo><mml:mo>=</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
      <p>Here, <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> is the initial sediment concentration of the flooding
seawater and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> the settling velocity of the suspended
sediment in m s<inline-formula><mml:math display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>. Moreover, the function

                  <disp-formula id="Ch1.Ex11"><mml:math display="block"><mml:mrow><mml:mi>h</mml:mi><mml:mo>:</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>→</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>↦</mml:mo><mml:mfrac><mml:mi>a</mml:mi><mml:mrow><mml:mn mathvariant="normal">1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mfenced close=")" open="("><mml:mfrac><mml:mrow><mml:mi>t</mml:mi><mml:mo>-</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow><mml:mi>b</mml:mi></mml:mfrac></mml:mfenced><mml:mn mathvariant="normal">2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mo>+</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">HW</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">MHW</mml:mi></mml:msub></mml:mrow></mml:math></disp-formula>

            describes the time-dependent water surface elevation and <inline-formula><mml:math display="inline"><mml:mi>E</mml:mi></mml:math></inline-formula> the elevation of
the marsh both in meters and relative to a fixed datum. Here, <inline-formula><mml:math display="inline"><mml:mi>a</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math display="inline"><mml:mi>b</mml:mi></mml:math></inline-formula> and
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are constants describing the change in the water level,
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">MHW</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the mean high water level and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">HW</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> the high water
level of a certain tidal inundation in meters. The start <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and end time
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>t</mml:mi><mml:mi mathvariant="normal">E</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of the inundation are the points where the
height <inline-formula><mml:math display="inline"><mml:mi>h</mml:mi></mml:math></inline-formula> equals the elevation of the marsh <inline-formula><mml:math display="inline"><mml:mi>E</mml:mi></mml:math></inline-formula>.</p>
      <p>The sediment concentration <inline-formula><mml:math display="inline"><mml:mi>C</mml:mi></mml:math></inline-formula> thus decreases continuously within a tidal
cycle depending on the settling velocity <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> which is described by
the term

                  <disp-formula id="Ch1.Ex12"><mml:math display="block"><mml:mrow><mml:mo>-</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></disp-formula>

            in Eq. (<xref ref-type="disp-formula" rid="Ch1.E10"/>). During the flood phase, the reduced sediment
concentration is partially compensated by new inflowing sea water. This is
described by the term

                  <disp-formula id="Ch1.Ex13"><mml:math display="block"><mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:mo>-</mml:mo><mml:mi>C</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>)</mml:mo><mml:msup><mml:mi>h</mml:mi><mml:mo>′</mml:mo></mml:msup><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mrow><mml:mi>h</mml:mi><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo><mml:mo>-</mml:mo><mml:mi>E</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>

            in the first case of Eq. (<xref ref-type="disp-formula" rid="Ch1.E10"/>).</p>
      <p>The values used in the water surface elevation function <inline-formula><mml:math display="inline"><mml:mi>h</mml:mi></mml:math></inline-formula>, for the local
salt marsh, are shown in Table <xref ref-type="table" rid="Ch1.T1"/>. These have been
estimated by nonlinear regression analysis using local historic tide gauge
data from 1999 to 2009 (at Hoernum Hafen, Germany). The continuous
high-resolution (6 min) time series has, therefore, been split into the
individual tidal cycles beforehand
(<xref ref-type="bibr" rid="bib1.bibx27" id="altparen.37"/>).</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T1"><caption><p>Values used for the water surface elevation function <inline-formula><mml:math display="inline"><mml:mi>h</mml:mi></mml:math></inline-formula></p></caption><oasis:table frame="topbot"><oasis:tgroup cols="6">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="left"/>
     <oasis:colspec colnum="3" colname="col3" align="left"/>
     <oasis:colspec colnum="4" colname="col4" align="left"/>
     <oasis:colspec colnum="5" colname="col5" align="left"/>
     <oasis:colspec colnum="6" colname="col6" align="left"/>
     <oasis:thead>
       <oasis:row rowsep="1">  
         <oasis:entry colname="col1"/>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mi>a</mml:mi></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mi>b</mml:mi></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col5"><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">MHW</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col6"><inline-formula><mml:math display="inline"><mml:mi>E</mml:mi></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>  
         <oasis:entry colname="col1">local value</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>3.7506</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mn>19447.1</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mrow><mml:mo>-</mml:mo><mml:mn>1301.0</mml:mn></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col5"><inline-formula><mml:math display="inline"><mml:mn>3.75</mml:mn></mml:math></inline-formula> <inline-formula><mml:math display="inline"><mml:mi mathvariant="normal">m</mml:mi></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col6"><inline-formula><mml:math display="inline"><mml:mn>1.3</mml:mn></mml:math></inline-formula><inline-formula><mml:math display="inline"><mml:mi mathvariant="normal">m</mml:mi></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

      <p>The high water level <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">HW</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of the current tidal inundation is
measured or taken from predictions.</p>
      <p>The initial sediment concentration <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and the settling velocity
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are only roughly known and therefore model parameters.
Reference values derived from literature values and typical ranges can be
found in Table <xref ref-type="table" rid="Ch1.T2"/> (see <xref ref-type="bibr" rid="bib1.bibx2" id="altparen.38"/>, for
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <xref ref-type="bibr" rid="bib1.bibx31" id="altparen.39"/>, for <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and
<inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>).</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T2"><caption><p>Values for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="3">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="left"/>
     <oasis:colspec colnum="3" colname="col3" align="left"/>
     <oasis:thead>
       <oasis:row rowsep="1">  
         <oasis:entry colname="col1"/>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>  [kg m<inline-formula><mml:math display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">3</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>]</oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> [m s<inline-formula><mml:math display="inline"><mml:msup><mml:mi/><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>]</oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>  
         <oasis:entry colname="col1">reference value</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>0.1</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">  
         <oasis:entry colname="col1">typical range</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>0.01</mml:mn></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mn>0.2</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:mn mathvariant="normal">4</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">6</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mrow><mml:mn mathvariant="normal">4</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>  
         <oasis:entry colname="col1">start value</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn mathvariant="normal">5</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">7</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>  
         <oasis:entry colname="col1">optimization bound</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mn mathvariant="normal">4</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–1</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

</sec>
<sec id="Ch1.S4.SS1.SSS2">
  <?xmltex \opttitle{The C${}_{3}$-model}?><title>The C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model</title>
      <p>The second model is an extension of the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model and is called the
C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model. Here the model parameters <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> are
substituted by

                  <disp-formula specific-use="align"><mml:math display="block"><mml:mtable displaystyle="true"><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mi>k</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">HW</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>E</mml:mi><mml:mo>)</mml:mo><mml:mo>,</mml:mo></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mi mathvariant="normal">S</mml:mi></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:mo>(</mml:mo><mml:msub><mml:mi>C</mml:mi><mml:mn mathvariant="normal">0</mml:mn></mml:msub><mml:msup><mml:mo>)</mml:mo><mml:mi>s</mml:mi></mml:msup><mml:mo>=</mml:mo><mml:mi>r</mml:mi><mml:msup><mml:mi>k</mml:mi><mml:mi>s</mml:mi></mml:msup><mml:mo>(</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mi mathvariant="normal">HW</mml:mi></mml:msub><mml:mo>-</mml:mo><mml:mi>E</mml:mi><mml:msup><mml:mo>)</mml:mo><mml:mi>s</mml:mi></mml:msup><mml:mo>.</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>

              Where <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>r</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math display="inline"><mml:mrow><mml:mi>s</mml:mi><mml:mo>≥</mml:mo><mml:mn mathvariant="normal">0</mml:mn></mml:mrow></mml:math></inline-formula> are unknown model parameters.
Reference values derived from literature values and typical ranges (where
available) can be found in Table <xref ref-type="table" rid="Ch1.T3"/> (see
<xref ref-type="bibr" rid="bib1.bibx33" id="altparen.40"/>, and <xref ref-type="bibr" rid="bib1.bibx24" id="altparen.41"/>, for the settling index
<inline-formula><mml:math display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula> and <xref ref-type="bibr" rid="bib1.bibx32" id="altparen.42"/>, for <inline-formula><mml:math display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula>).</p>
      <p>In this model, a linear relationship between the initial sediment
concentration and the high water level is assumed, where during heavy
flooding a higher sediment concentration is assumed
(<xref ref-type="bibr" rid="bib1.bibx31 bib1.bibx27" id="altparen.43"/>).
Additionally, a relationship between the initial sediment concentration and
the settling velocity is assumed (<xref ref-type="bibr" rid="bib1.bibx15" id="altparen.44"/>). This is an empirical
approximation of the so-called flocculation process (<xref ref-type="bibr" rid="bib1.bibx4" id="altparen.45"/>).</p>

<?xmltex \floatpos{t}?><table-wrap id="Ch1.T3"><caption><p>Values for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model.</p></caption><oasis:table frame="topbot"><oasis:tgroup cols="4">
     <oasis:colspec colnum="1" colname="col1" align="left"/>
     <oasis:colspec colnum="2" colname="col2" align="left"/>
     <oasis:colspec colnum="3" colname="col3" align="left"/>
     <oasis:colspec colnum="4" colname="col4" align="left"/>
     <oasis:thead>
       <oasis:row rowsep="1">  
         <oasis:entry colname="col1"/>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mi>k</mml:mi></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mi>r</mml:mi></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mi>s</mml:mi></mml:math></inline-formula></oasis:entry>
       </oasis:row>
     </oasis:thead>
     <oasis:tbody>
       <oasis:row>  
         <oasis:entry colname="col1">reference value</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>0.25</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">5</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mn>0.5</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row rowsep="1">  
         <oasis:entry colname="col1">typical range</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>0.04</mml:mn></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mn>0.2</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"/>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mn>0.5</mml:mn></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mn>3.5</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>  
         <oasis:entry colname="col1">start value</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mn>12.5</mml:mn></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:mn mathvariant="normal">2</mml:mn><mml:mo>×</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">7</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mn mathvariant="normal">3</mml:mn></mml:math></inline-formula></oasis:entry>
       </oasis:row>
       <oasis:row>  
         <oasis:entry colname="col1">optimization bound</oasis:entry>  
         <oasis:entry colname="col2"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">4</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–<inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mn mathvariant="normal">4</mml:mn></mml:msup></mml:mrow></mml:math></inline-formula></oasis:entry>  
         <oasis:entry colname="col3"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">8</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–1</oasis:entry>  
         <oasis:entry colname="col4"><inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula>–5</oasis:entry>
       </oasis:row>
     </oasis:tbody>
   </oasis:tgroup></oasis:table></table-wrap>

</sec>
</sec>
<sec id="Ch1.S4.SS2">
  <title>Numerical experiments</title>
      <p>We performed several numerical experiments to compare the benefit of
optimized with unoptimized measurement conditions. Also, the benefit of
different approaches to optimization measurement conditions was compared.
Using these results, an appropriate approach for the optimization of
conditions for real measurements was selected.</p>
      <p>The approaches introduced in Sect. <xref ref-type="sec" rid="Ch1.S2"/>
and implemented by the <italic>Optimal Experimental Design Toolbox</italic> described
in Sect. <xref ref-type="sec" rid="Ch1.S3"/> were used for the numerical experiments. For
that, we used the <italic>model</italic>_<italic>ivp</italic> class which allows for the
calculation of the solution of an initial value problem and its first and
second derivatives with respect to the model parameters. The C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model was
implemented by the <italic>model</italic>_<italic>C2</italic> class and the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model by
the <italic>model</italic>_<italic>C3</italic> class which is a subclass of the
<italic>model</italic>_<italic>C2</italic> class.</p>
      <p>For our numerical experiments, we used the model output with the reference
parameters in Tables <xref ref-type="table" rid="Ch1.T2"/> and <xref ref-type="table" rid="Ch1.T3"/> plus an
additive normally distributed measurement error with zero expectation as
artificial measurement results. As standard deviation of the measurement
error, we chose <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> once and <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">1</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> once.</p>
      <p>In our numerical experiments, we alternately selected a fixed number of
experimental designs and estimated the model parameters with corresponding
measurement results. We carried out each experiment 10 times and averaged
the results to minimize the influence of randomness.</p>
      <p>For the parameter estimation, the start values and bounds in
Tables <xref ref-type="table" rid="Ch1.T2"/> and <xref ref-type="table" rid="Ch1.T3"/> were used. The bounds
were chosen so that the typical range of values is covered, but also more
extreme values are possible. The starting values were chosen slightly outside
the typical ranges to represent a poor initial guess.</p>
      <p>The experimental designs for these models consist of the time point of the
measurement and the high water level of the tidal inundation. A set of thirty
selectable experimental designs was specified. They were obtained by
combining three different high water levels of the tidal inundation (1.5, 2.0
and 2.5 m) with 10 time points equidistantly spread over the inundation
period.</p>
      <p>For choosing the experimental designs, we compared the standard and the
robust approach presented in Sect. <xref ref-type="sec" rid="Ch1.S3"/> with the trace as
quality criterion together with uniformly distributed experimental designs.
In the robust approach, a confidence level of 95 % was used. The
optimization problems for the experimental designs were once solved exactly
and once approximatively (see Sect. <xref ref-type="sec" rid="Ch1.S2.SS4"/>). To evaluate
all these methods, we compared the resulting parameter estimations with the
reference model parameters.</p>
      <p>We further investigated whether the number of measurements after which new
experimental designs are optimized had an impact on the accuracy of the
parameter estimation. For this purpose, different numerical experiments were
performed where the parameters and experimental designs have been optimized
after each one, three and five measurements. Altogether 50 measurements
were simulated at each experiment with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model. For the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model,
150 measurements were simulated at each experiment since the
model is more complex and therefore a sufficiently accurate estimation of its
parameters might be more difficult.</p>
</sec>
<sec id="Ch1.S4.SS3">
  <title>Accuracy of the parameter estimations</title>
      <p>In this subsection, we compare the accuracy of the parameter estimations
resulting from the previously described numerical experiments. Some results
are illustrated in Figs. <xref ref-type="fig" rid="Ch1.F10"/> and
<xref ref-type="fig" rid="Ch1.F11"/>.</p>
<sec id="Ch1.S4.SS3.SSS1">
  <?xmltex \opttitle{Results for the C${}_{2}$-model}?><title>Results for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model</title><?xmltex \hack{\setcounter{figure}{0}}?><?xmltex \floatpos{t}?><fig id="Ch1.F10" specific-use="star"><caption><p>Averaged error in the parameter estimation from 10 optimization
runs with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration with standard
deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
            <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f01.png"/>

          </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F11" specific-use="star"><caption><p>Averaged error in the parameter estimation from 10 optimization
runs with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration with standard
deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
            <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f02.png"/>

          </fig>

      <p>The accuracy of the parameter estimations for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model only improved
marginally after four to twelve measurements independent of the choice of
the experimental designs. The accuracy improved faster the more frequently
the experimental designs and parameters were optimized. However, the best
achieved accuracy was independent of the frequency.</p>
      <p>With uniformly distributed experimental designs the best achieved accuracy
was slightly worse than with optimized experimental designs. Four to six more
measurements were needed compared to optimized experimental designs in order
to achieve their accuracy.</p>
      <p>Although the parameters occur nonlinearly in this model, it made close to no
difference whether the standard or the robust approach for the optimization
of the experimental designs was used.</p>
      <p>The approximate solving of the discrete optimization problem has resulted in
slightly worse accuracy at the first iterations compared to the exact
solving. Thereafter, the difference was very small. The solutions of the
relaxed continuous optimization problems were almost always nearly integer.</p>
      <p>The different standard deviations of the measurement errors only influenced
the best achieved accuracy which was of course worse at a higher standard
deviation. This can be explained by the fact that different constant standard
deviations only mean a different scaling of the objective of the experimental
design optimization problem. Thus, different constant standard deviations do
not affect its solution.</p>
</sec>
<sec id="Ch1.S4.SS3.SSS2">
  <?xmltex \opttitle{Results for the C${}_{3}$-model}?><title>Results for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model</title>
      <p>After 10–25 measurements, the accuracy of the parameter
estimations for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model with optimized experimental designs only
improved slightly. Again, the fewer
measurements performed per iteration the faster the accuracy improved, and the best achieved accuracy was
independent of the number of measurements per iteration.</p>
      <p>With uniformly distributed experimental designs, the best accuracy was
achieved after 24–60 measurements. Furthermore, the best
achieved accuracy was worse by about a factor of 10 compared to the best
accuracy achieved by (standard) optimized experimental designs.</p>
      <p>The standard approach for optimizing experimental designs resulted in a
slightly better accuracy compared to the robust approach.</p>
      <p>For both approaches, the difference between the accuracy achieved with the
exact solutions of the discrete optimization problem and the accuracy
achieved with the approximate solutions was small but recognizable and almost
constant over the iterations. Also in these experiments, the solutions of the
relaxed continuous optimization problems were almost all nearly integer.</p>
      <p>Again, the different standard deviations of the measurement errors only
influenced the best achieved accuracy.</p>
</sec>
<sec id="Ch1.S4.SS3.SSS3">
  <title>Conclusions regarding the approach for optimizing experimental designs</title>
      <p>Optimized experimental designs provided a much more accurate parameter
estimation than uniformly distributed experimental designs independent of the
chosen optimization approach. Furthermore, only about half as many
measurements were needed to archive the same accuracy with optimized
experimental designs as with uniformly distributed experimental designs. In
the more complex model, the difference was even bigger.</p>
      <p>The robust approach did not achieved higher accuracy compared to the standard
approach. In the complex model, the robust approach was even slightly less
accurate. This may indicate that the gain in accuracy by taking into account
the nonlinearity is offset by the additional approximations in the robust
approach. Since a considerably higher computational effort is associated with
the robust approach, the standard approach should be preferred, at least for
these models.</p>
      <p>The exact solutions of the discrete optimization problems yielded only
slightly better accuracy gains compared to its approximate solutions. The
fact that the approximate solutions were almost all nearly integer also
argues for the approximate solving. This circumstance was also observed in
<xref ref-type="bibr" rid="bib1.bibx16" id="text.46"/> and <xref ref-type="bibr" rid="bib1.bibx17" id="text.47"/>. For these
reasons and because the exact solving requires much more computational
effort, the approximate solving should be preferred, at least for these
models.</p>
</sec>
</sec>
<sec id="Ch1.S4.SS4">
  <title>Efficiency for the experimental designs</title>
      <p>We also calculated the efficiencies of the used experimental designs. Some
results are illustrated in Figs. <xref ref-type="fig" rid="Ch1.F12"/> and
<xref ref-type="fig" rid="Ch1.F13"/>.</p>

      <?xmltex \floatpos{t}?><fig id="Ch1.F12" specific-use="star"><caption><p>Averaged efficiency for the experimental designs from 10
optimization runs with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration
with standard deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
          <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f03.png"/>

        </fig>

      <?xmltex \floatpos{t}?><fig id="Ch1.F13" specific-use="star"><caption><p>Averaged efficiency for the experimental designs from 10
optimization runs with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration
with standard deviation <inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
          <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f04.png"/>

        </fig>

      <p>The results emphasized the already seen importance of the optimization of the
experimental designs. In particular, the advantage in the case of the few
measurements carried out so far was highlighted. Again, the slight advantage
of the standard approach over the robust approach was visible. With
increasing number of accomplished measurements, the selection strategy of new
measurements became less important as the amount and thus the influence of
the new measurements compared to those of the accomplished measurements
decreased.</p>
</sec>
<sec id="Ch1.S4.SS5">
  <title>Distribution of optimal measuring points</title>
      <p>In this subsection, we compare the distribution of the measuring points
optimized in the previously described numerical experiments. Graphical
representation of the distribution of the measuring points from some
numerical experiments are shown in
Figs. <xref ref-type="fig" rid="Ch1.F14"/> and
<xref ref-type="fig" rid="Ch1.F15"/>.</p>
<sec id="Ch1.S4.SS5.SSS1">
  <?xmltex \opttitle{Distribution for the C${}_{2}$-model}?><title>Distribution for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model</title>

      <?xmltex \floatpos{t}?><fig id="Ch1.F14" specific-use="star"><caption><p>Averaged frequency of measurements from 10 optimization runs with
the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration with standard deviation
<inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
            <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f05.png"/>

          </fig>

      <p>The optimized measuring points were almost exclusively located at the start
and end of the inundation periods. At the start of the inundation period,
both approaches in the exact variant favored lower high water levels unlike
both approaches in the approximate variant which favored higher high water
levels. At the end of the inundation period, the standard approach in both
variants favored lower high water levels unlike the robust approach in both
variants which favored higher high water levels.</p>
</sec>
<sec id="Ch1.S4.SS5.SSS2">
  <?xmltex \opttitle{Distribution for the C${}_{3}$-model}?><title>Distribution for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model</title>

      <?xmltex \floatpos{t}?><fig id="Ch1.F15" specific-use="star"><caption><p>Averaged frequency of measurements from 10 optimization runs with
the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model and three measurement per iteration with standard deviation
<inline-formula><mml:math display="inline"><mml:mrow><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>-</mml:mo><mml:mn mathvariant="normal">2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> of the measurement error.</p></caption>
            <?xmltex \igopts{width=312.980315pt}?><graphic xlink:href="https://www.geosci-model-dev.net/8/791/2015/gmd-8-791-2015-f06.png"/>

          </fig>

      <p>For the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model the optimized measuring points accumulated at the end of
the inundation periods. All approaches favored lower high water levels. With
an increasing number of measurements per iteration, the robust approach in
both variants also preferred measurements in the middle of the inundation
periods with the highest high water level.</p>
</sec>
<sec id="Ch1.S4.SS5.SSS3">
  <title>Conclusions regarding the distribution of optimal measuring points</title>
      <p>The numerical experiments showed that measurements at the start and end of
the inundation periods should be preferred for the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model.</p>
      <p>Measurements at the start of the inundations can be justified by the fact
that one parameter of the model is the concentration at the start of the
inundation. The fact that the settling velocity as second model parameter
most affects the concentration at the end of the inundations justifies
measurements here. This can be confirmed by an examination of the ordinary
differential equation of the model derived with respect to the settling
velocity. The derivative of the model with respect to the settling velocity
is zero at the start of the inundation and is getting smaller the further the
inundation progresses. Its absolute greatest value it thus reached at the end
of the inundation.</p>
      <p>The experiments with the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">3</mml:mn></mml:msub></mml:math></inline-formula>-model showed that here measurements at end of
the inundation periods should be preferred. In this model, the concentration
at the start is no parameter but is affected by a parameter that also
influences the settling velocity. For this reason, measurements are not
suggested at the start.</p>
      <p>For both models the high water level seemed to play a minor role for the
choice of measuring points.</p>
      <p>As a rule of thumb, one can say that measurements should be carried out at the
end of an inundation period and also some at the start if the C<inline-formula><mml:math display="inline"><mml:msub><mml:mi/><mml:mn mathvariant="normal">2</mml:mn></mml:msub></mml:math></inline-formula>-model is
used.</p>
</sec>
</sec>
</sec>
<sec id="Ch1.S5" sec-type="conclusions">
  <title>Conclusions</title>
      <p>In this paper we presented two different approaches for optimizing
experimental design for parameter estimations. One method was based on the
linearization of the model with respect to its parameters, the other takes
into account a possible nonlinearity of the model parameters. Both methods
were implemented in our presented <italic>Optimal Experimental Design Toolbox</italic> for MATLAB.</p>
      <p><?xmltex \hack{\newpage}?>By employing the presented approach for two existing salt marsh models, we
showed that model parameters can be determined much more accurately if the
corresponding measurement conditions were optimized. In particular for
time-consuming or costly measurements, it is useful to optimize the
measurement conditions with the <italic>Optimal Experimental Design Toolbox</italic>.</p>
      <p>This gain in accuracy is not limited to the application examples. In general,
using the implemented methods, the accuracy of the parameters of any model
can be maximized while minimizing the measurement cost, provided that the
related assumptions are fulfilled. However, the required execution time for
the optimization increases with the number of model parameters and
(accomplished and selectable) measurements. Parallelization techniques in the
optimization as well as in the model evaluation itself can counteract this
effect.</p>
      <p>In addition to the parallelization, the optimization in the toolbox could
also be extended to techniques of globalization, so that the chance of
getting into a local minimum is reduced.</p>
      <p>The results concerning the application examples have not significantly
differed despite the various approaches for optimizing experimental design.
For this reason, the approach with the least computational effort is
recommended. However, this recommendation can not be applied readily to other
(more complex) models. Here, the performance of the approaches should be
compared again if possible.</p>
      <p>Furthermore, it has been found that measurements at the beginning and end of
the inundation period are particularly important for the application
examples. The high water level of the inundation seemed to play a minor role.
These results, however, can not be applied easily to other models. Usually, a
separate optimization of experimental design makes sense here.</p>
<sec id="Ch1.S5.SSx1" specific-use="unnumbered">
  <title>Code availability</title>
      <p>The <italic>Optimal Experimental Design Toolbox</italic> is available under the GNU
General Public License (<xref ref-type="bibr" rid="bib1.bibx10" id="altparen.48"/>) at a Git repository
(<xref ref-type="bibr" rid="bib1.bibx26" id="altparen.49"/>). In addition to the toolbox, including commented
source code and a user manual, an implementation of the application examples
is also available.</p>
</sec>
</sec>

      
      </body>
    <back><ack><title>Acknowledgements</title><p>We would like to thank the referees for their comments that helped us to
clarify and improve this paper.</p><p>This project was funded by the Deutsche Forschungsgemeinschaft (DFG) as part
of the Kiel cluster “The Future Ocean”.<?xmltex \hack{\newline}?><?xmltex \hack{\newline}?>
Edited by: J. Neal</p></ack><ref-list>
    <title>References</title>

      <ref id="bib1.bibx1"><label>Amemiya(1983)</label><mixed-citation>
Amemiya, T.: Nonlinear regression models, Handbook of econometrics, 1,
333–389, 1983.</mixed-citation></ref>
      <ref id="bib1.bibx2"><label>Bartholdy and Aagaard(2001)</label><mixed-citation>Bartholdy, J. and Aagaard, T.: Storm surge effects on a back-barrier tidal
flat of the Danish Wadden Sea, Geo-Mar. Lett., 20, 133–141,
<ext-link xlink:href="http://dx.doi.org/10.1007/s003670000048" ext-link-type="DOI">10.1007/s003670000048</ext-link>, 2001.</mixed-citation></ref>
      <ref id="bib1.bibx3"><label>Broyden(1970)</label><mixed-citation>Broyden, C. G.: The Convergence of a Class of Double-rank Minimization
Algorithms: 2. The New Algorithm, IMA J. Appl. Math., 6,
222–231, <ext-link xlink:href="http://dx.doi.org/10.1093/imamat/6.3.222" ext-link-type="DOI">10.1093/imamat/6.3.222</ext-link>,
1970.</mixed-citation></ref>
      <ref id="bib1.bibx4"><label>Burt(1986)</label><mixed-citation>Burt, T.: Field Settling Velocities of Estuary Muds, in: Estuarine Cohesive
Sediment Dynamics, edited by: Mehta, A., Vol. 14 of Lecture Notes on
Coastal and Estuarine Studies, 126–150, Springer New York,
<ext-link xlink:href="http://dx.doi.org/10.1007/978-1-4612-4936-8_7" ext-link-type="DOI">10.1007/978-1-4612-4936-8_7</ext-link>, 1986.</mixed-citation></ref>
      <ref id="bib1.bibx5"><label>Coleman and Li(1994)</label><mixed-citation>
Coleman, T. F. and Li, Y.: On the convergence of reflective Newton methods
for large-scale nonlinear minimization subject to bounds, Math. Program., 67,
189–224, 1994.</mixed-citation></ref>
      <ref id="bib1.bibx6"><label>Coleman and Li(1996)</label><mixed-citation>
Coleman, T. F. and Li, Y.: An Interior, Trust Region Approach for Nonlinear
Minimization Subject to Bounds, SIAM J. Optimiz., 6, 418–445,
1996.</mixed-citation></ref>
      <ref id="bib1.bibx7"><label>Cramér(1946)</label><mixed-citation>
Cramér, H.: Mathematical Methods of Statistics, Almqvist &amp; Wiksells
Akademiska Handböcker, Princeton University Press, 1946.</mixed-citation></ref>
      <ref id="bib1.bibx8"><label>El-Monsef et al.(2009)El-Monsef, Rady, and Seyam</label><mixed-citation>
El-Monsef, M. M. E. A., Rady, E. A., and Seyam, M. M.: Relationships among
Several Optimality Criteria, Interstat, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx9"><label>Fletcher(1970)</label><mixed-citation>Fletcher, R.: A new approach to variable metric algorithms, Comput. J., 13,
317–322, <ext-link xlink:href="http://dx.doi.org/10.1093/comjnl/13.3.317" ext-link-type="DOI">10.1093/comjnl/13.3.317</ext-link>, 1970.</mixed-citation></ref>
      <ref id="bib1.bibx10"><label>Foundation(2007)</label><mixed-citation>Foundation, F. S.: GNU General Public License, available at:
<uri>http://www.gnu.org/licenses/gpl-3.0-standalone.html</uri> (last access:
30 July 2014), 2007.</mixed-citation></ref>
      <ref id="bib1.bibx11"><label>Goldfarb(1970)</label><mixed-citation>
Goldfarb, D.: A family of variable-metric methods derived by variational
means, Math. Comput., 24, 23–26, 1970.</mixed-citation></ref>
      <ref id="bib1.bibx12"><label>Guest and Curtis(2009)</label><mixed-citation>Guest, T. and Curtis, A.: Iteratively constructive sequential design of
experiments and surveys with nonlinear parameter-data relationships, J. Geophys. Res.-Sol., 114,
B04307, <ext-link xlink:href="http://dx.doi.org/10.1029/2008JB005948" ext-link-type="DOI">10.1029/2008JB005948</ext-link>, 2009.</mixed-citation></ref>
      <ref id="bib1.bibx13"><label>IPCC(2013)</label><mixed-citation>IPCC: Climate Change 2013: The Physical Science Basis. Contribution of
Working Group I to the Fifth Assessment Report of the Intergovernmental Panel
on Climate Change, edited by: Stocker, T. F., Qin, D., Plattner, G.-K.,
Tignor, M., Allen, S. K., Boschung, J., Nauels, A., Xia, Y., Bex, B., and
Midgley, P. M., Cambridge University Press, Cambridge, United Kingdom, New
York, NY, USA, <ext-link xlink:href="http://dx.doi.org/10.1017/CBO9781107415324" ext-link-type="DOI">10.1017/CBO9781107415324</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bibx14"><label>Jennrich(1969)</label><mixed-citation>Jennrich, R. I.: Asymptotic Properties of Non-Linear Least Squares
Estimators, Ann. Math. Stat., 40, 633–643,
<ext-link xlink:href="http://dx.doi.org/10.1214/aoms/1177697731" ext-link-type="DOI">10.1214/aoms/1177697731</ext-link>, 1969.</mixed-citation></ref>
      <ref id="bib1.bibx15"><label>Krone(1987)</label><mixed-citation>
Krone, R. B.: A method for simulating historic marsh elevations, in: Coastal
Sediments (1987), pp. 316–323, ASCE, 1987.</mixed-citation></ref>
      <ref id="bib1.bibx16"><label>Körkel(2002)</label><mixed-citation>
Körkel, S.: Numerische Methoden für Optimale Versuchsplanungsprobleme
bei nichtlinearen DAE-Modellen, PhD thesis, Ruprecht-Karls-Universität
Heidelberg, 2002.</mixed-citation></ref>
      <ref id="bib1.bibx17"><label>Körkel et al.(2004)Körkel, Kostina, Bock, and
Schlöder</label><mixed-citation>Körkel, S., Kostina, E., Bock, H. G., and Schlöder, J. P.: Numerical
methods for optimal control problems in design of robust optimal experiments
for nonlinear dynamic processes, Optim. Method. Softw., 19, 327–338,
<ext-link xlink:href="http://dx.doi.org/10.1080/10556780410001683078" ext-link-type="DOI">10.1080/10556780410001683078</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx18"><label>Levenberg(1944)</label><mixed-citation>
Levenberg, K.: A method for the solution of certain problems in least
squares, Q. Appl. Math., 2, 164–168, 1944.</mixed-citation></ref>
      <ref id="bib1.bibx19"><label>Malinvaud(1970)</label><mixed-citation>
Malinvaud, E.: The Consistency of Nonlinear Regressions, Ann. Math. Stat.,
41, 956–969, 1970.</mixed-citation></ref>
      <ref id="bib1.bibx20"><label>Marquardt(1963)</label><mixed-citation>
Marquardt, D. W.: An Algorithm for Least-Squares Estimation of Nonlinear
Parameters, J. Soc. Ind. Appl. Math.,
11, 431–441, 1963.</mixed-citation></ref>
      <ref id="bib1.bibx21"><label>MathWorks(2014)</label><mixed-citation>MathWorks: Matlab R2014a Primer, Natick, Massachusetts, release 2014a Edn.,
available at:
<uri>http://www.mathworks.de/help/releases/R2014a/pdf_doc/matlab/getstart.pdf</uri>
(last access: 12 March 2015), 2014.</mixed-citation></ref>
      <ref id="bib1.bibx22"><label>Moré(1977)</label><mixed-citation>Moré, J.: The Levenberg-Marquardt algorithm: Implementation and theory,
in: Numerical Analysis, edited by: Watson, G., Vol. 630 of Lecture Notes in
Mathematics, 105–116, Springer Berlin Heidelberg, <ext-link xlink:href="http://dx.doi.org/10.1007/BFb0067700" ext-link-type="DOI">10.1007/BFb0067700</ext-link>,
1977.</mixed-citation></ref>
      <ref id="bib1.bibx23"><label>Nocedal and Wright(1999)</label><mixed-citation>
Nocedal, J. and Wright, S.: Numerical Optimization, Springer series in
operations research and financial engineering, Springer, New York,  1999.</mixed-citation></ref>
      <ref id="bib1.bibx24"><label>Pejrup and Mikkelsen(2010)</label><mixed-citation>Pejrup, M. and Mikkelsen, O. A.: Factors controlling the field settling
velocity of cohesive sediment in estuaries, Estuar. Coast. Shelf
Sci., 87, 177–185, <ext-link xlink:href="http://dx.doi.org/10.1016/j.ecss.2009.09.028" ext-link-type="DOI">10.1016/j.ecss.2009.09.028</ext-link>, 2010.</mixed-citation></ref>
      <ref id="bib1.bibx25"><label>Rao(1945)</label><mixed-citation>
Rao, R. C.: Information and the accuracy attainable in the estimation of
statistical parameters, Bull. Calcutta Math. Soc., 37, 81–91, 1945.</mixed-citation></ref>
      <ref id="bib1.bibx26"><label>Reimer(2015)</label><mixed-citation>Reimer, J.: oed: Optimal Experimental Design Toolbox: Version 1.0,
<ext-link xlink:href="http://dx.doi.org/10.5281/zenodo.16004" ext-link-type="DOI">10.5281/zenodo.16004</ext-link>, 2015.</mixed-citation></ref>
      <ref id="bib1.bibx27"><label>Schuerch et al.(2013)Schuerch, Vafeidis, Slawig, and
Temmerman</label><mixed-citation>Schuerch, M., Vafeidis, A., Slawig, T., and Temmerman, S.: Modeling the
influence of changing storm patterns on the ability of a salt marsh to keep
pace with sea level rise, J. Geophys. Res.-Earth,
118, 84–96, <ext-link xlink:href="http://dx.doi.org/10.1029/2012JF002471" ext-link-type="DOI">10.1029/2012JF002471</ext-link>, 2013.</mixed-citation></ref>
      <ref id="bib1.bibx28"><label>Seber and Wild(2003)</label><mixed-citation>
Seber, G. A. F. and Wild, C. J.: Nonlinear regression, Wiley series in
probability and statistics, Wiley-Interscience, 2003.</mixed-citation></ref>
      <ref id="bib1.bibx29"><label>Shanno(1970)</label><mixed-citation>
Shanno, D. F.: Conditioning of Quasi-Newton Methods for Function
Minimization, Math. Comput., 24, 647–656, 1970.</mixed-citation></ref>
      <ref id="bib1.bibx30"><label>Stigler(1981)</label><mixed-citation>
Stigler, S. M.: Gauss and the Invention of Least Squares, Ann.
Stat., 9,  465–474, 1981.</mixed-citation></ref>
      <ref id="bib1.bibx31"><label>Temmerman et al.(2003)Temmerman, Govers, Meire, and
Wartel</label><mixed-citation>Temmerman, S., Govers, G., Meire, P., and Wartel, S.: Modelling long-term
tidal marsh growth under changing tidal conditions and suspended sediment
concentrations, Scheldt estuary, Belgium, Mar. Geol., 193, 151–169,
<ext-link xlink:href="http://dx.doi.org/10.1016/S0025-3227(02)00642-4" ext-link-type="DOI">10.1016/S0025-3227(02)00642-4</ext-link>, 2003.</mixed-citation></ref>
      <ref id="bib1.bibx32"><label>Temmerman et al.(2004)Temmerman, Govers, Wartel, and
Meire</label><mixed-citation>Temmerman, S., Govers, G., Wartel, S., and Meire, P.: Modelling estuarine
variations in tidal marsh sedimentation: response to changing sea level and
suspended sediment concentrations, Mar. Geol., 212, 1–19,
<ext-link xlink:href="http://dx.doi.org/10.1016/j.margeo.2004.10.021" ext-link-type="DOI">10.1016/j.margeo.2004.10.021</ext-link>, 2004.</mixed-citation></ref>
      <ref id="bib1.bibx33"><label>van Leussen(1999)</label><mixed-citation>van Leussen, W.: The variability of settling velocities of suspended
fine-grained sediment in the Ems estuary, J. Sea Res., 41, 109–118, <ext-link xlink:href="http://dx.doi.org/10.1016/S1385-1101(98)00046-X" ext-link-type="DOI">10.1016/S1385-1101(98)00046-X</ext-link>, 1999.
</mixed-citation></ref><?xmltex \hack{\newpage}?>
      <ref id="bib1.bibx34"><label>Walter and Pronzato(1997)</label><mixed-citation>
Walter, É. and Pronzato, L.: Identification of parametric models from
experimental data, Communications and control engineering, Springer, New
York,
1997.</mixed-citation></ref>
      <ref id="bib1.bibx35"><label>White(1980)</label><mixed-citation>
White, H.: Nonlinear Regression on Cross-Section Data, Econometrica, 48,
721–746, 1980.</mixed-citation></ref>
      <ref id="bib1.bibx36"><label>White and Domowitz(1984)</label><mixed-citation>
White, H. and Domowitz, I.: Nonlinear Regression with Dependent Observations,
Econometrica, 52,  143–162, 1984.</mixed-citation></ref>
      <ref id="bib1.bibx37"><label>Wu(1981)</label><mixed-citation>
Wu, C.-F.: Asymptotic Theory of Nonlinear Least Squares Estimation, Ann.
Stat., 9, 501–513, 1981.</mixed-citation></ref>

  </ref-list><app-group content-type="float"><app><title/>

    </app></app-group></back>
    </article>
