A nonmonotone conic trust region method based on line search for solving unconstrained optimization
type: Item
instance of: scholarly article
title: A nonmonotone conic trust region method based on line search for solving unconstrained optimization
zbMATH Open document ID: 1160.90008
author: Shaojian Qu
author: Qing-Pu Zhang
author: Yueting Yang
published in: Journal of Computational and Applied Mathematics
publication date: 2009-02-25T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5518714
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: trust region method
zbMATH Keywords: conic model
zbMATH Keywords: nonmonotone technique
zbMATH Keywords: line search technique
zbMATH Keywords: algorithm
zbMATH Keywords: convergence
zbMATH Keywords: numerical experiments
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: j.cam.2008.05.028
OpenAlex ID: W2037454731
cites work: Q3882253
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: Q3840111
cites work: A conic trust-region method for optimization with nonlinear equality and inequality constrains via active-set strategy
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: A nonmonotone adaptive trust region method and its convergence
cites work: A nonmonotone trust region method for unconstrained optimization
cites work: A nonmonotone trust region method for nonlinear programming with simple bound constraints
cites work: Conic Approximations and Collinear Scalings for Optimizers
cites work: The Q-Superlinear Convergence of a Collinear Scaling Algorithm for Unconstrained Optimization
cites work: Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms
cites work: Testing Unconstrained Optimization Software
cites work: A nonmonotone trust-region method of conic model for unconstrained optimization
cites work: Global convergence of conjugate gradient methods without line search
cites work: Global convergence of a two-parameter family of conjugate gradient methods without line search
DOI: 10.1016/J.CAM.2008.05.028
Recommended article: Nonmonotone conic trust region method with line search technique for bound constrained optimization
Recommended article: Combining nonmonotone conic trust region and line search techniques for unconstrained optimization
Recommended article: A nonmonotone trust region method with new inexact line search for unconstrained optimization
Recommended article: A nonmonotone trust-region method of conic model for unconstrained optimization
Recommended article: A new nonmonotone trust-region method of conic model for solving unconstrained optimization
Recommended article: A nonmonotone trust region method based on simple conic models for unconstrained optimization
Recommended article: A new nonmonotone adaptive trust region line search method for unconstrained optimization
Recommended article: A nonmonotone trust-region line search method for large-scale unconstrained optimization
Recommended article: A nonmonotone adaptive trust region method based on conic model for unconstrained optimization
Recommended article: A nonmonotone adaptive trust region method for unconstrained optimization based on conic model
description: scientific article; zbMATH DE number 5518714