Self-driven algorithm for solving supermodular \((\max,+)\) labeling problems based on subgradient descent

DOI10.1007/s10559-022-00485-8OpenAlexW4306938808MaRDI QIDQ2103793

V. Krygin, R. Khomenko

Publication date: 9 December 2022

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-022-00485-8

zbMATH Keywords

discrete optimizationgraphical modelsstructural pattern recognition\((\max,+)\)labeling problemsself-driven pattern recognitionsupermodular labeling problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Theory of computing (68Qxx) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Diffusion algorithms and structural recognition optimization problems
• Minimax problems of discrete optimization invariant under majority operators
• Discrete Graphical Models — An Optimization Perspective
• Computational Complexity

This page was built for publication: Self-driven algorithm for solving supermodular \((\max,+)\) labeling problems based on subgradient descent