On the convergence of a class of nonlinear approximation methods
From MaRDI portal
Publication:1169786
DOI10.1016/0021-9045(82)90043-0zbMath0495.65005OpenAlexW2053381820MaRDI QIDQ1169786
Publication date: 1982
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9045(82)90043-0
Algorithms for approximation of functions (65D15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
On level sets and an approximation problem for the numerical solution of a free boundary problem, An approximation technique for the numerical solution of a Stefan problem, Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ein Abstiegsverfahren für Approximationsaufgaben in normierten Räumen
- Dual methods for nonlinear best approximation problems
- On the convergence of an algorithm for discrete \(L_p\) approximation
- Eine Klasse von Verfahren zur Ermittlung bester nichtlinearer Tschebyscheff-Approximationen
- Numerische Methoden zur Behandlung einiger Problemklassen der nichtlinearen Tschebyscheff-Approximation mit Nebenbedingungen
- Discrete, non-linear approximation problems in polyhedral norms
- Discrete, nonlinear approximation problems in polyhedral norms: A Levenberg-like algorithm
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- A Newton-Raphson method for the solution of systems of equations
- Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
- A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps
- An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
- Nonlinear least squares — the Levenberg algorithm revisited
- Linearly constrained minimax optimization
- An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
- Extensions of Zangwill’s theorem
- The Minimax Solution of an Overdetermined System of Non-linear Equations
- An Algorithm for Minimax Approximation in the Nonlinear Case
- Convergence Conditions for Nonlinear Programming Algorithms
- On an algorithm for discrete nonlinear L1 approximation
- State Constraints in Convex Control Problems of Bolza
- The calculation of linear best Lp approximations
