A class of modified secant methods for unconstrained optimization
This short article introduces a class of modified secant methods to solve the univariate minimization problem. The first section provides a brief overview of the background on this problem, followed by an outline of the secant method which avoids evaluations of second order derivatives at each step of the Newton iterative method. The second section of the article describes the improved secant method proposed by the authors and studies its convergence properties. The paper concludes with a short section of numerical examples.
- A modified secant method for unconstrained optimization
- Modified secant-type methods for unconstrained optimization
- A new secant-type method for univariate unconstrained optimization
- A modified secant equation quasi-Newton method for unconstrained optimization
- A modified conjugate gradient method based on a modified secant equation
- A modified secant method for unconstrained optimization
- scientific article; zbMATH DE number 3658896 (Why is no real title available?)
- scientific article; zbMATH DE number 3709513 (Why is no real title available?)
- scientific article; zbMATH DE number 2141119 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Modified secant-type methods for unconstrained optimization
- On the convergent iteration method of order two for finding zeros of the derivative
- A new secant-type method for univariate unconstrained optimization
- scientific article; zbMATH DE number 640536 (Why is no real title available?)
- Rapidly convergent Steffensen-based methods for unconstrained optimization
- Modified secant-type methods for unconstrained optimization
- A modified secant method for unconstrained optimization
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
- A monotone gradient method via weak secant equation for unconstrained optimization
This page was built for publication: A class of modified secant methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378694)