One side cut accelerated random search

DOI10.1007/s11590-013-0631-8zbMath1292.90240OpenAlexW2270032122WikidataQ60401422 ScholiaQ60401422MaRDI QIDQ2448186

Yanyan Li

Publication date: 30 April 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0631-8

zbMATH Keywords

direct searchbound constrained global optimizationOSCARS

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The robust constant and its applications in random global search for unconstrained global optimization ⋮ Stochastic filter methods for generally constrained global optimization ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization

Uses Software

• minpack

Cites Work

• A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
• The GLOBAL optimization method revisited
• Speeding up continuous GRASP
• Convergence qualification of adaptive partition algorithms in global optimization
• Lipschitzian optimization without the Lipschitz constant
• Topographical multilevel single linkage
• Global optimization by continuous grasp
• A cover partitioning method for bound constrained global optimization
• Pure Random Search with exponential rate of convergency
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Testing Unconstrained Optimization Software
• Adaptive partitioned random search to global optimization
• On Accelerated Random Search