A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
From MaRDI portal
Recommendations
- A derivative-free algorithm for unconstrained optimization
- Exploiting problem structure in pattern search methods for unconstrained optimization
- scientific article; zbMATH DE number 1552032
- scientific article; zbMATH DE number 992793
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
Cites work
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- A conjugate direction implementation of the BFGS algorithm with automatic scaling
- A quasi-Newton based pattern search algorithm for unconstrained optimization
- Direct Search Methods on Parallel Machines
- Frame based methods for unconstrained optimization
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- Generalized conjugate directions
- scientific article; zbMATH DE number 992793 (Why is no real title available?)
- scientific article; zbMATH DE number 3878696 (Why is no real title available?)
- scientific article; zbMATH DE number 16954 (Why is no real title available?)
- scientific article; zbMATH DE number 3507891 (Why is no real title available?)
- scientific article; zbMATH DE number 721770 (Why is no real title available?)
- scientific article; zbMATH DE number 5232217 (Why is no real title available?)
- Memory gradient method for the minimization of functions
- More test examples for nonlinear programming codes
- Objective-derivative-free methods for constrained optimization
- On the convergence of grid-based methods for unconstrained optimization
- On the Convergence of Pattern Search Algorithms
- On Variable-Metric Methods for Sparse Hessians
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Study on a supermemory gradient method for the minimization of functions
- Supermemory descent methods for unconstrained minimization
- Testing Unconstrained Optimization Software
- Theory of Positive Linear Dependence
Cited in
(5)- Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
- scientific article; zbMATH DE number 5232217 (Why is no real title available?)
- Exploiting problem structure in pattern search methods for unconstrained optimization
- Hybrid pattern search and simulated annealing for fuzzy production planning problems
- Hypersonic flight vehicle trajectory optimization using pattern search algorithm
This page was built for publication: A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979825)