A new version of the Price's algorithm for global optimization

DOI10.1023/A:1008250020656zbMath0877.65038OpenAlexW1557980267MaRDI QIDQ1359103

M. De Felice Ciccoli, P. Brachetti, Gianni Di Pillo, Stefano Lucidi

Publication date: 8 December 1997

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

Full work available at URL: https://doi.org/10.1023/a:1008250020656

zbMATH Keywords

unconstrained optimizationPrice's algorithmbinary star light curvescontrolled random search method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (13)

Efficient unconstrained black box optimization ⋮ NUMERICAL STUDIES OF SOME GENERALIZED CONTROLLED RANDOM SEARCH ALGORITHMS ⋮ A modification to the new version of the Price's algorithm for continuous global optimization problems ⋮ A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ Comparing estimation methods for the FPLD ⋮ A direct stochastic algorithm for global search ⋮ Unnamed Item ⋮ Global optimization for possibly time-dependent cost functions by a population set-based algorithm with births control ⋮ A deterministic method for continuous global optimization using a dense curve ⋮ A probabilistic cooperative-competitive hierarchical model for global optimization ⋮ Genetic approach helps to speed classical Price algorithm for global optimization ⋮ GLODS: global and local optimization using direct search

Uses Software

• ACRS

This page was built for publication: A new version of the Price's algorithm for global optimization