In this note we construct certain sequences of finite point sets in [0, 1) s (s ≥ 1) and give the upper bounds of their discrepancy. Furthermore we prove that these sequences are uniformly distrbuted in [0, 1) s .
With the integral-level approach to global optimization, a class of discon-tinuous penalty functions is proposed to solve constrained minimization problems. Inthis paper we propose an implementable algorithm by means ...With the integral-level approach to global optimization, a class of discon-tinuous penalty functions is proposed to solve constrained minimization problems. Inthis paper we propose an implementable algorithm by means of the good point set ofuniform distribution which conquers the default of Monte-Carlo method. At last weprove the convergence of the implementable algorithm.展开更多
基金Supported by the National Natural Science Foundation of Chinathe "333 Project" Foundation of Jiangsu Province of China
文摘In this note we construct certain sequences of finite point sets in [0, 1) s (s ≥ 1) and give the upper bounds of their discrepancy. Furthermore we prove that these sequences are uniformly distrbuted in [0, 1) s .
基金This work is supported by the National Natural Science Foundation of China(grants 19871053)and by the Science and Technology Development Foundation of Shanghai
文摘With the integral-level approach to global optimization, a class of discon-tinuous penalty functions is proposed to solve constrained minimization problems. Inthis paper we propose an implementable algorithm by means of the good point set ofuniform distribution which conquers the default of Monte-Carlo method. At last weprove the convergence of the implementable algorithm.
