Discretization of a matrix in quadratic functional binary optimization

DOI10.1134/S1064562411030197zbMATH Open1237.65058arXiv1205.0732MaRDI QIDQ656361FDOQ656361

Authors: M. V. Kryzhanovsky, M. Yu. Malsagov, B. V. Kryzhanovskii 

Publication date: 17 January 2012

Published in: Doklady Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1205.0732

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

zbMATH Keywords

quadratic functionalminimization algorithmbinary optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Cites Work

• Neural networks and physical systems with emergent collective computational abilities.
• The Shape of a Local Minimum and the Probability of its Detection in Random Search
• Application of the clipping procedure to the binary minimization of a quadratic functional

Cited In (5)

• Title not available (Why is that?)
• Determinant Optimization on Binary Matrices
• Transformation of energy landscape in the problem of binary minimization
• Strong instability of the minima spectrum of a quadratic binary functional
• Application of the clipping procedure to the binary minimization of a quadratic 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)