论文信息 - Zero duality gap for a class of nonconvex optimization problems

Zero duality gap for a class of nonconvex optimization problems

By an equivalent transformation using thepth power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.

Duan Li

[1] M. Hestenes. Multiplier and gradient methods , 1969 .

[2] Leon S. Lasdon,et al. Optimization Theory of Large Systems , 1970 .

[3] R. Rockafellar. The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[4] Dimitri P. Bertsekas,et al. Multiplier methods: A survey , 1975, at - Automatisierungstechnik.

[5] D. Bertsekas. Convexification procedures and decomposition methods for nonconvex optimization problems , 1979 .

[6] H. Mukai,et al. A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Prob , 1985 .

[7] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .