A new regularized quasi-Newton algorithm for unconstrained optimization
type: Item
instance of: scholarly article
title: A new regularized quasi-Newton algorithm for unconstrained optimization
zbMATH Open document ID: 1390.90527
author: Y. Aharonov
published in: Applied Mathematics and Computation
publication date: 2018-06-07T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 58C15
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 49M15
zbMATH DE Number: 6881737
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: regularization
describes a project that uses: CUTEr
describes a project that uses: SifDec
describes a project that uses: HSL-VF05
MaRDI profile type: Publication
full work available at URL: j.amc.2015.02.032
OpenAlex ID: W1997879275
cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: On the global convergence of trust region algorithms for unconstrained minimization
cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
cites work: Q4382723
cites work: Solving the Trust-Region Subproblem using the Lanczos Method
cites work: CUTEr and SifDec
DOI: 10.1016/J.AMC.2015.02.032
description: scientific article; zbMATH DE number 6881737