Using a Gradient Based Method to Seed an EMO Algorithm

DOI10.1007/978-3-642-04045-0_28zbMATH Open1184.90154OpenAlexW2132427523MaRDI QIDQ3556574FDOQ3556574

Authors: Alfredo G. Hernández-Díaz, Carlos A. Coello Coello, Fátima Pérez, Rafael Caballero, Julian Molina 

Publication date: 24 April 2010

Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04045-0_28

Recommendations

• scientific article; zbMATH DE number 739537
• scientific article; zbMATH DE number 549936
• Improving the EM Algorithm
• EM Algorithms
• Implementation of EM algorithm based on non-precise observations
• scientific article; zbMATH DE number 788227

zbMATH Keywords

rough setsmulti-objective programmingevolutionary multi-objective optimizationquadratic approximationgradient based method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Cited In (2)

• On gradient-based local search to hybridize multi-objective evolutionary algorithms
• The gradient subspace approximation and its application to bi-objective optimization problems

Uses Software

• EMOO
• SSPMO

This page was built for publication: Using a Gradient Based Method to Seed an EMO Algorithm

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