Armijo Newton method for convex best interpolation

DOI10.1080/10556780500065432zbMath1094.41013OpenAlexW1973760913MaRDI QIDQ5478866

Xiao Qi Yang, Hou-Duo Qi

Publication date: 13 July 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500065432

zbMATH Keywords

Newton's methodLine searchConvex interpolation

Mathematics Subject Classification ID

Convex programming (90C25) Numerical computation of solutions to systems of equations (65H10) Approximation with constraints (41A29)

Related Items (1)

Error bounds and finite termination for constrained optimization problems

Cites Work

• Constrained \(L_ p\) approximation
• Constrained interpolation and smoothing
• Interpolation by smooth functions under restrictions on the derivatives
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Quadratic convergence of Newton's method for convex interpolation and smoothing
• An Algorithm for Constrained Interpolation
• Smoothing and Interpolation in a Convex Subset of a Hilbert Space
• Duality and well-posedness in convex interpolation^∗)
• Numerical Optimization
• A finite newton method for classification
• Best approximation in inner product spaces

This page was built for publication: Armijo Newton method for convex best interpolation