View in EDS

A global optimization method based on multi-unit extremum-seeking for scalar nonlinear systems

Saved in:
Bibliographic Details
Title: A global optimization method based on multi-unit extremum-seeking for scalar nonlinear systems
Authors: Esmaeilzadeh Azar, F. farhad.esmaeilzadeh-azar@polymtl.ca, Perrier, M. michel.perrier@polymtl.ca, Srinivasan, B. bala.srinivasan@polymtl.ca
Source: Computers & Chemical Engineering. Mar2011, Vol. 35 Issue 3, p456-463. 8p.
Subjects: Nonlinear systems, Nonlinear functional analysis, Combinatorial optimization, Finite differences, Continuous functions, Real-time computing, Automatic control systems
Abstract: Abstract: Finding the global optimum of a nonlinear function is a challenging task that could involve a large number of functional evaluations. In this paper, an algorithm that uses tools from the domain of extremum-seeking is shown to provide an efficient deterministic method for global optimization. Extremum-seeking schemes typically find the local optimum by controlling the gradient to zero. In this paper, the multi-unit framework is used, where the gradient is estimated by finite difference for a given offset between the inputs. The gradient is pushed to zero by an integral controller. It is shown that if the offset is reduced to zero, the system can be made to converge to the global optimum of nonlinear continuous static, scalar maps. The result is extended to constrained problems where a switching control strategy is employed. Several illustrative examples are presented and the proposed method is compared with other methods of global optimization. [Copyright &y& Elsevier]
Copyright of Computers & Chemical Engineering is the property of Pergamon Press - An Imprint of Elsevier Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:Abstract: Finding the global optimum of a nonlinear function is a challenging task that could involve a large number of functional evaluations. In this paper, an algorithm that uses tools from the domain of extremum-seeking is shown to provide an efficient deterministic method for global optimization. Extremum-seeking schemes typically find the local optimum by controlling the gradient to zero. In this paper, the multi-unit framework is used, where the gradient is estimated by finite difference for a given offset between the inputs. The gradient is pushed to zero by an integral controller. It is shown that if the offset is reduced to zero, the system can be made to converge to the global optimum of nonlinear continuous static, scalar maps. The result is extended to constrained problems where a switching control strategy is employed. Several illustrative examples are presented and the proposed method is compared with other methods of global optimization. [Copyright &y& Elsevier]
ISSN:00981354
DOI:10.1016/j.compchemeng.2010.04.003