File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A hybrid descent method for global optimization

TitleA hybrid descent method for global optimization
Authors
KeywordsDescent method
Global minimum
Simulating annealing
Issue Date2004
PublisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0925-5001
Citation
Journal Of Global Optimization, 2004, v. 28 n. 2, p. 229-238 How to Cite?
AbstractIn this paper, a hybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, is proposed. The simulated annealing algorithm is used to locate descent points for previously converged local minima. The combined method has the descent property and the convergence is monotonic. To demonstrate the effectiveness of the proposed hybrid descent method, several multi-dimensional non-convex optimization problems are solved. Numerical examples show that global minimum can be sought via this hybrid descent method.
Persistent Identifierhttp://hdl.handle.net/10722/74234
ISSN
2015 Impact Factor: 1.219
2015 SCImago Journal Rankings: 0.992
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorYiu, KFCen_HK
dc.contributor.authorLiu, Yen_HK
dc.contributor.authorTeo, KLen_HK
dc.date.accessioned2010-09-06T06:59:17Z-
dc.date.available2010-09-06T06:59:17Z-
dc.date.issued2004en_HK
dc.identifier.citationJournal Of Global Optimization, 2004, v. 28 n. 2, p. 229-238en_HK
dc.identifier.issn0925-5001en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74234-
dc.description.abstractIn this paper, a hybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, is proposed. The simulated annealing algorithm is used to locate descent points for previously converged local minima. The combined method has the descent property and the convergence is monotonic. To demonstrate the effectiveness of the proposed hybrid descent method, several multi-dimensional non-convex optimization problems are solved. Numerical examples show that global minimum can be sought via this hybrid descent method.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0925-5001en_HK
dc.relation.ispartofJournal of Global Optimizationen_HK
dc.subjectDescent methoden_HK
dc.subjectGlobal minimumen_HK
dc.subjectSimulating annealingen_HK
dc.titleA hybrid descent method for global optimizationen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0925-5001&volume=28&issue=2&spage=229&epage=238&date=2004&atitle=A+hybrid+descent+method+for+global+optimizationen_HK
dc.identifier.emailYiu, KFC:cedric@hkucc.hku.hken_HK
dc.identifier.authorityYiu, KFC=rp00206en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1023/B:JOGO.0000015313.93974.b0en_HK
dc.identifier.scopuseid_2-s2.0-1542285816en_HK
dc.identifier.hkuros99325en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-1542285816&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume28en_HK
dc.identifier.issue2en_HK
dc.identifier.spage229en_HK
dc.identifier.epage238en_HK
dc.identifier.isiWOS:000188853400007-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridYiu, KFC=24802813000en_HK
dc.identifier.scopusauthoridLiu, Y=24076453100en_HK
dc.identifier.scopusauthoridTeo, KL=35569785000en_HK
dc.identifier.citeulike5298798-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats