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

DOI10.1007/BF02404000zbMATH Open0851.90119OpenAlexW2058369923MaRDI QIDQ1918985FDOQ1918985

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

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

zbMATH Keywords

linear lower bounding functionsLLBF methodsunivariate global optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Title not available (Why is that?)

Cited In (5)

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

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)