نتایج جستجو برای: steepest descent
تعداد نتایج: 23254 فیلتر نتایج به سال:
The LMS method for linear least squares problems differs from the steepest descent method in that it processes data blocks one-by-one, with intermediate adjustment of the parameter vector under optimization. This mode of operation often leads to faster convergence when far from the eventual limit, and to slower (sublinear) convergence when close to the optimal solution. We embed both LMS and st...
1Department of Mathematics, Shanghai Normal University, Shanghai; and Scientific Computing Key Laboratory of Shanghai Universities, Shanghai, China 2Department of Mathematics & Statistics, College of Science, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia; and Department of Mathematics, Aligarh Muslim University, Aligarh, India 3Department of Applied Mathematics, National S...
Binary trust-region steepest descent (BTR) and combinatorial integral approximation (CIA) are two recently investigated approaches for the solution of optimization problems with distributed binary-/discrete-valued variables (control functions). We show improved convergence results BTR by imposing a compactness assumption that is similar to theory CIA. As corollary we conclude also constitutes a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید