Solving highly cyclic distributed optimization problems without busting the bank: a decimation-based approach

DOI10.1093/JIGPAL/JZAA069MaRDI QIDQ5018768zbMATH OpenOpenAlexFDO

Authors Jesús Cerquides, Juan A. Rodriguez-Aguilar, Rémi Emonet, Gauthier Picard

Publication date 22 December 2021

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10261/236033

zbMATH Keywords

belief propagationDCOPdecimationdistributed constrained optimization

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Governing convergence of Max-sum on DCOPs through damping and splitting
• Approximations in Distributed Optimization
• Belief propagation guided decimation algorithms for random constraint satisfaction problems with growing domains
• Cluster tree elimination for distributed constraint optimization with quality guarantees
• Message-passing algorithms for inference and optimization

Cited in

(1)

• Governing convergence of Max-sum on DCOPs through damping and splitting

This page was built for publication: Solving highly cyclic distributed optimization problems without busting the bank: a decimation-based approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5018768)