Stochastic multivalued network for optimization. Application to the graph MaxCut problem

Authors

Domingo López-Rodríguez , Enrique Mérida-Casermeiro , Juan Miguel Ortiz-de-Lazcano-Lobato

Published

1 January 2007

Publication details

WSEAS Transactions on Mathematics, (6), 3, pp. 500-505

Links

 

Abstract

The aim of this paper is to present the stochastic version of the multivalued neural model MREM, which has achieved very good results in many applications, as an optimization technique. The purpose of this stochastic version is to avoid certain local minima of the objective function minimized by the network, that is, the energy function. To this end, the description of the theoretical bases of this model, guaranteeing the convergence to minima, is carried out rigorously. In order to show the efficiency of this new model, the model, in its two versions, deterministic and stochastic, has been applied to the resolution of the well-known problem of graph partition, MaxCut. Computational experiments show that in most cases the stochastic model achieves better results than the deterministic one.

Citation

How to cite

D. López-Rodríguez, E. Mérida-Casermeiro, and J. Ortiz-de-Lazcano-Lobato. “Stochastic multivalued network for optimization. Application to the graph MaxCut problem”. In: WSEAS Transactions on Mathematics 6.3 (2007). cited By 0, pp. 500-505. URL: https://www.scopus.com/inward/record.uri?eid=2-s2.0-33847621572&partnerID=40&md5=be8fe4152a9d2279f0a282de53806edb.

BibTeX

<pre><code>

@Article{LopezRodriguez2007, author = {D. López-Rodríguez and E. Mérida-Casermeiro and J.M. Ortiz-de-Lazcano-Lobato}, journal = {WSEAS Transactions on Mathematics}, title = {Stochastic multivalued network for optimization. Application to the graph MaxCut problem}, year = {2007}, note = {cited By 0}, number = {3}, pages = {500-505}, volume = {6}, abstract = {The aim of this paper is to present the stochastic version of the multivalued neural model MREM, which has achieved very good results in many applications, as an optimization technique. The purpose of this stochastic version is to avoid certain local minima of the objective function minimized by the network, that is, the energy function. To this end, the description of the theoretical bases of this model, guaranteeing the convergence to minima, is carried out rigorously. In order to show the efficiency of this new model, the model, in its two versions, deterministic and stochastic, has been applied to the resolution of the well-known problem of graph partition, MaxCut. Computational experiments show that in most cases the stochastic model achieves better results than the deterministic one.}, author_keywords = {Graph problems; Neural networks; Optimization problems; Stochastic dynamics}, document_type = {Article}, keywords = {Computational efficiency; Graph theory; Mathematical models; Optimization; Stochastic models, Graph partition; Local minima; Stochastic dynamics, Neural networks}, source = {Scopus}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-33847621572&partnerID=40&md5=be8fe4152a9d2279f0a282de53806edb}, }

<button class='copy-bib-btn' id='copy-bib-btn'><i class='bi bi-clipboard'></i> Copy BibTeX</button>