A new regularized quasi-Newton method for unconstrained optimization
From MaRDI portal
Publication:1800450
DOI10.1007/s11590-018-1236-zzbMath1407.90313OpenAlexW2793660965MaRDI QIDQ1800450
Publication date: 23 October 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1236-z
Related Items (2)
Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization ⋮ Two-phase quasi-Newton method for unconstrained optimization problem
Uses Software
Cites Work
- Convergence properties of the regularized Newton method for the unconstrained nonconvex optimization
- A regularized Newton method without line search for unconstrained optimization
- Truncated regularized Newton method for convex minimizations
- Regularized Newton method for unconstrained convex optimization
- Nonmonotonic trust region algorithm
- Representations of quasi-Newton matrices and their use in limited memory methods
- A new regularized quasi-Newton algorithm for unconstrained optimization
- Regularized Newton methods for convex minimization problems with singular solutions
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- On efficiently combining limited-memory and trust-region techniques
- Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices
- Computing a Trust Region Step
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new regularized quasi-Newton method for unconstrained optimization
