A Newton-type univariate optimization algorithm for locating the nearest extremum

DOI10.1016/S0377-2217(97)00026-XzbMath0955.90124MaRDI QIDQ1291728

Chung-Li Tseng

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimisationline searchunivariate optimizationlinear lower bounding function (LLBF)

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Related Items (7)

A new robust line search technique based on Chebyshev polynomials ⋮ Modified secant-type methods for unconstrained optimization ⋮ A modified secant method for unconstrained optimization ⋮ A class of exponential quadratically convergent iterative formulae for unconstrained optimization ⋮ A generalized univariate Newton method motivated by proximal regularization ⋮ A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) ⋮ On an iterative method for\cr unconstrained optimization

Cites Work

• An approach to nonlinear programming
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• The Variable Reduction Method for Nonlinear Programming
• Global optimization

This page was built for publication: A Newton-type univariate optimization algorithm for locating the nearest extremum