Interval-majorant method and global optimization

DOI10.1007/BF02243808zbMath0687.65065OpenAlexW196606265MaRDI QIDQ1263252

M. C. Eiermann, Zu He Shen

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationinterval methodguaranteed error boundsNumerical resultsinterval-majorant methodone-step strategy method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interval and finite arithmetic (65G30)

Related Items (1)

An interval maximum entropy method for a discrete minimax problem

Cites Work

• Unnamed Item
• Unnamed Item
• An interval version of Shubert's iterative method for the localization of the global maximum
• On computing the range of a rational function of n variables over a bounded region
• Optimal Search for the Global Maximum of Functions with Bounded Seminorm
• Iterative Methods for the Localization of the Global Maximum
• An algorithm for seeking the maximum value of univariate functions
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function

This page was built for publication: Interval-majorant method and global optimization