Truncated regularized Newton method for convex minimizations
From MaRDI portal
Publication:842780
DOI10.1007/s10589-007-9128-7zbMath1176.90461OpenAlexW2102853500MaRDI QIDQ842780
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9128-7
Related Items (6)
Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ An inexact proximal regularization method for unconstrained optimization ⋮ Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC ⋮ A new regularized quasi-Newton method for unconstrained optimization ⋮ A regularized Newton method without line search for unconstrained optimization
Uses Software
Cites Work
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- On the convergence of an inexact Newton-type method
- Assessing a search direction within a truncated Newton method
- Local behavior of an iterative framework for generalized equations with nonisolated solutions
- A survey of truncated-Newton methods
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
- Superlinear convergence of a Newton-type algorithm for monotone equations
- Regularized Newton methods for convex minimization problems with singular solutions
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Truncated regularized Newton method for convex minimizations