Gradient subspace approximation: a direct search method for memetic computing

DOI10.1007/S00500-016-2187-XMaRDI QIDQ1703641zbMATH OpenOpenAlexFDO

Authors Oliver Schütze, Sergio Alvarado, Carlos Segura, Ricardo Landa

Publication date 7 March 2018

Published in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00500-016-2187-x

zbMATH Keywords

differential evolutiondirect searchevolutionary algorithmsmemetic computingscalar optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• The gradient subspace approximation and its application to bi-objective optimization problems
• Memetic evolutionary algorithms
• The directed search method for multi-objective memetic algorithms
• Comparative Investigation of Various Evolutionary and Memetic Algorithms
• On gradient-based local search to hybridize multi-objective evolutionary algorithms

Cites work

• `` Direct Search Solution of Numerical and Statistical Problems
• A robust secant method for optimization problems with inequality constraints
• A secant algorithm with line search filter method for nonlinear optimization
• Convergence speed in multi-objective metaheuristics: efficiency criteria and empirical study
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Evolution strategies. A comprehensive introduction
• Evolutionary Algorithms for Global Optimization
• Handbook of simulation optimization
• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 176824 (Why is no real title available?)
• scientific article; zbMATH DE number 1456803 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• Introduction to evolutionary computing
• Introduction to Genetic Algorithms
• The directed search method for multi-objective memetic algorithms

Cited in

(2)

• The gradient subspace approximation and its application to bi-objective optimization problems
• A Broyden-based algorithm for multi-objective local-search optimization

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Gradient subspace approximation: a direct search method for memetic computing

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