A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems

A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP). Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a paramet...

Full description

Bibliographic Details
Main Authors: Xue-Gang Zhou, Bing-Yuan Cao
Format: Article
Language:English
Published: Hindawi Limited 2014-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2014/697321