- Title
- Global optimality conditions and optimization methods for polynomial programming problems
- Creator
- Wu, Zhiyou; Tian, Jing; Ugon, Julien
- Date
- 2015
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/96708
- Identifier
- vital:10152
- Identifier
-
https://doi.org/10.1007/s10898-015-0292-5
- Identifier
- ISSN:0925-5001
- Abstract
- This paper is concerned with the general polynomial programming problem with box constraints, including global optimality conditions and optimization methods. First, a necessary global optimality condition for a general polynomial programming problem with box constraints is given. Then we design a local optimization method by using the necessary global optimality condition to obtain some strongly or -strongly local minimizers which substantially improve some KKT points. Finally, a global optimization method, by combining the new local optimization method and an auxiliary function, is designed. Numerical examples show that our methods are efficient and stable.
- Publisher
- Springer
- Relation
- Journal of Global Optimization Vol. 62, no. 4 (2015), p. 617-641
- Rights
- Copyright © Springer Science+Business Media New York 2015
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; 0802 Computation Theory and Mathematics; Polynomial programming problem; Necessary global optimality condition; Linear transformation; Local optimization method; Global optimization method
- Reviewed
- Hits: 2330
- Visitors: 2332
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|