RETRACTED ARTICLE: Study on generalized fractal algorithm of global optimization

Song, J; He, X; Qian, F

RETRACTED ARTICLE: Study on generalized fractal algorithm of global optimization

Song, J He, X

Qian, F

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010, 2010, 5 pp. 286 - 290
Issue Date:: 2010-01-01

Closed Access

	Filename	Description	Size
	2009008199OK.pdf		284.63 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Song, J	en_US
dc.contributor.author	He, X https://orcid.org/0000-0001-8962-540X	en_US
dc.contributor.author	Qian, F	en_US
dc.date.issued	2010-01-01	en_US
dc.identifier.citation	Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010, 2010, 5 pp. 286 - 290	en_US
dc.identifier.isbn	9781424458462	en_US
dc.identifier.uri	http://hdl.handle.net/10453/16256
dc.description.abstract	To promote a fractal algorithm from being suitable for global optimization only on three dimensional spaces to an n dimensional space, this paper presents a simple and convenient method for dividing an n-dimensional hypercube. A key problem is then solved to develop the fractal algorithm in a high dimensional space so that the fractal algorithm becomes a generalized global optimization algorithm. The theoretical foundation of the algorithm is set up. Simulations show the generalized fractal algorithm is effective. © 2010 IEEE.	en_US
dc.relation.ispartof	Proceedings - 2nd IEEE International Conference on Advanced Computer Control, ICACC 2010	en_US
dc.relation.isbasedon	10.1109/ICACC.2010.5487247	en_US
dc.title	RETRACTED ARTICLE: Study on generalized fractal algorithm of global optimization	en_US
dc.type	Conference Proceeding
utslib.citation.volume	5	en_US
utslib.for	080201 Analysis of Algorithms and Complexity	en_US
dc.location.activity	Shenyang, China	en_US
dc.location.activity	ISI:000279134100028
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US
pubs.volume	5	en_US

Abstract:

To promote a fractal algorithm from being suitable for global optimization only on three dimensional spaces to an n dimensional space, this paper presents a simple and convenient method for dividing an n-dimensional hypercube. A key problem is then solved to develop the fractal algorithm in a high dimensional space so that the fractal algorithm becomes a generalized global optimization algorithm. The theoretical foundation of the algorithm is set up. Simulations show the generalized fractal algorithm is effective. © 2010 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/16256