A second-order globally convergent direct-search method and its worst-case complexity
Direct-search algorithms form one of the main classes of algorithms for smooth unconstrained derivative-free optimization, due to their simplicity and their well-established convergence results. They proceed by iteratively looking for improvement along some vectors or directions. In the presence of...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/10316/45243 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/45243 |