Rapidly convergent Steffensen-based methods for unconstrained optimization

DOI10.1051/RO/2017043OpenAlexW2617455158MaRDI QIDQ5242365

Mohammad Afzalinejad

Publication date: 6 November 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017043

zbMATH Keywords

unconstrained optimizationNewton's methodSteffensen's methodderivative-free

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modified secant-type methods for unconstrained optimization
• Some substantial modifications and improvements for derivative-free iterative methods and derivative-free transformation for multiple zeros
• Unconstrained derivative-free optimization by successive approximation
• Variants of Steffensen-Secant method and applications
• A class of modified secant methods for unconstrained optimization
• New quasi-Newton methods for unconstrained optimization problems
• How much do approximate derivatives hurt filter methods?
• Numerical Optimization

This page was built for publication: Rapidly convergent Steffensen-based methods for unconstrained optimization