A nonmonotone line search slackness technique for unconstrained optimization
type: Item
instance of: scholarly article
title: A nonmonotone line search slackness technique for unconstrained optimization
zbMATH Open document ID: 1274.90383
author: Ping Hu
author: Xu-Qing Liu
published in: Journal of Optimization Theory and Applications
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6225303
zbMATH Keywords: unconstrained optimization problem
zbMATH Keywords: nonmonotone line search slackness technique
zbMATH Keywords: BFGS algorithm
MaRDI profile type: Publication
full work available at URL: s10957-012-0247-7
OpenAlex ID: W2036873253
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Global convergence of nonmonotone descent methods for unconstrained optimization problems
cites work: A new nonmonotone line search technique for unconstrained optimization
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: Q5491447
cites work: Convergence of PRP method with new nonmonotone line search
cites work: Convergence of nonmonotone line search method
cites work: An unconstrained optimization method using nonmonotone second order Goldstein's line search
cites work: Nonmonotone line search algorithm for constrained minimax problems
cites work: Adaptive nonmonotone line search method for unconstrained optimization
cites work: Q3539529
cites work: New inexact line search method for unconstrained optimization
DOI: 10.1007/S10957-012-0247-7
description: scientific article; zbMATH DE number 6225303