An inexact line search approach using modified nonmonotone strategy for unconstrained optimization

From MaRDI portal
Revision as of 23:47, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2453471

DOI10.1007/s11075-013-9723-xzbMath1293.65087OpenAlexW1999842813MaRDI QIDQ2453471

Keyvan Amini, Masoud Ahookhosh, Hadi Nosratipour

Publication date: 6 June 2014

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-013-9723-x




Related Items (25)

A nonmonotone inexact Newton method for unconstrained optimizationAn adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimizationA secant-based Nesterov method for convex functionsStable equilibrium configuration of two bar truss by an efficient nonmonotone global Barzilai-Borwein gradient method in a fuzzy environmentFinding zeros of Hölder metrically subregular mappings via globally convergent Levenberg–Marquardt methodsContinuous and discrete Zhang dynamics for real-time varying nonlinear optimizationTwo globally convergent nonmonotone trust-region methods for unconstrained optimizationNonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty modelA hybrid quasi-Newton method with application in sparse recoveryAn extended nonmonotone line search technique for large-scale unconstrained optimizationOptimal subgradient algorithms for large-scale convex optimization in simple domainsNonmonotone quasi-Newton-based conjugate gradient methods with application to signal processingAn adaptive modified three-term conjugate gradient method with global convergenceAn efficient nonmonotone method for state-constrained elliptic optimal control problemsOn the nonmonotonicity degree of nonmonotone line searchesA new generalized shrinkage conjugate gradient method for sparse recoveryDesign and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimizationModified Newton integration algorithm with noise suppression for online dynamic nonlinear optimizationA generalized worst-case complexity analysis for non-monotone line searchesUnnamed ItemOn efficiency of nonmonotone Armijo-type line searchesA nonmonotone line search for the LBFGS method in parabolic optimal control problemsAccelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexityUnnamed ItemExtended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing


Uses Software


Cites Work


This page was built for publication: An inexact line search approach using modified nonmonotone strategy for unconstrained optimization