Global optimization by continuous GRASP
Michael J. Hirsch (mjh8787ufl.edu)
Abstract: We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende's greedy randomized adaptive search procedure (GRASP) from the domain of discrete optimization to that of continuous global optimization. This stochastic local search method is simple to implement, is widely applicable, and does not make use of derivative information, thus making it a well-suited approach for solving global optimization problems. We illustrate the effectiveness of the procedure on a set of standard test problems as well as two hard global optimization problems.
Keywords: GRASP, global optimization, continuous optimization, stochastic algorithm, stochastic local search, nonlinear programming.
Category 1: Global Optimization (Stochastic Approaches )
Category 2: Combinatorial Optimization (Meta Heuristics )
Citation: AT&T Labs Research Technical Report TD-6MPUV9. AT&T Labs Research, Florham Park, NJ 07932, March 8, 2006.
Entry Submitted: 03/09/2006
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|