Abstract
The facial reduction algorithm (FRA) of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program
in the absence of any constraint qualification. The FRA solves a sequence of auxiliary optimization problems to obtain such a dual. Ramana’s dual is applicable when (P) is a semidefinite program (SDP) and is an explicit SDP itself. Ramana, Tunçel, and Wolkowicz showed that these approaches are closely related; in particular, they proved the correctness of Ramana’s dual using certificates from a facial reduction algorithm. Here we give a simple and self-contained exposition of facial reduction, of extended duals, and generalize Ramana’s dual:
-
We state a simple FRA and prove its correctness.
-
Building on this algorithm we construct a family of extended duals when K is a nice cone. This class of cones includes the semidefinite cone and other important cones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. Ser. B 95 3–51 (2003)
Andersen, E.D., Roos, C., Terlaky, T.: Notes on duality in second order and p-order cone optimization. Optimization 51, 627–643 (2002)
Ben-Tal, A., Nemirovskii, A.: Lectures on Modern Convex Optimization. MPS/SIAM Series on Optimization. SIAM, Philadelphia (2001)
Bonnans, F.J., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research. Springer, New York (2000)
Borwein, J.M., Wolkowicz, H.: Facial reduction for a cone-convex programming problem. J. Aust. Math. Soc. 30, 369–380 (1981)
Borwein, J.M., Wolkowicz, H.: Regularizing the abstract convex program. J. Math. Anal. App. 83, 495–530 (1981)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Cheung, V., Wolkowicz, H., Schurr, S.: Preprocessing and regularization for degenerate semidefinite programs. Technical Report, University of Waterloo (2012)
Chua, C.-B.: Relating homogeneous cones and positive definite cones via T-algebras. SIAM J. Optim. 14, 500–506 (2003)
Chua, C.-B., Tunçel, L.: Invariance and efficiency of convex representations. Math. Program. B 111, 113–140 (2008)
Faybusovich, L.: On Nesterov’s approach to semi-definite programming. Acta Appl. Math. 74, 195–215 (2002)
Freund, R.M.: Talk at the University of Waterloo (1994)
Freund, R.M., Roundy, R., Todd, M.J.: Identifying the set of always-active constraints in a system of linear inequalities by a single linear program. Technical Report Sloan W.P. No. 1674–1685, Sloan School of Business, MIT (1985)
Gouveia, J., Parrilo, P., Thomas, R.: Lifts of convex sets and cone factorizations. Math. Oper. Res. (2013) (to appear)
G\(\ddot{\mathrm{u}}\)ler, O.: Foundations of Optimization. Graduate Texts in Mathematics. Springer, New York (2010)
Helmberg, C.: The semidefinite programming webpage. http://www-user.tu-chemnitz.de/~semidef.html
Klep, I., Schweighofer, M.: An exact duality theory for semidefinite programming based on sums of squares. Technical Report, Universität Konstanz. http://arxiv.org/abs/1207.1691 (2012)
Lewis, A.S.: Facial reduction in partially finite convex programming. Math. Program. B 65, 123–138 (1994)
Luo, Z.-Q., Sturm, J.: Error analysis. In: Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.) Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht (2000)
Luo, Z.-Q., Sturm, J., Zhang, S.: Duality results for conic convex programming. Technical Report 9719/A, Econometric Institute, Erasmus University, Rotterdam (1997)
Pataki, G.: A simple derivation of a facial reduction algorithm and extended dual systems. Technical Report, Columbia University (2000)
Pataki, G.: On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32, 395–412 (2007)
Pataki, G.: Bad semidefinite programs: they all look the same. Technical Report, University of North Carolina at Chapel Hill (2010). Available from http://arxiv.org/abs/1112.1436 (under review)
Pataki, G.: On the connection of facially exposed and nice cones. J. Math. Anal. App. 400, 211–221 (2013)
Pólik, I., Terlaky, T.: Exact duality for optimization over symmetric cones. Technical Report, Lehigh University (2009)
Ramana, M.V.: An exact duality theory for semidefinite programming and its complexity implications. Math. Program. Ser. B 77, 129–162 (1997)
Ramana, M.V., Tunçel, L., Wolkowicz, H.: Strong duality for semidefinite programming. SIAM J. Opt. 7, 641–662 (1997)
Rockafellar, T.R.: Convex Analysis. Princeton University Press, Princeton (1970)
Schurr, S.P., Tits, A.L., O’Leary, D.P.: Universal duality in conic convex optimization. Math. Program. 109, 69–88 (2007)
Tunçel, L., Wolkowicz, H.: Strong duality and minimal representations for cone optimization. Comput. Optim. Appl. 53, 619–648
Roshchina, V.: Facially exposed cones are not nice in general. Technical Report, University of Ballarat (2013). http://arxiv.org/abs/1301.1000
Saigal, R., Vandenberghe, L., Wolkowicz, H. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht (2000)
Jos Sturm: Error bounds for linear matrix inequalities. SIAM J. Optim. 10, 1228–1248 (2000)
Todd, M.J.: Semidefinite Optimization. Acta Numer. 10, 515–560 (2001)
Tunçel, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. Fields Institute Monographs. American Mathematical Society, Providence (2011)
Waki, H., Muramatsu, M.: Facial reduction algorithms for conic optimization problems. Technical Report CS-09-01, Department of Computer Science, The University of Electro-Communications (2009)
Wang, Y., Xiu, N., Luo, Z.: A regularized strong duality for nonsymmetric semidefinite least squares problem. Optim. Lett. 5, 665–682 (2011)
Acknowledgements
I would like to thank an anonymous referee and Minghui Liu for their helpful comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Additional information
Dedicated to Jonathan Borwein on the occasion of his 60th birthday
Communicated By Heinz H. Bauschke.
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this paper
Cite this paper
Pataki, G. (2013). Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals. In: Bailey, D., et al. Computational and Analytical Mathematics. Springer Proceedings in Mathematics & Statistics, vol 50. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7621-4_28
Download citation
DOI: https://doi.org/10.1007/978-1-4614-7621-4_28
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-7620-7
Online ISBN: 978-1-4614-7621-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)