Discrete, non-linear approximation problems in polyhedral norms

DOI10.1007/BF01394449zbMath0342.65004OpenAlexW4234792477MaRDI QIDQ1232139

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/132479

Mathematics Subject Classification ID

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

Related Items

Descent methods for composite nondifferentiable optimization problems, Local properties of inexact methods for minimizing nonsmooth composite functions, Dual methods for nonlinear best approximation problems, Second order necessary and sufficient conditions for convex composite NDO, Discrete minimax problem: Algorithms and numerical comparisons, Strong uniqueness and second order convergence in nonlinear discrete approximation, On the convergence of a class of nonlinear approximation methods, On influence assessment for LAD regression, Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm, Approximation in normed linear spaces, Huber approximation for the non-linear \(l_{1}\) problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete, linear approximation problems in polyhedral norms
• An Algorithm for Minimax Approximation in the Nonlinear Case
• On an algorithm for discrete nonlinear L1 approximation
• A method for the solution of certain non-linear problems in least squares