IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v158y2013i3d10.1007_s10957-013-0278-8.html
   My bibliography  Save this article

A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization

Author

Listed:
  • M. Zangiabadi

    (Shahrekord University)

  • G. Gu

    (Nanjing University)

  • C. Roos

    (Delft University of Technology)

Abstract

After a brief introduction to Jordan algebras, we present a primal–dual interior-point algorithm for second-order conic optimization that uses full Nesterov–Todd steps; no line searches are required. The number of iterations of the algorithm coincides with the currently best iteration bound for second-order conic optimization. We also generalize an infeasible interior-point method for linear optimization to second-order conic optimization. As usual for infeasible interior-point methods, the starting point depends on a positive number. The algorithm either finds a solution in a finite number of iterations or determines that the primal–dual problem pair has no optimal solution with vanishing duality gap.

Suggested Citation

  • M. Zangiabadi & G. Gu & C. Roos, 2013. "A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 158(3), pages 816-858, September.
  • Handle: RePEc:spr:joptap:v:158:y:2013:i:3:d:10.1007_s10957-013-0278-8
    DOI: 10.1007/s10957-013-0278-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-013-0278-8
    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-013-0278-8?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. Shinji Mizuno & Michael J. Todd & Yinyu Ye, 1995. "A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming," Mathematics of Operations Research, INFORMS, vol. 20(1), pages 135-162, February.
    2. 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.
    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. M. Sayadi Shahraki & H. Mansouri & M. Zangiabadi, 2017. "Two wide neighborhood interior-point methods for symmetric cone optimization," Computational Optimization and Applications, Springer, vol. 68(1), pages 29-55, September.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. Terlaky, Tamas, 2001. "An easy way to teach interior-point methods," European Journal of Operational Research, Elsevier, vol. 130(1), pages 1-19, April.
    6. Michael Orlitzky, 2021. "Gaddum’s test for symmetric cones," Journal of Global Optimization, Springer, vol. 79(4), pages 927-940, April.
    7. 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.
    8. 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.
    9. 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.
    10. E. A. Yıldırım, 2003. "An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming," Mathematics of Operations Research, INFORMS, vol. 28(4), pages 649-676, November.
    11. Xiao-Kang Wang & Wen-Hui Hou & Chao Song & Min-Hui Deng & Yong-Yi Li & Jian-Qiang Wang, 2021. "BW-MaxEnt: A Novel MCDM Method for Limited Knowledge," Mathematics, MDPI, vol. 9(14), pages 1-17, July.
    12. Héctor Ramírez & David Sossa, 2017. "On the Central Paths in Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 172(2), pages 649-668, February.
    13. Caron, Richard J. & Greenberg, Harvey J. & Holder, Allen G., 2002. "Analytic centers and repelling inequalities," European Journal of Operational Research, Elsevier, vol. 143(2), pages 268-290, December.
    14. Vasile L. Basescu & John E. Mitchell, 2008. "An Analytic Center Cutting Plane Approach for Conic Programming," Mathematics of Operations Research, INFORMS, vol. 33(3), pages 529-551, August.
    15. Ximei Yang & Hongwei Liu & Yinkui Zhang, 2015. "A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 572-587, August.
    16. G. Q. Wang & Y. Q. Bai & X. Y. Gao & D. Z. Wang, 2015. "Improved Complexity Analysis of Full Nesterov–Todd Step Interior-Point Methods for Semidefinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 242-262, April.
    17. J.F. Sturm & S. Zhang, 1998. "On Sensitivity of Central Solutions in Semidefinite Programming," Tinbergen Institute Discussion Papers 98-040/4, Tinbergen Institute.
    18. 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.
    19. Changhe Liu & Hongwei Liu, 2012. "A new second-order corrector interior-point algorithm for semidefinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 75(2), pages 165-183, April.
    20. Behrouz Kheirfam, 2015. "A Corrector–Predictor Path-Following Method for Convex Quadratic Symmetric Cone Optimization," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 246-260, January.

    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:158:y:2013:i:3:d:10.1007_s10957-013-0278-8. 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.