Sparse approximate solutions to max-plus equations

DOI10.1007/978-3-030-76657-3_39zbMath1484.15033OpenAlexW3161924676MaRDI QIDQ2061850

Nikos Tsilivis, Anastasios Tsiamis, Petros Maragos

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-76657-3_39

zbMATH Keywords

max-plus algebrasparsitysubmodular optimization

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Approximation algorithms (68W25) Max-plus and related algebras (15A80)

Related Items (1)

Toward a sparsity theory on weighted lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamical systems on weighted lattices: general theory
• Minimax algebra
• An analysis of the greedy algorithm for the submodular set covering problem
• Max-plus operators applied to filter selection and model pruning in neural networks
• Max-plus linear inverse problems: 2-norm regression and system identification of max-plus linear dynamical systems with Gaussian noise
• Sparsity in max-plus algebra and systems
• TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES
• Max-linear Systems: Theory and Algorithms
• Sparse and Redundant Representations
• Sparse Approximate Solutions to Linear Systems
• Morphological Perceptrons: Geometry and Training Algorithms
• Learning with Submodular Functions: A Convex Optimization Perspective
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing

This page was built for publication: Sparse approximate solutions to max-plus equations