Message-passing for graph-structured linear programs: proximal methods and rounding schemes
From MaRDI portal
Recommendations
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Convergence and Correctness of Max-Product Belief Propagation for Linear Programming
- Linear programming relaxations and belief propagation -- an empirical study
- An analysis of convex relaxations for MAP estimation of discrete MRFs
- MAP inference via _2-sphere linear program reformulation
Cited in
(11)- Efficient semidefinite branch-and-cut for MAP-MRF inference
- MAP inference via _2-sphere linear program reformulation
- Convergence analysis on an accelerated proximal point algorithm for linearly constrained optimization problems
- Energy distribution view for monotonic dual decomposition
- Linear coordinate-descent message passing for quadratic optimization
- Linear programming relaxations and belief propagation -- an empirical study
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Train and test tightness of LP relaxations in structured prediction
- Hinge-loss Markov random fields and probabilistic soft logic
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- Diffusion methods for classification with pairwise relationships
This page was built for publication: Message-passing for graph-structured linear programs: proximal methods and rounding schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896065)
