A stochastic local search algorithm for constrained continuous global optimization
From MaRDI portal
Publication:4929093
DOI10.1111/j.1475-3995.2012.00854.xzbMath1267.90111OpenAlexW2046423007MaRDI QIDQ4929093
Wendel Melo, Márcia H. C. Fampa, Fernanda M. P. Raupp
Publication date: 13 June 2013
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2012.00854.x
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Speeding up continuous GRASP
- Direct search methods: Then and now
- Adaptive memory programming for constrained global optimization
- Derivative-free filter simulated annealing method for constrained continuous global optimization
- Global optimization by continuous grasp
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
- Tabu search directed by direct search methods for nonlinear global optimization
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Minimizing multimodal functions by simplex coding genetic algorithm
- Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- A Simplex Method for Function Minimization
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
This page was built for publication: A stochastic local search algorithm for constrained continuous global optimization
