Decentralized decomposition algorithms for peer-to-peer linear optimization

DOI10.1051/RO/2019097MaRDI QIDQ3389390zbMATH OpenOpenAlexFDO

Authors M. Asli Aydin, Z. Caner Taşkın

Publication date 10 May 2021

Published in RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/ro/2019097

zbMATH Keywords

block angular structuredecentralized coordinationlinear programmingpeer-to-peer optimization

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06)

Recommendations

• Méthodes de décomposition et décentralisation en programmation linéaire
• scientific article; zbMATH DE number 833651
• scientific article; zbMATH DE number 4174661
• Coordinating decentralized linear programs by exchange of primal information
• Coercion Functions and Decentralized Linear Programming

Cited in

(5)

• Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
• Decentralized online integer programming problems with a coupling cardinality constraint
• Coordinating decentralized linear programs by exchange of primal information
• A decentralized coordination algorithm for multi-objective linear programming with block angular structure
• A review of decentralized optimization focused on information flows of decomposition algorithms

This page was built for publication: Decentralized decomposition algorithms for peer-to-peer linear optimization

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