A local search method for continuous global optimization

DOI10.1007/S10898-009-9519-7zbMath1202.90214OpenAlexW2013589476MaRDI QIDQ1959248

A. M. Steri, Daniela Lera, Marco Gaviano

Publication date: 6 October 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9519-7

zbMATH Keywords

random search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (1)

Properties and numerical testing of a parallel global optimization algorithm

Uses Software

• Algorithm 829
• KELLEY

Cites Work

• Unnamed Item
• Unnamed Item
• Random tunneling by means of acceptance-rejection sampling for global optimization
• Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
• Handbook of global optimization
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Stochastic global optimization.
• Tabu search directed by direct search methods for nonlinear global optimization
• Bayesian stopping rules for multistart global optimization methods
• The Tunneling Algorithm for the Global Minimization of Functions
• Algorithm 829
• SPT: A stochastic tunneling algorithm for global optimization

This page was built for publication: A local search method for continuous global optimization