Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  convergence analysis
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

On-line wavelet estimation of Hammerstein system nonlinearity

100%
Śliwiński P.
International Journal of Applied Mathematics and Computer Science
|
2010
|
tom 20
|
nr 3
513-523
EN
A new algorithm for nonparametric wavelet estimation of Hammerstein system nonlinearity is proposed. The algorithm works in the on-line regime (viz., past measurements are not available) and offers a convenient uniform routine for nonlinearity estimation at an arbitrary point and at any moment of the identification process. The pointwise convergence of the estimate to locally bounded nonlinearities and the rate of this convergence are both established.
2
Content available remote

A simple scheme for semi-recursive identification of Hammerstein system nonlinearity by Haar wavelets

88%
Śliwiński P., Hasiewicz Z., Wachel P.
International Journal of Applied Mathematics and Computer Science
|
2013
|
tom 23
|
nr 3
507-520
EN
A simple semi-recursive routine for nonlinearity recovery in Hammerstein systems is proposed. The identification scheme is based on the Haar wavelet kernel and possesses a simple and compact form. The convergence of the algorithm is established and the asymptotic rate of convergence (independent of the input density smoothness) is shown for piecewiseLipschitz nonlinearities. The numerical stability of the algorithm is verified. Simulation experiments for a small and moderate number of input-output data are presented and discussed to illustrate the applicability of the routine.
3
Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik
Content available

Computing the Stackelberg/Nash equilibria using the extraproximal method: Convergence analysis and implementation details for Markov chains games

88%
Trejo K., Clempner J., Poznyak A.
International Journal of Applied Mathematics and Computer Science
|
2015
|
tom 25
|
nr 2
337-351
EN
In this paper we present the extraproximal method for computing the Stackelberg/Nash equilibria in a class of ergodic controlled finite Markov chains games. We exemplify the original game formulation in terms of coupled nonlinear programming problems implementing the Lagrange principle. In addition, Tikhonov's regularization method is employed to ensure the convergence of the cost-functions to a Stackelberg/Nash equilibrium point. Then, we transform the problem into a system of equations in the proximal format. We present a two-step iterated procedure for solving the extraproximal method: (a) the first step (the extra-proximal step) consists of a “prediction” which calculates the preliminary position approximation to the equilibrium point, and (b) the second step is designed to find a “basic adjustment” of the previous prediction. The procedure is called the “extraproximal method” because of the use of an extrapolation. Each equation in this system is an optimization problem for which the necessary and efficient condition for a minimum is solved using a quadratic programming method. This solution approach provides a drastically quicker rate of convergence to the equilibrium point. We present the analysis of the convergence as well the rate of convergence of the method, which is one of the main results of this paper. Additionally, the extraproximal method is developed in terms of Markov chains for Stackelberg games. Our goal is to analyze completely a three-player Stackelberg game consisting of a leader and two followers. We provide all the details needed to implement the extraproximal method in an efficient and numerically stable way. For instance, a numerical technique is presented for computing the first step parameter (λ) of the extraproximal method. The usefulness of the approach is successfully demonstrated by a numerical example related to a pricing oligopoly model for airlines companies.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.