\(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization

DOI10.1016/j.ins.2020.12.090zbMath1484.90100OpenAlexW3125940624MaRDI QIDQ2127089

Amir Nakib, Ghazaleh Khodabandelou

Publication date: 19 April 2022

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2020.12.090

zbMATH Keywords

multi-objective optimizationlarge-scale optimizationfractalsmetaheuristiccontinuous optimizationdeep learning

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• MSO

Cites Work

• Unnamed Item
• MSO: a framework for bound-constrained black-box global optimization algorithms
• Large scale evolutionary optimization using cooperative coevolution
• FRACTOP: A geometric partitioning metaheuristic for global optimization
• Lipschitzian optimization without the Lipschitz constant
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Memetic particle swarm optimization
• An Automatic Method for Solving Discrete Programming Problems
• Least squares quantization in PCM