IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/1412.html
   My bibliography  Save this paper

Duality Results for Conic Convex Programming

Author

Listed:
  • Luo, Z-Q.
  • Sturm, J.F.
  • Zhang, S.

Abstract

This paper presents a unified study of duality properties for the problem of minimizing a linear function over the intersection of an affine space with a convex cone in finite dimension. Existing duality results are carefully surveyed and some new duality properties are established. Examples are given to illustrate these new properties. The topics covered in this paper include Gordon-Stiemke type theorems, Farkas type theorems, perfect duality, Slater condition, regularization, Ramana's duality, and approximate dualities. The dual representations of various convex sets, convex cones and conic convex programs are also discussed.

Suggested Citation

  • Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1997. "Duality Results for Conic Convex Programming," Econometric Institute Research Papers EI 9719/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:1412
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/1412/eeb19960111120060.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Epelman, Marina A., 1973-. & Freund, Robert Michael, 1997. "Condition number complexity of an elementary algorithm for resolving a conic linear system," Working papers WP 3942-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1996. "Duality and Self-Duality for Conic Convex Programming," Econometric Institute Research Papers EI 9620-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    3. NESTEROV , Yurii & TODD , Michael, 1995. "Primal-Dual Interior-Point Methods for Self-Scaled Cones," LIDAM Discussion Papers CORE 1995044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. NESTEROV, Yurii & TODD, Michael & YE, Yinyu, 1996. "Primal-Dual Methods and Infeasibility Detectors for Nonlinear Programming Problems," LIDAM Discussion Papers CORE 1996037, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ernest K. Ryu & Yanli Liu & Wotao Yin, 2019. "Douglas–Rachford splitting and ADMM for pathological convex optimization," Computational Optimization and Applications, Springer, vol. 74(3), pages 747-778, December.
    2. O. I. Kostyukova & T. V. Tchemisova, 2022. "On strong duality in linear copositive programming," Journal of Global Optimization, Springer, vol. 83(3), pages 457-480, July.
    3. Zhang, S., 1998. "Global error bounds for convex conic problems," Econometric Institute Research Papers EI 9830, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    5. Yao, D.D. & Zhang, S. & Zhou, X.Y., 1999. "LQ control without Ricatti equations: deterministic systems," Econometric Institute Research Papers EI 9913-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1998. "Conic convex programming and self-dual embedding," Econometric Institute Research Papers EI 9815, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Kenneth O. Kortanek & Guolin Yu & Qinghong Zhang, 2021. "Strong duality for standard convex programs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 413-436, December.
    8. Zhi-Quan Luo & Shuzhong Zhang, 1997. "On the extensions of Frank-Wolfe theorem," Tinbergen Institute Discussion Papers 97-122/4, Tinbergen Institute.
    9. Hayato Waki & Masakazu Muramatsu, 2013. "Facial Reduction Algorithms for Conic Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 158(1), pages 188-215, July.
    10. Brinkhuis, J. & Zhang, S., 2003. "A D-induced duality and its applications," Econometric Institute Research Papers EI 2003-42, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Luo, Z-Q. & Sturm, J.F. & Zhang, S., 1998. "Conic convex programming and self-dual embedding," Econometric Institute Research Papers EI 9815, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    2. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Discussion Paper 2002-73, Tilburg University, Center for Economic Research.
    3. Levent Tunçel, 1998. "Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 708-718, August.
    4. Arjan Berkelaar & Cees Dert & Bart Oldenkamp & Shuzhong Zhang, 2002. "A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming," Operations Research, INFORMS, vol. 50(5), pages 904-915, October.
    5. Sturm, Jos F. & Zhang, Shuzhong, 2000. "On weighted centers for semidefinite programming," European Journal of Operational Research, Elsevier, vol. 126(2), pages 391-407, October.
    6. Arjan B. Berkelaar & Jos F. Sturm & Shuzhong Zhang, 1997. "Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming," Tinbergen Institute Discussion Papers 97-025/4, Tinbergen Institute.
    7. Wong, Man Hong & Zhang, Shuzhong, 2013. "Computing best bounds for nonlinear risk measures with partial information," Insurance: Mathematics and Economics, Elsevier, vol. 52(2), pages 204-212.
    8. F. A. Potra & R. Sheng, 1998. "Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming," Journal of Optimization Theory and Applications, Springer, vol. 99(1), pages 103-119, October.
    9. Badenbroek, Riley & Dahl, Joachim, 2020. "An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK," Other publications TiSEM bcf7ef05-e4e6-4ce8-b2e9-6, Tilburg University, School of Economics and Management.
    10. A. D'Aspremont, 2003. "Interest rate model calibration using semidefinite Programming," Applied Mathematical Finance, Taylor & Francis Journals, vol. 10(3), pages 183-213.
    11. Renato D. C. Monteiro & Paulo R. Zanjácomo, 2000. "General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems," Mathematics of Operations Research, INFORMS, vol. 25(3), pages 381-399, August.
    12. Chris Coey & Lea Kapelevich & Juan Pablo Vielma, 2022. "Solving Natural Conic Formulations with Hypatia.jl," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2686-2699, September.
    13. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Discussion Paper 2001-27, Tilburg University, Center for Economic Research.
    14. Bahman Kalantari, 2015. "A characterization theorem and an algorithm for a convex hull problem," Annals of Operations Research, Springer, vol. 226(1), pages 301-349, March.
    15. NESTEROV, Yu., 2006. "Towards nonsymmetric conic optimization," LIDAM Discussion Papers CORE 2006028, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    16. Li Yang & Bo Yu, 2013. "A homotopy method for nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 56(1), pages 81-96, September.
    17. Constantin Zălinescu, 2008. "On Zero Duality Gap and the Farkas Lemma for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(4), pages 991-1001, November.
    18. Sturm, J.F., 2002. "Implementation of Interior Point Methods for Mixed Semidefinite and Second Order Cone Optimization Problems," Other publications TiSEM b25faf5d-0142-4e14-b598-a, Tilburg University, School of Economics and Management.
    19. Alemseged Weldeyesus & Mathias Stolpe, 2015. "A primal-dual interior point method for large-scale free material optimization," Computational Optimization and Applications, Springer, vol. 61(2), pages 409-435, June.
    20. Berkelaar, A.B. & Dert, C.L. & Oldenkamp, K.P.B. & Zhang, S., 1999. "A primal-dual decomposition based interior point approach to two-stage stochastic linear programming," Econometric Institute Research Papers EI 9918-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ems:eureir:1412. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.