Complexity of general continuous minimization problems: a survey

DOI10.1080/10556780500139872MaRDI QIDQ5717540zbMATH OpenOpenAlexFDO

Authors Marco Gaviano, Daniela Lera

Publication date 10 January 2006

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

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

zbMATH Keywords

black-box modelcomplexityglobal optimizationinformation-basedlocal optimalityoptimization

Mathematics Subject Classification ID

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

Recommendations

• Black-Box Complexity of Local Minimization
• An upper bound on the asymptotic complexity of global optimization of smooth univariate functions
• Lower bound on complexity of optimization of continuous functions
• A Complexity Analysis of Local Search Algorithms in Global Optimization
• The complexity of the computation of a global minimum in certain classes of optimization problems

Cites work

• A Complexity Analysis of Local Search Algorithms in Global Optimization
• Black-Box Complexity of Local Minimization
• Global optimization requires global information
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1246413 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Introduction to global optimization
• Minimal interatomic distance in Morse clusters
• Network Optimization Problems: Algorithms, Applications and Complexity
• Pure adaptive search in global optimization
• Pure adaptive search in Monte Carlo optimization

Cited in

(3)

• Lower bound on complexity of optimization of continuous functions
• Black-Box Complexity of Local Minimization
• A Complexity Analysis of Local Search Algorithms in Global Optimization

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

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