<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05371384</id>
  <dt>j</dt>
  <an>05371384</an>
  <augroup>
    <au>Yu, Hong</au>
    <au>Shi, Baisheng</au>
    <au>Wu, Donghua</au>
  </augroup>
  <ti>Variable measure algorithm of an integral-level set method for solving the constrained problem.</ti>
  <so>J. Syst. Sci. Math. Sci. 28, No. 2, 232-242 (2008).</so>
  <py>2008</py>
  <pu>Science Press, Beijing</pu>
  <lagroup>
    <la>ZH</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>integral-level set</ut>
    <ut>variable measure</ut>
    <ut>constrained problem</ut>
    <ut>convergence</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: A variable measure algorithm for global optimization problem with constraints is proposed. Taking different measure in different sub-box and choosing a good point set of uniform with the deterministic number theory instead of Monte-Carlo method, the level value can be reduced enough to reach the global optimization and improve the efficiency of the algorithm. Then the global convergence of this algorithm is proven, and the simulation examples show the validity of the algorithm.</ab>
    <rv></rv>
  </abgroup>
</item>