The problem of finding out the global minimum of a multiextremal functional
is discussed. One frequently faces with such a functional in various
applications. We propose a procedure, which depends on the dimensionality of
the problem polynomially. In our approach we use the eigenvalues and
eigenvectors of the connection matrix.
%0 Generic
%1 citeulike:5090
%A Litinskii,
%A Magomedov,
%D 2004
%K functional lobal minimization quadratic
%T Global minimization of a quadratic functional: neural network approach
%U http://arxiv.org/abs/cs.NE/0412109
%X The problem of finding out the global minimum of a multiextremal functional
is discussed. One frequently faces with such a functional in various
applications. We propose a procedure, which depends on the dimensionality of
the problem polynomially. In our approach we use the eigenvalues and
eigenvectors of the connection matrix.
@misc{citeulike:5090,
abstract = {The problem of finding out the global minimum of a multiextremal functional
is discussed. One frequently faces with such a functional in various
applications. We propose a procedure, which depends on the dimensionality of
the problem polynomially. In our approach we use the eigenvalues and
eigenvectors of the connection matrix.},
added-at = {2007-08-18T13:22:24.000+0200},
author = {Litinskii and Magomedov},
biburl = {https://www.bibsonomy.org/bibtex/2639937fe2864d546536909b69f33e3dd/a_olympia},
citeulike-article-id = {5090},
description = {citeulike},
eprint = {cs.NE/0412109},
interhash = {4775a7746f83c0c4276b8425a451b77c},
intrahash = {639937fe2864d546536909b69f33e3dd},
keywords = {functional lobal minimization quadratic},
month = {December},
timestamp = {2007-08-18T13:23:00.000+0200},
title = {Global minimization of a quadratic functional: neural network approach},
url = {http://arxiv.org/abs/cs.NE/0412109},
year = 2004
}