Show simple item record

dc.contributor.authorAbramson, Mark A.
dc.date.accessioned 2018-06-18T17:52:01Z
dc.date.available 2018-06-18T17:52:01Z
dc.date.issued 2004-01
dc.identifier.citation Abramson, Mark A.. "Second Order Behavior of Pattern Search Algorithms." (2004) https://hdl.handle.net/1911/102016.
dc.identifier.urihttps://hdl.handle.net/1911/102016
dc.description.abstract Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search methods require no derivative information, we are able to prove some limited directional second-order results. Although not as strong as classical second-order necessary conditions, these results are stronger than the first order conditions that many gradient-based methods satisfy. Under fairly mild conditions, we can eliminate from consideration all strict local maximizers and an entire class of saddle points.
dc.format.extent 16 pp
dc.title Second Order Behavior of Pattern Search Algorithms
dc.type Technical report
dc.date.note January 2004
dc.identifier.digital TR04-03
dc.type.dcmi Text


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record