On the worst-case evaluation complexity of non-monotone line search algorithms
type: Item
instance of: scholarly article
title: On the worst-case evaluation complexity of non-monotone line search algorithms
zbMATH Open document ID: 1388.90111
author: Ekkehard W. Sachs
author: Geovani Nunes Grapiglia
published in: Computational Optimization and Applications
publication date: 2018-02-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 6833520
zbMATH Keywords: nonlinear optimization
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: non-monotone line search
zbMATH Keywords: worst-case complexity
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10589-017-9928-3
OpenAlex ID: W2739128850
cites work: A class of nonmonotone Armijo-type line search method for unconstrained optimization
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
cites work: Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
cites work: Worst case complexity of direct search under convexity
cites work: Benchmarking optimization software with performance profiles.
cites work: Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians
cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
cites work: On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization
cites work: Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality
cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization
cites work: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
cites work: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values
cites work: Testing Unconstrained Optimization Software
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Cubic regularization of Newton method and its global performance
cites work: Q5500903
cites work: Optimization theory and methods. Nonlinear programming
cites work: Worst case complexity of direct search
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
DOI: 10.1007/S10589-017-9928-3
description: scientific article; zbMATH DE number 6833520