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

DOI10.1016/S0377-2217(97)00026-XzbMATH Open0955.90124MaRDI QIDQ1291728FDOQ1291728

Authors: Chung-Li Tseng 

Publication date: 22 February 2001

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

Recommendations

• A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)
• An improved univariate global optimization algorithm with improved linear lower bounding functions
• A derivative-free bracketing scheme for univariate minimization
• A multivariate global optimization using linear bounding functions

zbMATH Keywords

optimisationline searchunivariate optimizationlinear lower bounding function (LLBF)

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291728)