Complexity of general continuous minimization problems: a survey

DOI10.1080/10556780500139872zbMath1134.90055OpenAlexW2051736660MaRDI QIDQ5717540

Marco Gaviano, Daniela Lera

Publication date: 10 January 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

optimizationcomplexityglobal optimizationlocal optimalityblack-box modelinformation-based

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Numerical optimization and variational techniques (65K10)

Cites Work

• Minimal interatomic distance in Morse clusters
• Pure adaptive search in Monte Carlo optimization
• Pure adaptive search in global optimization
• Global optimization requires global information
• Introduction to global optimization
• Black-Box Complexity of Local Minimization
• A Complexity Analysis of Local Search Algorithms in Global Optimization
• Network Optimization Problems: Algorithms, Applications and Complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of general continuous minimization problems: a survey