On the optimal order of worst case complexity of direct search
The worst case complexity of direct-search methods has been recently analyzed when they use positive spanning sets and impose a sufficient decrease condition to accept new iterates. For smooth unconstrained optimization, it is now known that such methods require at most \mathcal {O}(n^2\epsilon ^{-2...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10316/45237 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45237 |