dc.contributor.author | Frimannslund, Lennart | eng |
dc.contributor.author | Steihaug, Trond | eng |
dc.date.accessioned | 2012-05-02T08:01:23Z | |
dc.date.available | 2012-05-02T08:01:23Z | |
dc.date.issued | 2011 | eng |
dc.identifier.uri | https://hdl.handle.net/1956/5783 | |
dc.description.abstract | A 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. Numerical experiments demonstrate that this new derivative free optimization method has the very desirable property of avoiding saddle points. This is illustrated on two test functions and compared to other well known derivative free methods. Further, we compare the efficiency of the new method with two classical derivative methods using a class of testproblems. | en_US |
dc.language.iso | eng | eng |
dc.publisher | IARIA | en_US |
dc.relation.uri | http://www.iariajournals.org/software/tocv4n34.html | en |
dc.relation.uri | http://www.iariajournals.org/software/tocv4n34.html | eng |
dc.subject | Sparsity | eng |
dc.subject | Derivative-free optimization | eng |
dc.subject | Generating set search | eng |
dc.subject | Saddle points | eng |
dc.title | On a New Method for Derivative Free Optimization | en_US |
dc.type | Peer reviewed | |
dc.type | Journal article | |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | Copyright the authors. All rights reserved | en_US |
dc.identifier.cristin | 922280 | |
dc.source.journal | International Journal on Advances in Software | |
dc.subject.nsi | VDP::Technology: 500::Information and communication technology: 550 | en_US |