IDEAS home Printed from https://ideas.repec.org/p/mit/sloanp/2634.html
   My bibliography  Save this paper

Interior point methods : current status and future directions

Author

Listed:
  • Freund, Robert Michael.
  • Mizuno, Shinji.

Abstract

No abstract is available for this item.

Suggested Citation

  • Freund, Robert Michael. & Mizuno, Shinji., 1996. "Interior point methods : current status and future directions," Working papers 3924-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    • Handle: RePEc:mit:sloanp:2634
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1721.1/2634
    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. Nunez, M. A. (Manuel A.) & Freund, Robert Michael. & Massachusetts Institute of Technology. Operations Research Center., 1996. "Condition measures and properties of the central trajectory of a linear program," Working papers 316-96., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    3. Andersen, E.D. & Gondzio, J. & Meszaros, C. & Xu, X., 1996. "Implementation of Interior Point Methods for Large Scale Linear Programming," Papers 96.3, Ecole des Hautes Etudes Commerciales, Universite de Geneve-.
    Full references (including those not matched with items on IDEAS)

    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. 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. Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
    3. Holder, A.G. & Sturm, J.F. & Zhang, S., 1998. "Analytic central path, sensitivity analysis and parametric linear programming," Econometric Institute Research Papers EI 9801, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    4. Maros, Istvan & Haroon Khaliq, Mohammad, 2002. "Advances in design and implementation of optimization software," European Journal of Operational Research, Elsevier, vol. 140(2), pages 322-337, July.
    5. Enzo Busseti, 2019. "Derivative of a Conic Problem with a Unique Solution," Papers 1903.05753, arXiv.org, revised Mar 2019.
    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. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    8. Stojkovic, Nebojsa V. & Stanimirovic, Predrag S., 2001. "Two direct methods in linear programming," European Journal of Operational Research, Elsevier, vol. 131(2), pages 417-439, June.
    9. Jacek Gondzio & Andreas Grothey, 2009. "Exploiting structure in parallel implementation of interior point methods for optimization," Computational Management Science, Springer, vol. 6(2), pages 135-160, May.
    10. Maziar Salahi & Renata Sotirov & Tamás Terlaky, 2004. "On self-regular IPMs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(2), pages 209-275, December.
    11. Luca Bergamaschi & Jacek Gondzio & Manolo Venturin & Giovanni Zilli, 2007. "Inexact constraint preconditioners for linear systems arising in interior point methods," Computational Optimization and Applications, Springer, vol. 36(2), pages 137-147, April.
    12. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    13. Gondzio, Jacek, 2012. "Interior point methods 25 years later," European Journal of Operational Research, Elsevier, vol. 218(3), pages 587-601.
    14. 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.
    15. 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.
    16. Fernanda Raupp & B. Svaiter, 2009. "Analytic center of spherical shells and its application to analytic center machine," Computational Optimization and Applications, Springer, vol. 43(3), pages 329-352, July.
    17. A.G. Holder & J.F. Sturm & S. Zhang, 1998. "Analytic Central Path, Sensitivity Analysis and Parametric Linear Programming," Tinbergen Institute Discussion Papers 98-003/4, Tinbergen Institute.
    18. Kuo-Ling Huang & Sanjay Mehrotra, 2013. "An empirical evaluation of walk-and-round heuristics for mixed integer linear programs," Computational Optimization and Applications, Springer, vol. 55(3), pages 545-570, July.
    19. Coralia Cartis & Yiming Yan, 2016. "Active-set prediction for interior point methods using controlled perturbations," Computational Optimization and Applications, Springer, vol. 63(3), pages 639-684, April.
    20. Thomas Schmelzer & Raphael Hauser & Erling Andersen & Joachim Dahl, 2013. "Regression techniques for Portfolio Optimisation using MOSEK," Papers 1310.3397, arXiv.org.

    More about this item

    Keywords

    HD28 .M414 no.3924-96;

    JEL classification:

    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:mit:sloanp:2634. 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: None (email available below). General contact details of provider: https://edirc.repec.org/data/ssmitus.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.