A depth-first Lipschitz based global maximization algorithm

Simple item page
dc.contributor.authorMurray, Rua
dc.contributor.authorStephens, Chris
dc.date.accessioned2015-10-12T23:15:42Z
dc.date.available2015-10-12T23:15:42Z
dc.date.issued1993en
dc.description.abstractA depth-first analog to the Lipschitz based Piyavskii-Shubert global maximization algorithm is presented. To within any given tolerance, the algorithm is shown to return a global maximum and maximizer for a uni-variate Lipschitz continuous function. This result is extended to a broader class of uni-variate functions. Empirical comparisons of Piyavskii-Shubert with several variations of the new algorithm are made.en
dc.identifier.issn0110-537X
dc.identifier.urihttp://hdl.handle.net/10092/11143
dc.language.isoen
dc.publisherUniversity of Canterbury. Dept. of Mathematicsen
dc.relation.isreferencedbyNZCUen
dc.rightsCopyright Rua Murrayen
dc.rights.urihttps://canterbury.libguides.com/rights/thesesen
dc.subject.anzsrcField of Research::01 - Mathematical Sciencesen
dc.titleA depth-first Lipschitz based global maximization algorithmen
dc.typeDiscussion / Working Papers
thesis.degree.grantorUniversity of Canterburyen
thesis.degree.levelResearch Reporten
thesis.degree.nameResearch Reporten
uc.bibnumber402791en
uc.collegeFaculty of Engineeringen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
murray_stephens_report_no102_1993.pdf
Size:
550.39 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Reports