New zero-finders for trust-region computations
From MaRDI portal
Publication:1678583
DOI10.1007/S11075-016-0260-2zbMATH Open1394.65040OpenAlexW2567302026MaRDI QIDQ1678583FDOQ1678583
Authors: Maged Alkilayh, Jinyun Yuan, 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
Recommendations
- A trust region method for zero-one nonlinear programming
- A new trust region method for nonsmooth equations
- A new trust region method for nonlinear equations
- scientific article; zbMATH DE number 2069282
- Recent advances in trust region algorithms
- On the convergence of a new trust region algorithm
- A new zero-finder for Tikhonov regularization
- scientific article; zbMATH DE number 884984
- scientific article; zbMATH DE number 4162674
- Trust Region Algorithms for Solving Nonsmooth Equations
Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Newton-type methods (49M15)
Cites Work
- Computing a Trust Region Step
- Numerical Optimization
- Smoothing by spline functions.
- Smoothing by spline functions. II
- Trust Region Methods
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Newton’s Method with a Model Trust Region Modification
- Quadratically constrained least squares and quadratic problems
- Least squares with a quadratic constraint
- Tikhonov Regularization with a Solution Constraint
- A global Lanczos method for image restoration
- Gauss quadrature applied to trust region computations
Cited In (2)
Uses Software
This page was built for publication: New zero-finders for trust-region computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1678583)
