Trade-off studies in blackbox optimization

DOI10.1080/10556788.2011.571687zbMath1260.90005OpenAlexW1963748087WikidataQ58201066 ScholiaQ58201066MaRDI QIDQ5200553

Charles Audet, Sébastien Le Digabel, John E. jun. Dennis

Publication date: 6 November 2012

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2011.571687

zbMATH Keywords

sensitivity analysisconstrained optimizationbi-objective optimizationblackbox optimizationmesh-adaptive direct search algorithms (Mads)trade-off studies

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Escaping Unknown Discontinuous Regions in Blackbox Optimization, Derivative-free optimization of a rapid-cycling synchrotron, Optimization of algorithms with OPAL

Uses Software

• NOMAD

Cites Work

• Spent potliner treatment process optimization using a MADS algorithm
• Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
• Globalization strategies for mesh adaptive direct search
• A mesh adaptive direct search algorithm for multiobjective optimization
• Algorithm 909
• Direct Multisearch for Multiobjective Optimization
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• Multiobjective Optimization Through a Series of Single-Objective Formulations
• Introduction to Derivative-Free Optimization
• Superlinear Convergence and Implicit Filtering
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
• A Progressive Barrier for Derivative-Free Nonlinear Programming
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Nonlinear programming without a penalty function.