Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm

DOI10.1007/BF01394450MaRDI QIDQ1232140zbMATH OpenOpenAlexFDO

Authors D. H. Anderson, Michael R. Osborne

Publication date 1977

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/132480

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Approximation by arbitrary linear expressions (41A45) Numerical smoothing, curve fitting (65D10) Numerical mathematical programming methods (65K05)

Cites work

• A method for the solution of certain non-linear problems in least squares
• An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
• Discrete, linear approximation problems in polyhedral norms
• Discrete, non-linear approximation problems in polyhedral norms
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• Nonlinear least squares — the Levenberg algorithm revisited

Cited in

(7)

• Compromise solutions and estimation of the noninferior set
• Dual methods for nonlinear best approximation problems
• Discrete minimax problem: Algorithms and numerical comparisons
• On the convergence of a class of nonlinear approximation methods
• A projected conjugate gradient method for sparse minimax problems
• Huber approximation for the non-linear \(l_{1}\) problem
• Local properties of inexact methods for minimizing nonsmooth composite functions

This page was built for publication: Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm

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