A Potential Reduction Method for Canonical Duality, with an Application to the Sensor Network Localization Problem

We propose to solve large instances of the non-convex 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 (Lagrange) function. We establish the global convergence result for the algorithm under mild assumptions and demonstrate the method on instances of the Sensor Network Localization problem. Our numerical results are promising and show the possibility of devising efficient interior points methods for non-convex duality.

[1]  Panos M. Pardalos,et al.  Canonical Dual Solutions to Sum of Fourth-Order Polynomials Minimization Problems with Applications to Sensor Network Localization , 2012 .

[2]  Paul Tseng,et al.  Second-Order Cone Programming Relaxation of Sensor Network Localization , 2007, SIAM J. Optim..

[3]  Jos F. Sturm,et al.  A Matlab toolbox for optimization over symmetric cones , 1999 .

[4]  Renato D. C. Monteiro,et al.  On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems , 1998, Math. Oper. Res..

[5]  T. Greville.  Note on the Generalized Inverse of a Matrix Product , 1966 .

[6]  Y. Ye,et al.  A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization , 2006 .

[7]  D. Gao.  Duality Principles in Nonconvex Systems: Theory, Methods and Applications , 2000 .

[8]  Masakazu Kojima,et al.  Exploiting Sparsity in SDP Relaxation for Sensor Network Localization , 2009, SIAM J. Optim..

[9]  Shu-Cherng Fang,et al.  Canonical dual approach to solving the maximum cut problem , 2012, J. Glob. Optim..

[10]  David Yang Gao.  Canonical Dual Transformation Method and Generalized Triality Theory in Nonsmooth Global Optimization* , 2000 .

[11]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  Stephen P. Boyd,et al.  Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization , 2008, SIAM J. Optim..

[13]  Ning Ruan,et al.  Global optimal solutions to general sensor network localization problem , 2014, Perform. Evaluation.

[14]  Francisco Facchinei,et al.  Solving quasi-variational inequalities via their KKT conditions , 2014, Math. Program..

[15]  Francisco Facchinei,et al.  On the solution of the KKT conditions of generalized Nash equilibrium problems , 2011, SIAM J. Optim..

[16]  Renato D. C. Monteiro,et al.  A Potential Reduction Newton Method for Constrained Equations , 1999, SIAM J. Optim..

[17]  Kim-Chuan Toh,et al.  Semidefinite Programming Approaches for Sensor Network Localization With Noisy Distance Measurements , 2006, IEEE Transactions on Automation Science and Engineering.

[18]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[19]  Changzhi Wu,et al.  Canonical Primal-Dual Method for Solving Non-convex Minimization Problems , 2012, ArXiv.

[20]  Jiawang Nie,et al.  Sum of squares method for sensor network localization , 2006, Comput. Optim. Appl..

[21]  Vittorio Latorre,et al.  Canonical dual solutions to nonconvex radial basis neural network optimization problem , 2013, Neurocomputing.

[22]  Vittorio Latorre,et al.  Canonical duality for solving general nonconvex constrained problems , 2013, Optim. Lett..

[23]  Vittorio Latorre,et al.  A canonical duality approach for the solution of affine quasi-variational inequalities , 2016, J. Glob. Optim..

[24]  Christian Kanzow,et al.  On a Smooth Dual Gap Function for a Class of Quasi-Variational Inequalities , 2014, J. Optim. Theory Appl..