A class of modified secant methods for unconstrained optimization

From MaRDI portal





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.











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)