Sparse approximate solutions to max-plus equations
type: Item
instance of: scholarly article
title: Sparse approximate solutions to max-plus equations
zbMATH Open document ID: 1484.15033
DOI: 10.1007/978-3-030-76657-3_39
author: Nikos Tsilivis
author: Anastasios Tsiamis
author: Petros Maragos
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 15A80
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7450139
zbMATH Keywords: sparsity
zbMATH Keywords: max-plus algebra
zbMATH Keywords: submodular optimization
MaRDI profile type: Publication
full work available at URL: 978-3-030-76657-3 39
OpenAlex ID: W3161924676
cites work: Tropical polyhedra are equivalent to mean payoff games
cites work: Q4304869
cites work: Learning with Submodular Functions: A Convex Optimization Perspective
cites work: Max-linear Systems: Theory and Algorithms
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: Morphological Perceptrons: Geometry and Training Algorithms
cites work: Minimax algebra
cites work: Q4558139
cites work: Compressed sensing
cites work: Sparse and Redundant Representations
cites work: Q3898534
cites work: Q4889894
cites work: Max-plus linear inverse problems: 2-norm regression and system identification of max-plus linear dynamical systems with Gaussian noise
cites work: Q3682236
cites work: Dynamical systems on weighted lattices: general theory
cites work: Sparse Approximate Solutions to Linear Systems
cites work: Q3680652
cites work: Sparsity in max-plus algebra and systems
cites work: An analysis of the greedy algorithm for the submodular set covering problem
cites work: Max-plus operators applied to filter selection and model pruning in neural networks
description: scientific article; zbMATH DE number 7450139