Modified secant-type methods for unconstrained optimization
From MaRDI portal
Publication:856130
DOI10.1016/J.AMC.2006.03.003zbMATH Open1105.65058OpenAlexW2008249171MaRDI QIDQ856130FDOQ856130
Authors: Emin Kahya 
Publication date: 7 December 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.03.003
Recommendations
- A modified secant method for unconstrained optimization
- A class of modified secant methods for unconstrained optimization
- A new secant-type method for univariate unconstrained optimization
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
- A modified conjugate gradient method based on a modified secant equation
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Numerical computation of solutions to single equations (65H05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Newton-type methods with cubic convergence
- An approach to nonlinear programming
- Some variant of Newton's method with third-order convergence.
- On some third-order iterative methods for solving nonlinear equations
- Title not available (Why is that?)
- On Fibonacci search method with \(k\)-Lucas numbers.
- A new unidimensional search method for optimization: linear interpolation method
- Title not available (Why is that?)
- A new unidimensional search method for optimization: the 5/9 method
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- On modified Newton methods with cubic convergence
Cited In (12)
- A new secant-type method for univariate unconstrained optimization
- Title not available (Why is that?)
- A class of modified secant methods for unconstrained optimization
- Rapidly convergent Steffensen-based methods for unconstrained optimization
- A new robust line search technique based on Chebyshev polynomials
- On an iterative method for unconstrained optimization
- Title not available (Why is that?)
- A modified secant method for unconstrained optimization
- New BFGS method for unconstrained optimization problem based on modified Armijo line search
- A class of exponential quadratically convergent iterative formulae for unconstrained optimization
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
- An improved secant method
This page was built for publication: Modified secant-type methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856130)
