<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>04070636</id>
  <dt>a</dt>
  <an>04070636</an>
  <augroup>
    <au>Malanowski, Kazimierz</au>
  </augroup>
  <ti>Higher order sensitivity of solutions to convex programming problems without strict complementarity.</ti>
  <so>System modelling and optimization, Proc. 13th IFIP Conf., Tokyo/Jap. 1987, Lect. Notes Control Inf. Sci. 113, 148-164 (1988).</so>
  <py>1988</py>
  <pu></pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>higher order sensitivity of solutions</ut>
    <ut>strongly convex programming</ut>
    <ut>second order directional derivative</ut>
    <ut>optimal value function</ut>
  </utgroup>
  <cigroup>
    <ci>Zbl 0643.00031</ci>
    <ci>Zbl 0579.90088</ci>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>[For the entire collection see Zbl 0643.00031.] In this abstract paper results of the following type are given concerning a family of strongly convex programming problems, the data of which depend regularly on a vector parameter: Under constraint qualifications the solutions are directionally-differentiable functions of the parameter. Higher order directional differentiability can be obtained too. As an example, the second order directional derivative of the customary optimal value function belonging to the above mentioned problem is calculated. The author gives the hint, that the last result was first derived by {\it A. Shapiro}, who used a completely different approach [Math. Program. 33, 280-299 (1985; Zbl 0579.90088)].</ab>
    <rv>A.G\"opfert</rv>
  </abgroup>
</item>