<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>00709952</id>
  <dt>j</dt>
  <an>00709952</an>
  <augroup>
    <au>Fang, S.C.</au>
    <au>Tsao, H.S.J.</au>
  </augroup>
  <ti>A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem.</ti>
  <so>Eur. J. Oper. Res. 79, No.2, 369-378 (1994).</so>
  <py>1994</py>
  <pu>Elsevier Science B.V.(North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>unconstrained optimization</ut>
    <ut>curved-search algorithm</ut>
    <ut>cross-entropy minimization</ut>
    <ut>quadratic rate of convergence</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0377-2217(94)90365-4</li>
  </ligroup>
  <abgroup>
    <ab>Summary: We propose a curved-search algorithm for solving the cross-entropy minimization problem with linear equality constraints. The proposed algorithm converges globally to a dual optimal solution with a quadratic rate of convergence. A dual-to-primal conversion formula is provided. We also analyze the computational effort required for the algorithm and report our computational experience.</ab>
    <rv></rv>
  </abgroup>
</item>