On an iterative method for\cr unconstrained optimization
From MaRDI portal
Publication:2787096
DOI10.4064/am2254-11-2015zbMath1331.65030OpenAlexW2518136451MaRDI QIDQ2787096
Publication date: 24 February 2016
Published in: Applicationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/am2254-11-2015
Numerical smoothing, curve fitting (65D10) Nonlinear programming (90C30) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Cites Work
- Unnamed Item
- Modified secant-type methods for unconstrained optimization
- Some new iterative methods with three-order convergence
- A modified secant method for unconstrained optimization
- Improved results on estimating and extending the radius of an attraction ball
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- Geometric constructions of iterative functions to solve nonlinear equations
- Some variant of Newton's method with third-order convergence.
- Some new variants of Newton's method.
- Convergence analysis of the secant type methods
- The convergence ball of Newton-like methods in Banach space and applications
- Convergence behaviour of inexact Newton methods under weak Lipschitz condition.
- A new unidimensional search method for optimization: linear interpolation method
- Convergence and Applications of Newton-type Iterations
- On local convergence of a Newton-type method in Banach space
This page was built for publication: On an iterative method for\cr unconstrained optimization