Search

This paper proposes a nonmonotone scaled conjugate gradient algorithm for solving large-scale unconstrained optimization problems, which combines the idea of scaled memoryless Broyden-Fletcher-Goldfarb-Shanno preconditioned conjugate gradient method with the nonmonotone technique. An attractive property of the proposed method is that the search direction always provides sufficient descent step at each iteration. This property is independent of the line search used. Under appropriate assumptions, the method is proven to possess global convergence for nonconvex smooth functions, and R-linear convergence for strongly convex functions. Preliminary numerical results and related comparisons show the efficiency of the proposed method in practical computation. [ABSTRACT FROM AUTHOR]

In this paper, the iterative learning control problem for a class of nonlinear singular impulsive systems is discussed. Then, a D-type (derivative-type) iterative learning control algorithm is presented such that the output tracks the desired output trajectory as accurate as possible. Furthermore, the sufficient condition for the convergence of the proposed algorithm is established in detail. Finally, a numerical example is included to corroborate the theoretical analyses. [ABSTRACT FROM AUTHOR]

The goal of the paper is to identify the Hammerstein-type systems excited and disturbed by correlated random processes. The problem is semi-parametric in the sense that the nonlinear static characteristic is recovered without prior knowledge about the linear dynamic block, i.e. when its order is unknown. The method is based on the instrumental variables technique, with the instruments generated by input inverse filtering. It is proved that, in contrast to the least-squares-based approach, the proposed algorithm leads to an asymptotically unbiased, strongly consistent estimate. Constructive procedures of instrumental variables generation are given for some popular cases. [ABSTRACT FROM PUBLISHER]

This paper presents a new hybrid algorithm for unconstrained optimization problems, which combines the idea of the IMPBOT algorithm with the nonmonotone line search technique. A feature of the proposed method is that at each iteration, a system of linear equations is solved only once to obtain a trial step, via a modified limited-memory BFGS two loop recursion that requires only matrix–vector products, thus reducing the computations and storage. Furthermore, when the trial step is not accepted, the proposed method performs a line search along it using a modified nonmonotone scheme, thus a larger stepsize can be yielded in each line search procedure. Under some reasonable assumptions, the convergence properties of the proposed algorithm are analysed. Numerical results are also reported to show the efficiency of this proposed method. [ABSTRACT FROM PUBLISHER]