Skip to main content
SpringerLink
Log in

A Study of the Complexity of an Infeasible Predictor-Corrector Variant of Mehrotra Algorithm

  • Conference paper
Computational Science and Its Applications – ICCSA 2014 (ICCSA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8580))

Included in the following conference series:

Abstract

An infeasible version of the algorithm developed by Bastos and Paixão is analyzed and its complexity is discussed. We prove the efficiency of this infeasible algorithm by showing its complexity and Q-linear convergence. We start by demonstrating that, at each iteration, the step size computed by this infeasible predictor-corrector variant algorithm is bounded below by \(\frac{1}{250\; n^4}\) and has O(n 4 |log(ε)|) iteration complexity; thus, proving that, similarly to what happens with the feasible version, this infeasible version of Bastos and Paixão algorithm has polynomial iteration complexity and is Q-linearly convergent.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Al-Jeiroudi, G., Gondzio, J.: Convergence Analysis of the Inexact Infeasible Interior-Point Method for Linear Optimization. J. Optim. Theory Appl. 141, 231–247 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bastos, F., Paixão, J.: Interior-point approaches to the transportation and assignment problems on microcomputers. Investigação Operacional 13(1), 3–15 (1993)

    Google Scholar 

  3. Freund, R.W., Jarre, F.: A QMR-based interior-point algorithm for solving linear programs. Mathematical Programming 76(1), 183–210 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Güler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Mathematical Programming 60, 215–228 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Karmarkar, N.K.: A new polinomial-time algorithm for linear programming. Combinatorica 4, 373–395 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior point algorithm for linear programming. Mathematical Programming, Series A 61, 261–280 (1993)

    Article  MathSciNet  Google Scholar 

  7. Korzak, J.: Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems. SIAM Journal on Optimization 11(1), 133–148 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Lustig, I.J., Marsten, R.E., Shanno, D.F.: Computational experience with a primal-dual interior point method for linear programming. Linear Algebra and Its Applications 152, 191–222 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Lustig, I.J., Marsten, R.E., Shanno, D.F.: On implementing Mehrotra’s predictor-corrector interior-point method for linear programming. SIAM Journal on Optimization 2(3), 435–449 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  10. Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point method for linear programming: Computational state of the art. ORSA Journal on Computing 6, 1–14 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  11. McShane, K.A., Monma, C.L., Shanno, D.F.: An implementation of a primal-dual interior point method for linear programming. ORSA Journal on Computing 1, 70–83 (1989)

    Article  MATH  Google Scholar 

  12. Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM Journal on Optimization 2, 575–601 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Mizuno, S.: Polynomiality of infeasible interior-point algorithms for linear programming. Mathematical Programming 67, 109–119 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  14. Potra, F.: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points. Mathematical Programming 67, 383–406 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  15. Salahi, M., Peng, J., Terlaky, T.: On Mehrotra-Type Predictor-Corrector Algorithms. SIAM Journal on Optimization 18(4), 1377–1397 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  16. Teixeira, A.P., Almeida, R.: On the Complexity of a Mehrotra-Type Predictor-Corrector Algorithm. In: Murgante, B., Gervasi, O., Misra, S., Nedjah, N., Rocha, A.M.A.C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2012, Part III. LNCS, vol. 7335, pp. 17–29. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  17. Wright, S.: An infeasible interior point algorithm for linear complementarity problems. Mathematical Programming 67, 29–52 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  18. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)

    Book  MATH  Google Scholar 

  19. Wright, S., Zhang, Y.: A superquadratic infeasible interior point method for linear complementarity problems. Mathematical Programming 73, 269–289 (1996)

    MATH  MathSciNet  Google Scholar 

  20. Ye, Y.: Interior Point Algorithms, Theory and Analysis. John Wiley and Sons, Chichester (1997)

    Book  MATH  Google Scholar 

  21. Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM Journal on Optimization 4(1), 208–227 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  22. Zhang, Y., Zhang, D.: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Mathematical Programming 68, 303–318 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  23. Zhang, Z., Zhang, Y.: A Mehrotra-type predictor-corrector algorithm with polynomiality and Q-subquadratic convergence. Annals of Operations Research 62, 131–150 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  24. Zhang, Y., Tapia, R.A., Dennis, J.E.: On the superlinear and quadratic convergence of primal-dual interior point linear programming algorithms. SIAM Journal on Optimization 2, 304–324 (1992)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Science and Technology School Department of Mathematics, University of Trás-os-Montes e Alto Douro, UTAD, Quinta de Prados, 5000-801, Vila Real, Portugal

    Ana Paula Teixeira & Regina Almeida

  2. CIO. Faculty of Sciences, University of Lisbon, Portugal

    Ana Paula Teixeira

  3. CM-UTAD., University of Trás-os-Montes e Alto Douro, Portugal

    Regina Almeida

Authors
  1. Ana Paula Teixeira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Regina Almeida
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering, University of Basilicata, 85100, Potenza, Italy

    Beniamino Murgante

  2. Department of Computer and Information Sciences, Covenant University, Ota, Nigeria

    Sanjay Misra

  3. Department of Production and Systems, University of Minho, 4710-057, Braga, Portugal

    Ana Maria A. C. Rocha

  4. DICAR, Polytecnico di Bari, 70125, Bari, Italy

    Carmelo Torre

  5. University of Minho, Braga, Portugal

    Jorge Gustavo Rocha  & Maria Irene Falcão  & 

  6. Monash University, 3800, Clayton, VIC, Australia

    David Taniar

  7. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, 813-8503, Higashi-ku, Fukuoka, Japan

    Bernady O. Apduhan

  8. Department of Mathematics and Computer Science, University of Perugia, Via Vanvitelli, 1, 06123, Perugia, Italy

    Osvaldo Gervasi

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Teixeira, A.P., Almeida, R. (2014). A Study of the Complexity of an Infeasible Predictor-Corrector Variant of Mehrotra Algorithm. In: Murgante, B., et al. Computational Science and Its Applications – ICCSA 2014. ICCSA 2014. Lecture Notes in Computer Science, vol 8580. Springer, Cham. https://doi.org/10.1007/978-3-319-09129-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09129-7_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09128-0

  • Online ISBN: 978-3-319-09129-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation