Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
From MaRDI portal
Publication:2061776
Abstract: In this paper, a novel derivative-free pattern search based algorithm for Black-box optimization is proposed over a simplex constrained parameter space. At each iteration, starting from the current solution, new possible set of solutions are found by adding a set of derived step-size vectors to the initial starting point. While deriving these step-size vectors, precautions and adjustments are considered so that the set of new possible solution points still remain within the simplex constrained space. Thus, no extra time is spent in evaluating the (possibly expensive) objective function at infeasible points (points outside the unit-simplex space). While minimizing any objective function of m parameters, within each iteration, the objective function is evaluated at 2m new possible solution points. So, upto 2m parallel threads can be incorporated which makes the computation even faster while optimizing expensive objective functions over high-dimensional parameter space. Once a local minimum is discovered, in order to find a better solution, a novel `re-start' strategy is considered to increase the likelihood of finding a better solution. Unlike existing pattern search based methods, a sparsity control parameter is introduced which can be used to induce sparsity in the solution in case the solution is expected to be sparse in prior. A comparative study of the performances of the proposed algorithm and other existing algorithms are shown for a few low, moderate and high-dimensional optimization problems. Upto 338 folds improvement in computation time is achieved using the proposed algorithm over Genetic algorithm along with better solution. The proposed algorithm is used to estimate the simultaneous quantiles of North Atlantic Hurricane velocities during 1981-2006 by maximizing a non-closed form likelihood function with (possibly) multiple maximums.
Recommendations
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- A restarted and modified simplex search for unconstrained optimization
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
- Black box scatter search for general classes of binary optimization problems
- A black-box scatter search for optimization problems with integer variables
- Black-box optimization in an extended search space for SAT solving
- scientific article; zbMATH DE number 5232217
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Optimization by pattern search
Cites work
- `` Direct Search Solution of Numerical and Statistical Problems
- A new polynomial-time algorithm for linear programming
- A practical guide to splines.
- A survey on direct search methods for blackbox optimization and their applications
- Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm
- Bayesian non-parametric simultaneous quantile regression for complete and grid data
- Bayesian quantile regression using random B-spline series prior
- Constrained derivative-free optimization on thin domains
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Efficient global optimization of expensive black-box functions
- GLODS: global and local optimization using direct search
- scientific article; zbMATH DE number 2002582 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 780774 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Interior-point methods
- Introduction to Derivative-Free Optimization
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search
- On the Convergence of Pattern Search Algorithms
- Optimization by simulated annealing
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Pattern Search Algorithms for Bound Constrained Minimization
- Pattern Search Methods for Linearly Constrained Minimization
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
Cited in
(4)- Parallel Triangulated Partitioning for Black Box Optimization
- Black-box optimization on hyper-rectangle using recursive modified pattern search and application to ROC-based classification problem
- Clustering Sequence Data with Mixture Markov Chains with Covariates Using Multiple Simplex Constrained Optimization Routine (MSiCOR)
- SMART-MC: Characterizing the Dynamics of Multiple Sclerosis Therapy Transitions Using a Covariate-Based Markov Model
This page was built for publication: Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2061776)
