A class of nonmonotone Armijo-type line search method for unconstrained optimization

From MaRDI portal
Publication:2903129

DOI10.1080/02331934.2011.641126zbMath1246.90140OpenAlexW2043672507MaRDI QIDQ2903129

Keyvan Amini, Masoud Ahookhosh, Somayeh Bahrami

Publication date: 23 August 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.641126




Related Items (17)

An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimizationFinding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methodsA hybrid of adjustable trust-region and nonmonotone algorithms for unconstrained optimizationA new adaptive trust-region method for system of nonlinear equationsTwo globally convergent nonmonotone trust-region methods for unconstrained optimizationA nonmonotone ODE-based method for unconstrained optimizationTwo derivative-free projection approaches for systems of large-scale nonlinear monotone equationsA new nonmonotone spectral projected gradient algorithm for box-constrained optimization problems in \(m \times n\) real matrix space with application in image clusteringStructured adaptive spectral-based algorithms for nonlinear least squares problems with robotic arm modelling applicationsOn the worst-case evaluation complexity of non-monotone line search algorithmsOn the nonmonotonicity degree of nonmonotone line searchesHalf-quadratic image restoration with a non-parallelism constraintAn inexact line search approach using modified nonmonotone strategy for unconstrained optimizationA generalized worst-case complexity analysis for non-monotone line searchesOn efficiency of nonmonotone Armijo-type line searchesOn the inexact scaled gradient projection methodAn effective trust-region-based approach for symmetric nonlinear systems


Uses Software


Cites Work


This page was built for publication: A class of nonmonotone Armijo-type line search method for unconstrained optimization