Abstract
We consider the problem
where x i are multidimensional subvectors of x, f i are convex functions, and S is a subspace. Monotropic programming, extensively studied by Rockafellar, is the special case where the subvectors x i are the scalar components of x. We show a strong duality result that parallels Rockafellar’s result for monotropic programming, and contains other known and new results as special cases. The proof is based on the use of ε-subdifferentials and the ε-descent method, which is used here as an analytical vehicle.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)
Bertsekas, D.P., Nedić, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont (2003)
Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley, New York (1984). Republished by Athena Scientific, Belmont (1998)
Bertsekas, D.P., Mitter, S.K.: Steepest descent for optimization problems with nondifferentiable cost functionals. In: Proc. 5th Annual Princeton Confer. Inform. Sci. Systems, Princeton, NJ, pp. 347–351 (1971)
Bertsekas, D.P., Mitter, S.K.: A descent numerical method for optimization problems with nondifferentiable cost functionals. SIAM J. Control 11, 637–652 (1973)
Rockafellar, R.T.: Monotropic programming: descent algorithms and duality. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 4, pp. 327–366. Academic Press, San Diego (1981)
Tseng, P.: Some convex programs without a duality gap. Report, Mathematics Department, University of Washington, Seattle. Revised February 2006. Math. Program. (to appear)
Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms, vol. I. Springer, Berlin (1993)
Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms, vol. II. Springer, Berlin (1993)
Hiriart-Urruty, J.-B., Moussaoui, M., Seeger, A., Volle, M.: Subdifferential calculus without qualification conditions, using approximate subdifferentials: a survey. Nonlinear Anal. 24, 1727–1754 (1995)
Bertsekas, D.P., Gallager, R.G.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)
Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by P. Tseng.
Work partially supported by the National Science Foundation Grant No. CCR-9731273.
Rights and permissions
About this article
Cite this article
Bertsekas, D.P. Extended Monotropic Programming and Duality. J Optim Theory Appl 139, 209–225 (2008). https://doi.org/10.1007/s10957-008-9393-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-008-9393-3