A Complexity Analysis of Local Search Algorithms in Global Optimization

DOI10.1080/10556780290027783zbMath1029.90082OpenAlexW1994550052MaRDI QIDQ4806344

Daniela Lera, Marco Gaviano

Publication date: 10 February 2004

Published in: Optimization Methods and 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

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

Related Items (2)

Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Complexity of general continuous minimization problems: a survey

Uses Software

• Global Optimization Toolbox For Maple

Cites Work

• Unnamed Item
• Pure adaptive search in global optimization
• Computational methods in optimization. A unified approach.
• Handbook of global optimization
• Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999
• Introduction to global optimization
• Towards pure adaptive search
• Hyperbolicity in complex analysis
• Convex analysis and global optimization

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