Deakin University
Browse

File(s) under permanent embargo

Global optimality conditions and optimization methods for constrained polynomial programming problems

journal contribution
posted on 2015-07-01, 00:00 authored by Z Wu, J Tian, Julien UgonJulien Ugon, L Zhang
The general constrained polynomial programming problem (GPP) is considered in this paper. Problem (GPP) has a broad range of applications and is proved to be NP-hard. Necessary global optimality conditions for problem (GPP) are established. Then, a new local optimization method for this problem is proposed by exploiting these necessary global optimality conditions. A global optimization method is proposed for this problem by combining this local optimization method together with an auxiliary function. Some numerical examples are also given to illustrate that these approaches are very efficient.

History

Journal

Applied mathematics and computation

Volume

262

Pagination

312 - 325

Publisher

Elsevier

Location

Amstermdam, The Netherlands

ISSN

0096-3003

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Copyright notice

2015, Elsevier Inc.