Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
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 View the MathML source, a quadratic perturbation method is introduced to recover the global solution through a primal–dual iterative approach, and a gradient-based method is...[Show more]
|Collections||ANU Research Publications|
|Source:||Applied Mathematics and Computation|
|01_Zhou_Canonical_primal-dual_2014.pdf||569.36 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.