41 research outputs found
A deep cut ellipsoid algorithm for convex programming
This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min—max stochastic queue location problem are reported
Study of the process e+e−→3(π+π−) in the c.m. energy range 1.5–2.0 GeV with the CMD-3 detector
AbstractThe cross section of the process e+e−→3(π+π−) has been measured using a data sample of 22 pb−1 collected with the CMD-3 detector at the VEPP-2000 e+e− collider. 7956 signal events are selected in the center-of-mass energy range 1.5–2.0 GeV. The measured cross section exhibits a sharp drop near the pp¯ threshold. A first study of dynamics of six-pion production has been performed