By Topic

An interval method for global inequality-constraint optimization problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kolev, L. ; Fac. of Autom., Sofia Tech. Univ., Bulgaria ; Penev, D.

An interval method is suggested for globally solving optimization problems of the following type: minimize a given objective function subject to both functional inequality constraints and simple bounds on the variables. The present method appeals to a new interval linearization of each nonlinear function and is based, essentially, on two computation techniques: linear programming and constraint propagation. The use of these techniques in the computational scheme of the present method seems to lead to improved performance as compared to other known interval methods of the same class

Published in:

Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on  (Volume:4 )

Date of Conference:

2000