Global optimization under nonlinear constraints based on apollonius fill

Song, J; He, X; Lin, Z

Global optimization under nonlinear constraints based on apollonius fill

Song, J He, X

Lin, Z

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - Third International Conference on Natural Computation, ICNC 2007, 2007, 5 pp. 39 - 43
Issue Date:: 2007-12-01

Closed Access

	Filename	Description	Size
	2007000558.pdf		244.33 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	Lin, Z	en_US
dc.date.issued	2007-12-01	en_US
dc.identifier.citation	Proceedings - Third International Conference on Natural Computation, ICNC 2007, 2007, 5 pp. 39 - 43	en_US
dc.identifier.isbn	0769528759	en_US
dc.identifier.isbn	9780769528755	en_US
dc.identifier.uri	http://hdl.handle.net/10453/2761
dc.description.abstract	Making use of Apollonius Fill, an algorithm is presented, which is for finding solutions of global optimization problems nonlinearly constrained by a circular region in the plane. Using this algorithm, global optimum can be computed fast and precisely. We request no more than first order derivatives of objective functions for the optimization algorithm. If we do not care about the processing time taken, for any given objective function, the global optimum can be obtained as precisely as requested. The proof of convergence of this algorithm is also given in this paper. We use a few numerical examples to show that this algorithm is effective, reliable, and hence is valuable in practice. © 2007 IEEE.	en_US
dc.relation.ispartof	Proceedings - Third International Conference on Natural Computation, ICNC 2007	en_US
dc.relation.isbasedon	10.1109/ICNC.2007.405	en_US
dc.title	Global optimization under nonlinear constraints based on apollonius fill	en_US
dc.type	Conference Proceeding
utslib.citation.volume	5	en_US
utslib.for	080106 Image Processing	en_US
dc.location.activity	Hainan, China	en_US
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:

Making use of Apollonius Fill, an algorithm is presented, which is for finding solutions of global optimization problems nonlinearly constrained by a circular region in the plane. Using this algorithm, global optimum can be computed fast and precisely. We request no more than first order derivatives of objective functions for the optimization algorithm. If we do not care about the processing time taken, for any given objective function, the global optimum can be obtained as precisely as requested. The proof of convergence of this algorithm is also given in this paper. We use a few numerical examples to show that this algorithm is effective, reliable, and hence is valuable in practice. © 2007 IEEE.

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

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