Back to Search
Start Over
Canonical primal–dual algorithm for solving fourth-order polynomial minimization problems.
- Source :
-
Applied Mathematics & Computation . Jan2014, Vol. 227, p246-255. 10p. - Publication Year :
- 2014
-
Abstract
- 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 , 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 227
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 93417962
- Full Text :
- https://doi.org/10.1016/j.amc.2013.11.013