Solution polishing via path relinking for continuous black-box optimization

DOI10.1007/S11590-024-02127-8MaRDI QIDQ6968756zbMATH OpenFDO

Authors Dimitri J. Papageorgiou, Jan Kronqvist, Asha Ramanujam, James Kor, Youngdae Kim, Can Li

Publication date 24 June 2025

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02127-8

zbMATH Keywords

black-box optimizationderivative-free optimizationline searchpath relinkingsolution polishing

Mathematics Subject Classification ID

Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Operations research, mathematical programming (90-XX) Mathematical programming (90Cxx)

Cites work

• Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
• An evolutionary algorithm for polishing mixed integer programming solutions
• Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies
• Derivative-free optimization methods
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Fundamentals of scatter search and path relinking
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• Introduction to Derivative-Free Optimization
• Review and comparison of algorithms and software for mixed-integer derivative-free optimization

This page was built for publication: Solution polishing via path relinking for continuous black-box optimization

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