Random and quasi-random linkage methods in global optimization

DOI10.1023/A:1008354314309MaRDI QIDQ1281483zbMATH OpenFDO

Authors Fabio Schoen

Publication date 22 March 1999

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

Full work available at URL https://doi.org/10.1023/A:1008354314309

zbMATH Keywords

quasi-random sequencessimple linkagestochastic global optimizationsurveytwo-phase algorithms

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Random linkage: A family of acceptance/rejection algorithms for global sation
• scientific article; zbMATH DE number 3912117
• scientific article; zbMATH DE number 3974192
• scientific article; zbMATH DE number 3924519
• Stochastic global optimization methods part II: Multi level methods

Cited in

(10)

• Random linkage: A family of acceptance/rejection algorithms for global sation
• Simple linkage: Analysis of a threshold-accepting global optimization method
• Pseudorandom lattices for global optimization
• Application of deterministic low-discrepancy sequences in global optimization
• Comparison of deterministic and stochastic approaches to global optimization
• scientific article; zbMATH DE number 1070395 (Why is no real title available?)
• scientific article; zbMATH DE number 1857674 (Why is no real title available?)
• Probabilistic adaptations of point generation schemes in some global optimization algorithms
• Global optimization based on local searches
• Global optimization based on local searches

This page was built for publication: Random and quasi-random linkage methods in global optimization

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