نتایج جستجو برای: steepest descent method
تعداد نتایج: 1645898 فیلتر نتایج به سال:
The problem of output regulation of affine nonlinear systems with the relative degree not well defined by modified steepest descent control is studied. The modified steepest descent control is a dynamic feedback control which is generated by the trajectory following method. By assuming the system is minimum phase, output of the system can be regulated globally asymptotically.
We propose a limited memory steepest descent method for solving unconstrained optimization problems. As a steepest descent method, the step computation in each iteration only requires the evaluation of a gradient of the objective function and the calculation of a scalar stepsize. When employed to solve certain convex problems, our method reduces to a variant of the limited memory steepest desce...
Recently, Kundur and Hatzinakos showed that a linear restoration filter designed by using the almost obvious a priori knowledge on the original image, such as (i) nonnegativity of the true image and (ii) the smallest rectangle encompassing the original object, can realize a remarkable performance for a blind image deconvolution problem. In this paper, we propose a new set-theoretic blind image ...
In maximizing a non-linear function G(0), it is well known that the steepest descent method has a slow convergence rate. Here we propose a systematic procedure to obtain a 1-1 transformation on the variables 0, so that in the space of the transformed variables, the steepest descent method produces the solution faster. The final solution in the original space is obtained by taking the inverse tr...
In this paper, we present a trust region method for unconstrained optimization problems with locally Lipschitz functions. For this idea, at first, a smoothing conic model sub-problem is introduced for the objective function, by the approximation of steepest descent method. Next, for solving the conic sub-problem, we presented the modified convenient curvilinear search method and equipped it wit...
The least mean squares (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 e...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید