A self-adaptive trust region method with line search based on a simple subproblem model
type: Item
instance of: scholarly article
title: A self-adaptive trust region method with line search based on a simple subproblem model
zbMATH Open document ID: 1175.90378
author: Zhaoyang Sang
author: Qingying Sun
published in: Journal of Computational and Applied Mathematics
publication date: 2009-09-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 5608845
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: trust region methods
zbMATH Keywords: line search
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: j.cam.2009.06.027
OpenAlex ID: W2047785690
cites work: A New Algorithm for Unconstrained Optimization
cites work: Two new unconstrained optimization algorithms which use function and gradient values
cites work: A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: Q3840111
cites work: Automatic Determination of an Initial Trust Region in Nonlinear Programming
cites work: An adaptive trust region method and its convergence
cites work: Convergence of quasi-Newton method with new inexact line search
cites work: Efficient hybrid conjugate gradient techniques
cites work: Testing Unconstrained Optimization Software
cites work: Q5474945
DOI: 10.1016/J.CAM.2009.06.027
description: scientific article; zbMATH DE number 5608845