A generating set search method using curvature information
Computational Optimization and Applications
A particle swarm pattern search method for bound constrained global optimization
Journal of Global Optimization
Deterministic parallel global parameter estimation for a model of the budding yeast cell cycle
Journal of Global Optimization
Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search
Journal of Global Optimization
Unconstrained derivative-free optimization by successive approximation
Journal of Computational and Applied Mathematics
Low Order-Value Optimization and applications
Journal of Global Optimization
A Model-Based Learning Process for Modeling Coarticulation of Human Speech
IEICE - Transactions on Information and Systems
A restarted and modified simplex search for unconstrained optimization
Computers and Operations Research
Utility Driven Adaptive Work?ow Execution
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Journal of Computational Physics
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Modern continuous optimization algorithms for tuning real and integer algorithm parameters
ANTS'10 Proceedings of the 7th international conference on Swarm intelligence
Algorithm 909: NOMAD: Nonlinear Optimization with the MADS Algorithm
ACM Transactions on Mathematical Software (TOMS)
Combined heat and power economic dispatch by mesh adaptive direct search algorithm
Expert Systems with Applications: An International Journal
MADS/F-race: mesh adaptive direct search meets F-race
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part I
A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
SIAM Journal on Optimization
Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
SIAM Journal on Optimization
Control of dead-time systems using derivative free particle swarm optimisation
International Journal of Bio-Inspired Computation
Face recognition via direct search optimized Gabor filters
ICOSSE'06 Proceedings of the 5th WSEAS international conference on System science and simulation in engineering
Pattern Recognition Letters
Winter Simulation Conference
Structural and Multidisciplinary Optimization
Direct search algorithm for bilevel programming problems
Computational Optimization and Applications
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Derivative-free nonlinear optimization filter simplex
International Journal of Applied Mathematics and Computer Science
Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Structural and Multidisciplinary Optimization
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Derivative-free methods for bound constrained mixed-integer optimization
Computational Optimization and Applications
Engineering Applications of Artificial Intelligence
Low-budget transient imaging using photonic mixer devices
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
An analysis of post-selection in automatic configuration
Proceedings of the 15th annual conference on Genetic and evolutionary computation
A survey of non-gradient optimization methods in structural engineering
Advances in Engineering Software
Semiconductor device design using the BiMADS algorithm
Journal of Computational Physics
Journal of Global Optimization
QoS-aware optimization of sensor network queries
The VLDB Journal — The International Journal on Very Large Data Bases
Zigzag Search for Continuous Multiobjective Optimization
INFORMS Journal on Computing
CARTopt: a random search method for nonsmooth unconstrained optimization
Computational Optimization and Applications
Hi-index | 0.01 |
This paper addresses the problem of minimization of a nonsmooth function under general nonsmooth constraints when no derivatives of the objective or constraint functions are available. We introduce the mesh adaptive direct search (MADS) class of algorithms which extends the generalized pattern search (GPS) class by allowing local exploration, called polling, in an asymptotically dense set of directions in the space of optimization variables. This means that under certain hypotheses, including a weak constraint qualification due to Rockafellar, MADS can treat constraints by the extreme barrier approach of setting the objective to infinity for infeasible points and treating the problem as unconstrained.The main GPS convergence result is to identify limit points $\hat{x}$, where the Clarke generalized derivatives are nonnegative in a finite set of directions, called refining directions. Although in the unconstrained case, nonnegative combinations of these directions span the whole space, the fact that there can only be finitely many GPS refining directions limits rigorous justification of the barrier approach to finitely many linear constraints for GPS. The main result of this paper is that the general MADS framework is flexible enough to allow the generation of an asymptotically dense set of refining directions along which the Clarke derivatives are nonnegative. We propose an instance of MADS for which the refining directions are dense in the hypertangent cone at $\hat{x}$ with probability 1 whenever the iterates associated with the refining directions converge to a single $\hat{x}$. The instance of MADS is compared to versions of GPS on some test problems. We also illustrate the limitation of our results with examples.