One side cut accelerated random search

DOI10.1007/S11590-013-0631-8MaRDI QIDQ2448186zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

bound constrained global optimizationdirect searchOSCARS

Mathematics Subject Classification ID

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

Recommendations

• On Accelerated Random Search
• Random search in the one-dimensional cutting stock problem
• scientific article; zbMATH DE number 934538
• One-dimensional simplex search
• scientific article; zbMATH DE number 1467487
• Evaluation of algorithms for one-dimensional cutting
• Improving branch-and-cut performance by random sampling
• Randomizing Reductions of Search Problems

Cites work

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

Cited in

(10)

• Global optimization by multilevel coordinate search
• Accelerated random search for constrained global optimization assisted by radial basis function surrogates
• \textsc{Oscars}-II: an algorithm for bound constrained global optimization
• Pure random search with virtual extension of feasible region
• The robust constant and its applications in random global search for unconstrained global optimization
• A cover partitioning method for bound constrained global optimization
• Stochastic filter methods for generally constrained global optimization
• scientific article; zbMATH DE number 3941278 (Why is no real title available?)
• Using estimated gradients in bound-constrained global optimization
• Extending OSCARS-II to generally constrained global optimization

Describes a project that uses

Uses Software

• minpack

This page was built for publication: One side cut accelerated random search

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