Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
type: Item
instance of: scholarly article
title: Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
zbMATH Open document ID: 0342.65005
DOI: 10.1007/BF01394450
author: D. H. Anderson
author: Michael R. Osborne
published in: Numerische Mathematik
publication date: 1977-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/132480
Mathematics Subject Classification ID: 65D10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 41A45
Mathematics Subject Classification ID: 41A25
zbMATH DE Number: 3533970
MaRDI profile type: Publication
cites work: Discrete, linear approximation problems in polyhedral norms
cites work: Discrete, non-linear approximation problems in polyhedral norms
cites work: A method for the solution of certain non-linear problems in least squares
cites work: An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
cites work: Nonlinear least squares — the Levenberg algorithm revisited
cites work: Q5603731
OpenAlex ID: W2094457339
description: scientific article; zbMATH DE number 3533970