- Title
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Creator
- Zhou, Xiaojun; Gao, David; Yang, Chunhua
- Date
- 2014
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/161871
- Identifier
- vital:12595
- Identifier
-
https://doi.org/10.1016/j.amc.2013.11.013
- Identifier
- ISBN:0096-3003
- Abstract
- This paper focuses on implementation of a general canonical primal-dual algorithm for solving a class of fourth-order polynomial minimization problems. A critical issue in the canonical duality theory has been addressed, i.e., in the case that the canonical dual problem has no interior critical point in its feasible space Sa+, a quadratic perturbation method is introduced to recover the global solution through a primal-dual iterative approach, and a gradient-based method is further used to refine the solution. A series of test problems, including the benchmark polynomials and several instances of the sensor network localization problems, have been used to testify the effectiveness of the proposed algorithm. © 2013 Published by Elsevier Inc. All rights reserved.
- Publisher
- Elsevier Ltd
- Relation
- Applied Mathematics and Computation Vol. 227, no. (2014), p. 246-255
- Rights
- Copyright © 2013 Published by Elsevier Inc. All rights reserved.
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; 0802 Computation Theory and Mathematics; Canonical dual algorithm; Global optimization; Polynomial optimization
- Reviewed
- Hits: 1272
- Visitors: 1187
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|