IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/bcf7ef05-e4e6-4ce8-b2e9-6d4e3beb3a84.html
   My bibliography  Save this paper

An Algorithm for Nonsymmetric Conic Optimization Inspired by MOSEK

Author

Listed:
  • Badenbroek, Riley

    (Tilburg University, School of Economics and Management)

  • Dahl, Joachim

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
  • Handle: RePEc:tiu:tiutis:bcf7ef05-e4e6-4ce8-b2e9-6d4e3beb3a84
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/41209535/2003.01546.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Yinyu Ye & Michael J. Todd & Shinji Mizuno, 1994. "An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm," Mathematics of Operations Research, INFORMS, vol. 19(1), pages 53-67, February.
    2. Lei Guo & Gui-Hua Lin & Jane J. Ye, 2015. "Solving Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 234-256, July.
    3. Yu. E. Nesterov & M. J. Todd, 1997. "Self-Scaled Barriers and Interior-Point Methods for Convex Programming," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 1-42, February.
    4. 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.
    5. de Klerk, E. & Roos, C. & Terlaky, T., 1997. "Initialization in semidefinite programming via a self-dual, skew-symmetric embedding," Other publications TiSEM aa045849-1e10-4f84-96ca-4, Tilburg University, School of Economics and Management.
    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. Badenbroek, Riley, 2021. "Interior point methods and simulated annealing for nonsymmetric conic optimization," Other publications TiSEM 4374ab25-fdb5-4e6e-a198-6, Tilburg University, School of Economics and Management.

    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. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    2. Mehdi Karimi & Levent Tunçel, 2020. "Primal–Dual Interior-Point Methods for Domain-Driven Formulations," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 591-621, May.
    3. 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.
    4. Kuo-Ling Huang & Sanjay Mehrotra, 2017. "Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 36-53, February.
    5. 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.
    6. 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.
    7. Petra Renáta Rigó & Zsolt Darvay, 2018. "Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier," Computational Optimization and Applications, Springer, vol. 71(2), pages 483-508, November.
    8. 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.
    9. Berkelaar, Arjan & Dert, Cees & Oldenkamp, Bart, 1999. "A primal-dual decompsition-based interior point approach to two-stage stochastic linear programming," Serie Research Memoranda 0026, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    10. Zohrizadeh, Fariba & Josz, Cedric & Jin, Ming & Madani, Ramtin & Lavaei, Javad & Sojoudi, Somayeh, 2020. "A survey on conic relaxations of optimal power flow problem," European Journal of Operational Research, Elsevier, vol. 287(2), pages 391-409.
    11. Helmberg, C., 2002. "Semidefinite programming," European Journal of Operational Research, Elsevier, vol. 137(3), pages 461-482, March.
    12. Chee-Khian Sim, 2019. "Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence," Computational Optimization and Applications, Springer, vol. 74(2), pages 583-621, November.
    13. Sturm, J.F., 2001. "Avoiding Numerical Cancellation in the Interior Point Method for Solving Semidefinite Programs," Other publications TiSEM 949fb20a-a2c6-4d87-85ea-8, Tilburg University, School of Economics and Management.
    14. Robert Chares & François Glineur, 2008. "An interior-point method for the single-facility location problem with mixed norms using a conic formulation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(3), pages 383-405, December.
    15. Enzo Busseti, 2019. "Derivative of a Conic Problem with a Unique Solution," Papers 1903.05753, arXiv.org, revised Mar 2019.
    16. 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.
    17. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    18. B.V. Halldórsson & R.H. Tütüncü, 2003. "An Interior-Point Method for a Class of Saddle-Point Problems," Journal of Optimization Theory and Applications, Springer, vol. 116(3), pages 559-590, March.
    19. G. Q. Wang & Y. Q. Bai, 2012. "A New Full Nesterov–Todd Step Primal–Dual Path-Following Interior-Point Algorithm for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 154(3), pages 966-985, September.
    20. G. Q. Wang & L. C. Kong & J. Y. Tao & G. Lesaja, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Feasible Interior-Point Method for Symmetric Optimization," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 588-604, August.

    More about this item

    Statistics

    Access and download statistics

    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:tiu:tiutis:bcf7ef05-e4e6-4ce8-b2e9-6d4e3beb3a84. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.