- Title
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Creator
- Wu, Zhiyou; Tian, Jing; Ugon, Julien; Zhang, Liang
- Date
- 2015
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/92549
- Identifier
- vital:9631
- Identifier
-
https://doi.org/10.1016/j.amc.2015.04.040
- Identifier
- ISSN:0096-3003
- Abstract
- 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. (C) 2015 Elsevier Inc. All rights reserved.
- Publisher
- Elsevier Ltd
- Relation
- Applied Mathematics and Computation Vol. 262, no. (2015), p. 312-325
- Rights
- Copyright © 2015 Elsevier Inc. All rights reserved.
- Rights
- Open Access
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; Constrained polynomial programming; Problem; Necessary global optimality condition; Linear
- Full Text
- Reviewed
- Hits: 2492
- Visitors: 2731
- Downloads: 349
| Thumbnail | File | Description | Size | Format | |||
|---|---|---|---|---|---|---|---|
| View Details Download | SOURCE1 | Submitted version | 161 KB | Adobe Acrobat PDF | View Details Download |