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: 2

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

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  constrained optimization
help Sortuj według:

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

Unilateral contact applications using FEM software

100%
Stavroulaki M. E., Stavroulakis G. E.
International Journal of Applied Mathematics and Computer Science
|
2002
|
tom 12
|
nr 1
115-125
EN
Nonsmooth analysis, inequality constrained optimization and variational inequalities are involved in the modelling of unilateral contact problems. The corresponding theoretical and algorithmic tools, which are part of the area known as nonsmooth mechanics, are by no means classical. In general purpose software some of these tools (perhaps in a simplified way) are currently available. Two engineering applications, a rubber-coated roller contact problem and a masonry wall, solved with MARC, are briefly presented, together with elements of the underlying theory.
2
Content available remote

Local stability conditions for discrete-time cascade locally recurrent neural networks

88%
Patan K.
International Journal of Applied Mathematics and Computer Science
|
2010
|
tom 20
|
nr 1
23-34
EN
The paper deals with a specific kind of discrete-time recurrent neural network designed with dynamic neuron models. Dynamics are reproduced within each single neuron, hence the network considered is a locally recurrent globally feedforward. A crucial problem with neural networks of the dynamic type is stability as well as stabilization in learning problems. The paper formulates local stability conditions for the analysed class of neural networks using Lyapunov's first method. Moreover, a stabilization problem is defined and solved as a constrained optimization task. In order to tackle this problem, a gradient projection method is adopted. The efficiency and usefulness of the proposed approach are justified by using a number of experiments.
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ć.