On the convergence of adaptive partition algorithms in global optimization

DOI10.1080/02331939008843540zbMath0711.90074OpenAlexW1976735801MaRDI QIDQ3496164

János D. Pintér

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843540

zbMATH Keywords

convergenceadaptive partition algorithmsconvergent partition strategiesmulti-extremal Lipschitz- continuous function

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)

Cites Work

• Set partition by globally optimized cluster seed points
• Extended univariate algorithms for \(n\)-dimensional global optimization
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• Global optimization on convex sets
• A probabilistic algorithm for global optimization
• Convergence qualification of adaptive partition algorithms in global optimization
• Globally convergent methods for n-dimensional multiextremal optimization
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Two algorithms for one-dimensional multimodai minimization
• A Sequential Method Seeking the Global Maximum of a Function
• Unnamed Item

This page was built for publication: On the convergence of adaptive partition algorithms in global optimization