Global minimization of a quadratic functional: neural network approach

12/24/2004
by   L. B. Litinskii, et al.
0

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.

READ FULL TEXT
research
05/03/2012

Discretization of a matrix in the problem of quadratic functional binary minimization

The capability of discretization of matrix elements in the problem of qu...
research
12/22/2010

Local Minima of a Quadratic Binary Functional with a Quasi-Hebbian Connection Matrix

The local minima of a quadratic functional depending on binary variables...
research
11/15/2021

Axiomatic characterization of the χ^2 dissimilarity measure

We axiomatically characterize the χ^2 dissimilarity measure. To this end...
research
09/12/2019

Inverse Graphical Method for Global Optimization and Application to Design Centering Problem

Consider the problem of finding an optimal value of some objective funct...
research
06/25/2012

Optimization of Real, Hermitian Quadratic Forms: Real, Complex Hopfield-Amari Neural Network

In this research paper, the problem of optimization of quadratic forms a...
research
12/27/2014

Functional correspondence by matrix completion

In this paper, we consider the problem of finding dense intrinsic corres...
research
12/03/2018

Iterative Potts minimization for the recovery of signals with discontinuities from indirect measurements -- the multivariate case

Signals and images with discontinuities appear in many problems in such ...

Please sign up or login with your details

Forgot password? Click here to reset