Global optimization by continuous grasp

DOI10.1007/s11590-006-0021-6zbMath1149.90119MaRDI QIDQ2458920

Mauricio G. C. Resende, Panos M. Pardalos, Cláudio N. Meneses, Michael J. Hirsch

Publication date: 5 November 2007

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.392

zbMATH Keywords

global optimization; search procedure

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

Correspondence of projected 3-D points and lines using a continuous GRASP, A stochastic local search algorithm for constrained continuous global optimization, Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, Annealing evolutionary stochastic approximation Monte Carlo for global optimization, A survey on optimization metaheuristics, A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm, Hybrid scatter tabu search for unconstrained global optimization, BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering, On the incorporation of adversarial reasoning in course of action analysis and resource allocation, A biased random-key genetic algorithm for the Steiner triple covering problem, Continuous GRASP with a local active-set method for bound-constrained global optimization, A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization, GRASP with path-relinking for the generalized quadratic assignment problem, A review of recent advances in global optimization, The GLOBAL optimization method revisited, A branch and bound algorithm for numerical Max-CSP, Speeding up continuous GRASP, Solving systems of nonlinear equations with continuous GRASP, Contribution to the brachistochrone problem with Coulomb friction, Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies, Improving differential evolution through a unified approach, A FPGA-based accelerated architecture for the continuous GRASP, A Python/C library for bound-constrained global optimization with continuous GRASP, Global convergence and the Powell singular function, One side cut accelerated random search, A cover partitioning method for bound constrained global optimization, A CARTOPT METHOD FOR BOUND-CONSTRAINED GLOBAL OPTIMIZATION, Multilevel (Hierarchical) Optimization: Complexity Issues, Optimality Conditions, Algorithms, A novel global optimization technique for high dimensional functions

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Monte Carlo simulated annealing approach to optimization over continuous variables
• A probabilistic heuristic for a computationally difficult set covering problem
• An evaluation of the Sniffer global optimization algorithm using standard test functions
• A collection of test problems for constrained global optimization algorithms
• Handbook of test problems in local and global optimization
• Experiments using interval analysis for solving a circuit design problem
• Greedy randomized adaptive search procedures
• A methodology for solving chemical equilibrium systems
• A novel metaheuristics approach for continuous global optimization
• Tabu search directed by direct search methods for nonlinear global optimization
• Taboo Search: An Approach to the Multiple Minima Problem
• TRUST: A Deterministic Algorithm for Global Optimization
• Aircraft routing under the risk of detection
• Some tests of generalized bisection
• Chemical equilibrium systems as numerical test problems
• Enhanced simulated annealing for globally minimizing functions of many-continuous variables
• Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
• Minimizing multimodal functions by simplex coding genetic algorithm
• Introduction to global optimization.
• Progress in the solving of a circuit design problem