Globalization strategies for mesh adaptive direct search
From MaRDI portal
Publication:975357
DOI10.1007/s10589-009-9266-1zbMath1190.90204OpenAlexW2077594413WikidataQ58201076 ScholiaQ58201076MaRDI QIDQ975357
Charles Audet, Sébastien Le Digabel, John E. jun. Dennis
Publication date: 9 June 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9266-1
constrained optimizationnonlinear programmingblack-box optimizationMesh Adaptive Direct Search algorithms (Mads)optimization test problems
Related Items
Use of a biobjective direct search algorithm in the process design of material science applications, Using a derivative-free optimization method for multiple solutions of inverse transport problems, Dynamic scaling in the mesh adaptive direct search algorithm for blackbox optimization, A progressive barrier derivative-free trust-region algorithm for constrained optimization, A discussion on variational analysis in derivative-free optimization, Derivative-free methods for mixed-integer nonsmooth constrained optimization, Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO, Constrained derivative-free optimization on thin domains, Binary, unrelaxable and hidden constraints in blackbox optimization, Escaping local minima with local derivative-free methods: a numerical investigation, Escaping Unknown Discontinuous Regions in Blackbox Optimization, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, A mesh adaptive basin hopping method for the design of circular antenna arrays, Efficient use of parallelism in algorithmic parameter optimization applications, Nonasymptotic densities for shape reconstruction, A variance-based method to rank input variables of the mesh adaptive direct search algorithm, A study of singular spectrum analysis with global optimization techniques, Optimization of algorithms with OPAL, Derivative-free optimization via proximal point methods, A surrogate management framework using rigorous trust-region steps, A mesh adaptive direct search algorithm for multiobjective optimization, A derivative-free algorithm for refining numerical microaggregation solutions, Trade-off studies in blackbox optimization, Derivative-free nonlinear optimization filter simplex
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- On the Convergence of Pattern Search Algorithms
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Superlinear Convergence and Implicit Filtering
- On the Global Convergence of a Filter--SQP Algorithm
- A Progressive Barrier for Derivative-Free Nonlinear Programming
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonlinear programming without a penalty function.
