An efficient algorithm for solving the discrete minisum problem
type: Item
instance of: scholarly article
title: An efficient algorithm for solving the discrete minisum problem
zbMATH Open document ID: 0517.49021
DOI: 10.1016/0167-6377(83)90018-4
author: Roland Hornung
published in: Operations Research Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49K10
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3818518
zbMATH Keywords: nonsmooth minimization
zbMATH Keywords: hybrid method
zbMATH Keywords: minisum optimization
MaRDI profile type: Publication
full work available at URL: 0167-6377(83)90018-4
OpenAlex ID: W2130393191
cites work: Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
cites work: An Improved Algorithm for Discrete $l_1 $ Linear Approximation
cites work: Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods
cites work: Q3890424
cites work: Q3880601
cites work: Q4172009
cites work: An Algorithm for Constrained Optimization with Semismooth Functions
description: scientific article; zbMATH DE number 3818518