Strong uniqueness and second order convergence in nonlinear discrete approximation

DOI10.1007/BF01403680zbMath0486.65008MaRDI QIDQ1164952

Krisorn Jittorntrum, Michael R. Osborne

Publication date: 1980

Published in: Numerische Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

second order convergencestrong uniquenessdiscrete nonlinear approximationgeneralised Gauss-Newton methodmultiplier condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15)

Related Items

Uniform convergence of higher order quasi Hermite-Fejér interpolation, Two-square theorems for infinite matrices on certain fields, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Sharp minima for multiobjective optimization in Banach spaces, A Gauss-Newton method for convex composite optimization, Robust low transformed multi-rank tensor methods for image alignment, Local properties of inexact methods for minimizing nonsmooth composite functions, TILT: transform invariant low-rank textures, Generalized weak sharp minima in cone-constrained convex optimization with applications, Conic positive definiteness and sharp minima of fractional orders in vector optimization problems, Tensor factorization via transformed tensor-tensor product for image alignment, Gauss-Newton method for convex composite optimizations on Riemannian manifolds, Local and global behavior for algorithms of solving equations, Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems, Global weak sharp minima for convex (semi-)infinite optimization problems, An algorithm for fitting circular arcs to data using the \(l_1\) norm, Subsmooth semi-infinite and infinite optimization problems, Approximation in normed linear spaces, Local properties of algorithms for minimizing nonsmooth composite functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete, linear approximation problems in polyhedral norms
• Discrete, non-linear approximation problems in polyhedral norms
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• Trajectory analysis and extrapolation in barrier function methods
• Convex Programming and Duality in Normed Space
• Convex Analysis