A Complexity Analysis of Local Search Algorithms in Global Optimization

DOI10.1080/10556780290027783MaRDI QIDQ4806344zbMATH OpenOpenAlexFDO

Authors Marco Gaviano, Daniela Lera

Publication date 10 February 2004

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

random search

Mathematics Subject Classification ID

Search theory (90B40) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Black-Box Complexity of Local Minimization
• Local search: complexity and approximation
• Pure adaptive search in global optimization
• Complexity of general continuous minimization problems: a survey
• Pure adaptive search for finite global optimization

Cites work

• scientific article; zbMATH DE number 1318491 (Why is no real title available?)
• Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
• Computational methods in optimization. A unified approach.
• Convex analysis and global optimization
• Handbook of global optimization
• Hyperbolicity in complex analysis
• Introduction to global optimization
• Pure adaptive search in global optimization
• Towards pure adaptive search

Cited in

(5)

• Complexity of general continuous minimization problems: a survey
• Analyzing the complexity of finding good neighborhood functions for local search algorithms
• Search complexity: a way for the quantitative analysis of the search space
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Black-Box Complexity of Local Minimization

Describes a project that uses

Uses Software

• Global Optimization Toolbox For Maple

This page was built for publication: A Complexity Analysis of Local Search Algorithms in Global Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806344)