Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming

DOI10.1007/978-3-540-74446-7_21MaRDI QIDQ5429304zbMATH OpenOpenAlexFDO

Authors João Pedro Pedroso

Publication date 29 November 2007

Published in Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74446-7_21

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An adaptive search algorithm for numerical optimization
• A restarted and modified simplex search for unconstrained optimization
• Efficient Implementation of the Nelder-Mead Search Algorithm
• scientific article; zbMATH DE number 2159091
• An extension of the simplex method to constrained nonlinear optimization

This page was built for publication: Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming

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