IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v155y2012i2d10.1007_s10957-012-0071-0.html
   My bibliography  Save this article

The Accuracy of Interior-Point Methods Based on Kernel Functions

Author

Listed:
  • Manuel V. C. Vieira

    (Universidade Nova de Lisboa)

Abstract

For the last decade, interior-point methods that use barrier functions induced by some real univariate kernel functions have been studied. In these interior-point methods, the algorithm stops when a solution is found such that it is close (in the barrier function sense) to a point in the central path with the desired accuracy. However, this does not directly imply that the algorithm generates a solution with prescribed accuracy. Until now, this had not been appropriately addressed. In this paper, we analyze the accuracy of the solution produced by the aforementioned algorithm.

Suggested Citation

  • Manuel V. C. Vieira, 2012. "The Accuracy of Interior-Point Methods Based on Kernel Functions," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 637-649, November.
    • Handle: RePEc:spr:joptap:v:155:y:2012:i:2:d:10.1007_s10957-012-0071-0
    DOI: 10.1007/s10957-012-0071-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-012-0071-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-012-0071-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Y. Q. Bai & G. Lesaja & C. Roos & G. Q. Wang & M. El Ghami, 2008. "A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization," Journal of Optimization Theory and Applications, Springer, vol. 138(3), pages 341-359, September.
    2. M. Reza Peyghami, 2009. "An Interior Point Approach For Semidefinite Optimization Using New Proximity Functions," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(03), pages 365-382.
    3. Peng, Jiming & Roos, Cornelis & Terlaky, Tamas, 2002. "A new class of polynomial primal-dual methods for linear and semidefinite optimization," European Journal of Operational Research, Elsevier, vol. 143(2), pages 234-256, December.
    4. Potra, Florian A., 2002. "The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path," European Journal of Operational Research, Elsevier, vol. 143(2), pages 257-267, December.
    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. Zsolt Darvay & Petra Renáta Takács, 2018. "Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(3), pages 551-563, September.
    2. G. Q. Wang & Y. Q. Bai, 2012. "A Class of Polynomial Interior Point Algorithms for the Cartesian P-Matrix Linear Complementarity Problem over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 739-772, March.
    3. Marianna E.-Nagy & Anita Varga, 2023. "A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(3), pages 691-711, September.
    4. Salahi, Maziar & Terlaky, Tamas, 2007. "Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms," European Journal of Operational Research, Elsevier, vol. 182(2), pages 502-513, October.
    5. Tibor Illés & Marianna Nagy & Tamás Terlaky, 2010. "A polynomial path-following interior point algorithm for general linear complementarity problems," Journal of Global Optimization, Springer, vol. 47(3), pages 329-342, July.
    6. Illes, Tibor & Nagy, Marianna, 2007. "A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1097-1111, September.
    7. Jingyong Tang & Jinchuan Zhou, 2021. "Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem," Computational Optimization and Applications, Springer, vol. 80(1), pages 213-244, September.
    8. Zs. Darvay & T. Illés & B. Kheirfam & P. R. Rigó, 2020. "A corrector–predictor interior-point method with new search direction for linear optimization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(3), pages 1123-1140, September.
    9. 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.
    10. G. Lesaja & C. Roos, 2011. "Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones," Journal of Optimization Theory and Applications, Springer, vol. 150(3), pages 444-474, September.

    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:spr:joptap:v:155:y:2012:i:2:d:10.1007_s10957-012-0071-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.