An improved univariate global optimization algorithm with improved linear lower bounding functions

DOI10.1007/BF02404000MaRDI QIDQ1918985zbMATH OpenOpenAlexFDO

Authors Xiaojun Wang, T. S. Chang

Publication date 25 November 1996

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02404000

zbMATH Keywords

linear lower bounding functionsLLBF methodsunivariate global optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A multivariate global optimization using linear bounding functions
• A Newton-type univariate optimization algorithm for locating the nearest extremum
• LP-form inclusion functions for global optimization
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 193463 (Why is no real title available?)
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Convex Analysis

Cited in

(5)

• Piecewise linear bounding functions in univariate global optimization
• Convex quadratic underestimation and Branch and Bound for univariate global optimization with one nonconvex constraint
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions
• A framework for globally convergent algorithms using gradient bounding functions
• On Hölder global optimization method using piecewise affine bounding functions

This page was built for publication: An improved univariate global optimization algorithm with improved linear lower bounding functions

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