- Title
- A multidimensional descent method for global optimization
- Creator
- Bagirov, Adil; Rubinov, Alex; Zhang, Jiapu
- Date
- 2009
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/60722
- Identifier
- vital:2128
- Identifier
-
https://doi.org/10.1080/02331930902943483
- Identifier
- ISSN:0233-1934
- Abstract
- This article presents a new multidimensional descent method for solving global optimization problems with box-constraints. This is a hybrid method where local search method is used for a local descent and global search is used for further multidimensional search on the subsets of intersection of cones generated by the local search method and the feasible region. The discrete gradient method is used for local search and the cutting angle method is used for global search. Two-and three-dimensional cones are used for the global search. Such an approach allows one, as a rule, to escape local minimizers which are not global ones. The proposed method is local optimization method with strong global search properties. We present results of numerical experiments using both smooth and non-smooth global optimization test problems. These results demonstrate that the proposed algorithm allows one to find a global or a near global minimizer.
- Relation
- Optimization Vol. 58, no. 5 (2009), p. 611-625
- Rights
- Copyright Taylor & Francis
- Rights
- This metadata is freely available under a CCO license
- Subject
- Global optimization; Discrete gradient; Derivative-free optimization; Cutting angle method; Lipschitz programming
- Reviewed
- Hits: 2311
- Visitors: 2222
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|