Gradient subspace approximation: a direct search method for memetic computing

DOI10.1007/s00500-016-2187-xzbMath1390.90593OpenAlexW2405408888MaRDI QIDQ1703641

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

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

evolutionary algorithmsscalar optimizationdirect searchdifferential evolutionmemetic computing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

A Broyden-based algorithm for multi-objective local-search optimization ⋮ The Gradient Subspace Approximation and Its Application to Bi-objective Optimization Problems

Uses Software

• BRENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Handbook of simulation optimization
• A secant algorithm with line search filter method for nonlinear optimization
• A robust secant method for optimization problems with inequality constraints
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Evolution strategies. A comprehensive introduction
• Convergence speed in multi-objective metaheuristics: Efficiency criteria and empirical study
• `` Direct Search Solution of Numerical and Statistical Problems
• Introduction to Genetic Algorithms
• Evolutionary Algorithms for Global Optimization
• Introduction to evolutionary computing
• The directed search method for multi-objective memetic algorithms

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