The guaranteed performance (including convergence) of the proposed algorithms is shown in terms of suitable choices of the algorithmic parameters and the restricted isometry property (RIP) of the sensing matrix which has been widely used in the analysis of compressive sensing algorithms. The simulation...
In terms of computational costs, the Newton-type algorithms require about 20 times fewer objective function evaluations than the SCE search for SIMHYD and 50 times fewer evaluations for FUSE-536. Considering the chance of converging to the global optimum and the computational cost, we suggest that...
We consider a class of interior point algorithms for minimizing a twice continuously differentiable function over a closed convex set with nonempty interior. On one hand, our algirothms can be viewed as an approximate version of the generalized proximal point methods and, on the other hand, as ...
Pollatschek, M. and B. Avi-Itzhak (1969), "Algorithms for stochastic games with geometric interpretation",Management Science, 15, 399–415. Google Scholar Puterman, M.L. and S.L. Brumeile (1978), "The analytic theory of policy iteration", inDynamic Programming and its Applications, M.L....
5. Newton-type algorithms for nonlinear constrained chemical process control. [D] . de Oliveira, Nuno Manuel Clemente. 1994 机译:用于非线性约束化学过程控制的牛顿型算法。 6. A novel method for fast and robust estimation of fluorescence decay dynamics using constrained least-square deconvolution ...
关键词: Newton method adaptive estimation adaptive filters computational complexity convergence of numerical methods digital filters filtering theory least mean squares methods LMS Newton-type adaptive estimation algorithms DOI: 10.1109/78.533714 被引量: 19 年份: 1996 收藏...
The performances of the proposed algorithms are illustrated with numerical results using simulated data.doi:10.48550/arXiv.1310.5156Mourad SiniNguyen Trung ThànhM. Sini and N. T. Th`anh. Convergence rates of recursive newton-type methods for multifrequency scattering problems. 2013. Preprint, arXiv...
which shows that the tracking error monotonously converges to zero after a finite number of iterations.Compared with the existing optimized ILC algorithms,due to the superlinear convergence of quasi-Newton method,the proposed learning law operates with a faster convergent rate and is robust to the ...
例句 释义: 全部
Bonnans JF (1989) Local study of Newton-type algorithms for constrained problems. Proc 5th Franco-German Conf on Optimization, Dolecki S, ed. Lectures Notes in Mathematics, vol 1405. Springer-Verlag, Berlin, pp 13–24 5. Bonnans JF, Launay G (1992) An implicit trust region algorithm for...