Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
From MaRDI portal
Publication:1232140
DOI10.1007/BF01394450zbMath0342.65005OpenAlexW2094457339MaRDI QIDQ1232140
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
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 (7)
Local properties of inexact methods for minimizing nonsmooth composite functions ⋮ 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 ⋮ Huber approximation for the non-linear \(l_{1}\) problem ⋮ A projected conjugate gradient method for sparse minimax problems
Cites Work
- Unnamed Item
- Discrete, linear approximation problems in polyhedral norms
- Discrete, non-linear approximation problems in polyhedral norms
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- Nonlinear least squares — the Levenberg algorithm revisited
- A method for the solution of certain non-linear problems in least squares
This page was built for publication: Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
