New zero-finders for trust-region computations

DOI10.1007/s11075-016-0260-2zbMath1394.65040OpenAlexW2567302026MaRDI QIDQ1678583

Jin Yun Yuan, Maged Alkilayh, Lothar Reichel

Publication date: 17 November 2017

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-016-0260-2

zbMATH Keywords

optimizationNewton's methodnonlinear equationscubic convergencetrust region subproblemzero-finder

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Smoothing by spline functions. II
• Least squares with a quadratic constraint
• Quadratically constrained least squares and quadratic problems
• Gauss quadrature applied to trust region computations
• Smoothing by spline functions.
• A Trust-Region Approach to the Regularization of Large-Scale Discrete Forms of Ill-Posed Problems
• Computing a Trust Region Step
• Newton’s Method with a Model Trust Region Modification
• Numerical Optimization
• Trust Region Methods
• Tikhonov Regularization with a Solution Constraint
• A global Lanczos method for image restoration