Linear coordinate-descent message passing for quadratic optimization

DOI10.1162/NECO_A_00368MaRDI QIDQ2840898zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Richard Heusdens, Guoqiang Zhang

Publication date 23 July 2013

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/neco_a_00368

Mathematics Subject Classification ID

Distributed algorithms (68W15) Analysis of algorithms (68W40) Quadratic programming (90C20)

Recommendations

• Message-passing algorithms for quadratic minimization
• Message-passing algorithms for inference and optimization
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Message-passing for graph-structured linear programs: proximal methods and rounding schemes
• A new approach to Laplacian solvers and flow problems

Cites work

• An analysis of belief propagation on the turbo decoding graph with Gaussian densities
• Convergence of Min-Sum Message Passing for Quadratic Optimization
• Convergence of Min-Sum Message-Passing for Convex Optimization
• Correctness of belief propagation in Gaussian graphical models of arbitrary topology
• Distributed Node-Specific LCMV Beamforming in Wireless Sensor Networks
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 3591315 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)

Cited in

(1)

• Convergence of Min-Sum Message Passing for Quadratic Optimization

This page was built for publication: Linear coordinate-descent message passing for quadratic optimization

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