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

DOI10.1007/S10559-022-00485-8MaRDI QIDQ2103793zbMATH OpenOpenAlexFDO

Authors 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

graphical modelsdiscrete optimizationstructural pattern recognition\((\max,+)\)labeling problemsself-driven pattern recognitionsupermodular labeling problems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1353835
• Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region
• A dual algorithm for submodular flow problems
• Two polynomial time graph labeling algorithms optimizing max-norm-based objective functions
• The Data-Correcting Algorithm for the Minimization of Supermodular Functions

Cites work

• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• Computational Complexity
• Diffusion algorithms and structural recognition optimization problems
• Discrete graphical models -- an optimization perspective
• Handbook of constraint programming.
• Minimax problems of discrete optimization invariant under majority operators

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

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