We propose an
interior point method to solve instances of the nonconvex optimization problems reformulated with canonical duality
theory. To this aim we propose an interior point
potential reduction algorithm based on the solution of the primal–dual total complementarity function. We establish the global
convergence result for the algorithm under mild assumptions. Our methodology is quite general and can be applied to several problems which dual has been formulated with canonical duality theory and shows the possibility of devising efficient interior points methods for nonconvex duality.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. Volume. I and II. Springer, New York (2003)
Gao, D.Y.: Duality principles in nonconvex systems: Theory, methods and applications. Kluwer Academic Publishers, Dordrecht (2000)
Gao, D.Y.: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization. J. Glob. Optim.
17(1/4), 127–160 (2000)
Gao, D.Y.: Canonical duality theory: theory, method, and applications in global optimization. Comput. Chem.
33, 1964–1972 (2009)
Gao, D.Y., Ruan, N., Pardalos, P.M.: Canonical dual solutions to sum of fourth-order polynomials minimization problems with applications to sensor network localization. In: Pardalos, P.M., Ye, Y.Y., Boginski, V., Commander, C. (eds.) Sensors: Theory, Algorithms and Applications, vol. 61, pp. 37–54. Springer (2012)
Greville, T.N.E.: Note on the generalized inverse of a matrix product. SIAM Review
8(4), 518–521 (1966)
Latorre, V., Gao, D.Y.: Canonical duality for solving general nonconvex constrained problems. Optim. Lett.
10(8), 1763–1779 (2016). doi: