Discretization of a matrix in quadratic functional binary optimization
From MaRDI portal
(Redirected from Publication:656361)
Abstract: The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that optimal procedure of replacement matrix elements by the integer quantities with the limited number of gradations exist, and the efficient of minimization does not reduce. Parameter depends on matrix properties, which allows estimate the capability of using described procedure for given type of matrix, is found. Computational complexities of algorithm and RAM requirements are reduced by 16 times, correct using of integer elements allows increase minimization algorithm speed by the orders.
Recommendations
- An accelerated procedure for solving binary optimization problems
- Transformation of energy landscape in the problem of binary minimization
- Application of the clipping procedure to the binary minimization of a quadratic functional
- Bivalent quadratic programming problem - A computational study
- scientific article; zbMATH DE number 724211
Cites work
Cited in
(6)- Application of the clipping procedure to the binary minimization of a quadratic functional
- Transformation of energy landscape in the problem of binary minimization
- An accelerated procedure for solving binary optimization problems
- scientific article; zbMATH DE number 2013168 (Why is no real title available?)
- Determinant Optimization on Binary Matrices
- Strong instability of the minima spectrum of a quadratic binary functional
This page was built for publication: Discretization of a matrix in quadratic functional binary optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656361)