Generalized Pattern Searches with Derivative Information

dc.contributor.authorAbramson, Mark A.en_US
dc.contributor.authorAudet, Charlesen_US
dc.contributor.authorDennis, J.E. Jr.en_US
dc.date.accessioned2018-06-18T17:49:15Zen_US
dc.date.available2018-06-18T17:49:15Zen_US
dc.date.issued2002-06en_US
dc.date.noteJune 2002 (Revised October 2003)en_US
dc.description.abstractA common question asked by users of direct search algorithms is how to use derivative information at iterates where it is available. This paper addresses that question with respect to Generalized Pattern Search (GPS) meth-ods for unconstrained and linearly constrained optimization. Specifically this paper concentrates on the GPS POLL step. Polling is done to certify the need to refine the current mesh, and it requires O(n) function evaluations in the worst case. We show that the use of derivative information significantly reduces the maximum number of function evaluations necessary for POLL steps, even to a worst case of a single function evaluation with certain algorithmic choices given here. Furthermore, we show that rather rough approximations to the gradient are sufficient to reduce the POLL step to a single function evaluation. We prove that using these less expensive POLL steps does not weaken the known convergence properties of the method, all of which depend only on the POLL step.en_US
dc.format.extent19 ppen_US
dc.identifier.citationAbramson, Mark A., Audet, Charles and Dennis, J.E. Jr.. "Generalized Pattern Searches with Derivative Information." (2002) <a href="https://hdl.handle.net/1911/101990">https://hdl.handle.net/1911/101990</a>.en_US
dc.identifier.digitalTR02-10en_US
dc.identifier.urihttps://hdl.handle.net/1911/101990en_US
dc.language.isoengen_US
dc.titleGeneralized Pattern Searches with Derivative Informationen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR02-10.pdf
Size:
195.62 KB
Format:
Adobe Portable Document Format