scientific article; zbMATH DE number 2068067
From MaRDI portal
Publication:4464675
AMIGO is an algorithm for solving smooth global optimization problems over \(n\)-dimensional boxes. It is mainly an extension of an algorithm developed by \textit{L. G. Casado}, \textit{J. A. Martínez}, \textit{I. García} and \textit{Ya. D. Sergeyev} [J. Glob. Optim. 25, No. 4, 345--362 (2003; Zbl 1046.90060)]. AMIGO differs from standard interval methods for solving this class of problems by a refined use of first-order information. 40 numerical tests and comparisons show the effectiveness of this refinement. For the entire collection see [Zbl 1031.90001].
Recommendations
Cited in
(6)- AMIGO
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4464675)