A multi-start gradient combination method for high-performance global search

DOI10.1142/S0217595923400134zbMATH Open1547.90157MaRDI QIDQ6542986FDOQ6542986

Authors: Ruikang Ma, P. Li, Xinru Guo, Hao Zhang, Qiang Zhang, Li Ning 

Publication date: 23 May 2024

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Recommendations

• A hybrid descent method for global optimization
• Simple genetic algorithm with local tuning: Efficient global optimizing technique
• A new hybrid algorithm combining a new chaos optimization approach with gradient descent for high dimensional optimization problems
• A hybrid optimization technique coupling an evolutionary and a local search algorithm
• A hybrid genetic pattern search augmented Lagrangian method for constrained global optimization

zbMATH Keywords

global optimumgenetic algorithmmulti-start method

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A continuous genetic algorithm designed for the global optimization of multimodal functions
• Multi-start methods for combinatorial optimization
• Multi-Start Methods
• One-space bounded algorithms for two-dimensional bin packing
• Approximating the minimum weight weak vertex cover
• GGA: a modified genetic algorithm with gradient-based local search for solving constrained optimization problems

This page was built for publication: A multi-start gradient combination method for high-performance global search

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