A mesh adaptive basin hopping method for the design of circular antenna arrays
From MaRDI portal
Publication:1935264
DOI10.1007/s10957-012-0112-8zbMath1257.90117OpenAlexW2088891688WikidataQ63976718 ScholiaQ63976718MaRDI QIDQ1935264
Giovanni Stracquadanio, Elisa Pappalardo, Panos M. Pardalos
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0112-8
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- A global optimization method for the design of space trajectories
- Restart strategies in optimization: parallel and serial cases
- Solving molecular distance geometry problems by global optimization algorithms
- Globalization strategies for mesh adaptive direct search
- Lipschitzian optimization without the Lipschitz constant
- TTT plots: a perl program to create time-to-target plots
- Convergence results for generalized pattern search algorithms are tight
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Analysis of Generalized Pattern Searches
- An Implicit Filtering Algorithm for Optimization of Functions with Many Local Minima
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Taguchi's Quality Engineering Handbook
- Introduction to global optimization.
- Global optimization on funneling landscapes
- Fast global optimization of difficult Lennard-Jones clusters
