Customizing methods for global optimization -- a geometric viewpoint

DOI10.1007/BF01096738zbMath0794.90056OpenAlexW2018141304MaRDI QIDQ2366969

Yanyan Li

Publication date: 15 August 1993

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

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

zbMATH Keywords

global optimizationmultidimensional bisection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (10)

Towards pure adaptive search ⋮ On parallel branch and bound frameworks for global optimization ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ An application of Lipschitzian global optimization to product design ⋮ Accelerations for a variety of global optimization methods ⋮ Accelerations for global optimization covering methods using second derivatives ⋮ On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization ⋮ Multidimensional bisection: A dual viewpoint

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Multidimensional bisection: the performance and the context
• Multidimensional bisection applied to global optimisation
• The bisection method in higher dimensions
• A deterministic algorithm for global optimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• 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: Customizing methods for global optimization -- a geometric viewpoint