Exploiting problem structure in pattern search methods for unconstrained optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5232217
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- Optimization by pattern search
- A quasi-Newton based pattern search algorithm for unconstrained optimization
- Generalized pattern search methods for linearly equality constrained optimization problems
- Pattern Search Methods for Linearly Constrained Minimization
- Pattern-based modeling and solution of probabilistically constrained optimization problems
- Pattern Search Algorithms for Bound Constrained Minimization
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- Direct Search Methods on Parallel Machines
- Exploiting band structure in unconstrained optimization without derivatives
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Generalized descent for global optimization
- On the Convergence of Pattern Search Algorithms
- On the convergence of grid-based methods for unconstrained optimization
- Optimizing partially separable functions without derivatives
- Testing Unconstrained Optimization Software
- Theory of Positive Linear Dependence
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(18)- A generating set search method using curvature information
- Generalized pattern search methods for a class of nonsmooth optimization problems with structure
- A hybrid Hooke and Jeeves -- direct method for non-smooth optimization
- Exploiting Problem Structure in Derivative Free Optimization
- Pattern Search Methods for Linearly Constrained Minimization
- Coordinate search algorithms in multilevel optimization
- scientific article; zbMATH DE number 3898623 (Why is no real title available?)
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
- scientific article; zbMATH DE number 5232217 (Why is no real title available?)
- scientific article; zbMATH DE number 3843081 (Why is no real title available?)
- Recursive modified pattern search on high-dimensional simplex: a blackbox optimization technique
- A trust-region framework for derivative-free mixed-integer optimization
- Improving direct search algorithms by multilevel optimization techniques
- Finding local optima of high-dimensional functions using direct search methods
- Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems
- Using estimated gradients in bound-constrained global optimization
- Derivative-free optimization methods
- Pattern Search Algorithms for Bound Constrained Minimization
This page was built for publication: Exploiting problem structure in pattern search methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475286)
