A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
From MaRDI portal
Publication:979825
DOI10.1016/j.camwa.2009.07.067zbMath1189.90162OpenAlexW2075219754MaRDI QIDQ979825
Linping Sun, Hu Shao, Ting Wu, Yingsha Yang
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.07.067
Related Items (3)
Hybrid pattern search and simulated annealing for fuzzy production planning problems ⋮ Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems ⋮ Hypersonic flight vehicle trajectory optimization using pattern search algorithm
Uses Software
Cites Work
- A quasi-Newton based pattern search algorithm for unconstrained optimization
- Generalized conjugate directions
- More test examples for nonlinear programming codes
- Supermemory descent methods for unconstrained minimization
- Objective-derivative-free methods for constrained optimization
- Solving unconstrained optimization problem with a filter-based nonmonotone pattern search algorithm
- Memory gradient method for the minimization of functions
- Study on a supermemory gradient method for the minimization of functions
- On the Convergence of Grid-Based Methods for Unconstrained Optimization
- On the Convergence of Pattern Search Algorithms
- On Variable-Metric Methods for Sparse Hessians
- Testing Unconstrained Optimization Software
- Direct Search Methods on Parallel Machines
- Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
- A conjugate direction implementation of the BFGS algorithm with automatic scaling
- A Comparison of Several Current Optimization Methods, and the use of Transformations in Constrained Problems
- Theory of Positive Linear Dependence
- Frame based methods for unconstrained optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
