Show simple item record

dc.contributor.authorFrimannslund, Lennarteng
dc.contributor.authorSteihaug, Trondeng
dc.date.accessioned2013-08-12T07:05:32Z
dc.date.available2013-08-12T07:05:32Z
dc.date.issued2010eng
dc.identifier.isbn978-1-61208-101-4en_US
dc.identifier.urihttps://hdl.handle.net/1956/6941
dc.description.abstractA new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an average Hessian-like matrix and uses its eigenvectors as new search directions. For partially separable functions, many of the entries of this matrix will be identically zero. The method is able to exploit this property and as a consequence update its search directions more often than if sparsity is not taken into account. Numerical results show that this is a more effective method for functions with a topography which requires frequent updating of search directions for rapid convergence. The method is an important extension of a method for nonseparable functions previously published by the authors. This new method allows for problems of larger dimension to be solved, and will in most cases be more efficient.en_US
dc.language.isoengeng
dc.publisherIARIAen_US
dc.relation.ispartofseriesADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Scienceseng
dc.titleA New Generating Set Search Algorithm for Partially Separable Functionsen_US
dc.typeConference object
dc.typePeer reviewed
dc.date.updated2013-08-02T12:25:54Z
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright IARIA, 2010en_US
dc.identifier.cristin545162


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record