An efficient algorithm for unconstrained optimization

DOI10.1155/2015/178545zbMath1394.90474OpenAlexW1867216943WikidataQ59117488 ScholiaQ59117488MaRDI QIDQ1664864

Antonin Ponsich, Pedro Lara-Velázquez, Roman Anselmo Mora-Gutiérrez, Sergio Gerardo de-los-Cobos-Silva, Miguel Ángel Gutiérrez-Andrade, Eric Alfredo Rincón-García

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/178545

Mathematics Subject Classification ID

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

Uses Software

• Scatter Search
• Global Optimization Test
• AMPGO

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Solving unconstrained global optimization problems via hybrid swarm intelligence approaches
• Integrating particle swarm optimization with genetic algorithms for solving nonlinear optimization problems
• A modified particle swarm optimization via particle visual modeling analysis
• A new mutation operator for real coded genetic algorithms
• Tuning metaheuristics. A machine learning Perspective
• An improved real-coded population-based extremal optimization method for continuous unconstrained optimization problems
• SC-System of convergence theory and foundations
• Tabu Search—Part I