Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lasdon, L. S.,Optimization Theory for Large Systems, Macmillan Company, London, England, 1970.
Luenberger, D. G.,Linear and Nonlinear Programming, 2nd Edition, Addison-Wesley, Reading, Massachusetts, 1984.
Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, pp. 303–320, 1969.
Bertsekas, D. P.,Multiplier Methods: A Survey, Automatica, Vol. 12, pp. 133–145, 1976.
Rockafellar, R. T.,The Multiplier Method of Hestenes and Powell Applied to Convex Programming, Journal of Optimization Theory and Applications, Vol. 12, pp. 555–562, 1973.
Bertsekas, D. P.,Convexification Procedures and Decomposition Methods for Nonconvex Optimization Problems, Journal of Optimization Theory and Applications, Vol. 29, pp. 169–197, 1979.
Tanikawa, A., andMukai, H.,A New Technique for Nonconvex Primal-Dual Decomposition of a Large-Scale Separable Optimization Problem, IEEE Transactions on Automatic Control, Vol. 30, pp. 133–143, 1985.
Author information
Authors and Affiliations
Additional information
Communicated by D. G. Luenberger
The author very much appreciates the comments from Prof. Douglas J. White.
Rights and permissions
About this article
Cite this article
Li, D. Zero duality gap for a class of nonconvex optimization problems. J Optim Theory Appl 85, 309–324 (1995). https://doi.org/10.1007/BF02192229
Issue Date:
DOI: https://doi.org/10.1007/BF02192229