A derivative-free two level random search method for unconstrained optimization

DOI10.1007/978-3-030-68517-1MaRDI QIDQ5855537zbMATH OpenOpenAlexFDO

Authors Neculai Andrei

Publication date 18 March 2021

Published in SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-68517-1

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Recommendations

• Derivative-free optimization methods
• Introduction to Derivative-Free Optimization
• A derivative-free algorithm for unconstrained optimization
• scientific article; zbMATH DE number 1552032
• Derivative-free and blackbox optimization

Cited in

(2)

• Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems
• Derivative-free and blackbox optimization

This page was built for publication: A derivative-free two level random search method for unconstrained optimization

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