Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 3008–3012Cite as

Potential Reduction Methods for Linear Programming

  • Reference work entry

  • 238 Accesses

Article Outline

Keywords

Primal Potential Reduction Algorithm

Primal-Dual Potential Reduction Algorithm

See also

References

This is a preview of subscription content, 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   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover 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

Learn about institutional subscriptions

References

  1. Anstreicher KM (1986) A monotonic projective algorithm for fractional linear programming. Algorithmica 1(4):483–498

    Article  MathSciNet  MATH  Google Scholar 

  2. Anstreicher KM, Bosch RA (1992) Long steps in a O(n3L) algorithm for linear programming. Math Program 54:251–265

    Article  MathSciNet  MATH  Google Scholar 

  3. Freund RM (1991) Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function. Math Program 51:203–222

    Article  MathSciNet  MATH  Google Scholar 

  4. Gay DM (1987) A variant of Karmarkar's linear programming algorithm for problems in standard form. Math Program 37:81–90 Errata: (1988) Math. Program. 40:11

    Article  MathSciNet  MATH  Google Scholar 

  5. de Ghellinck G, Vial JP (1986) A polynomial Newton method for linear programming. Algorithmica 14):425–453

    Article  MathSciNet  MATH  Google Scholar 

  6. Goldfarb D, Xiao D (1991) A primal projective interior point method for linear programming. Math Program 51:17–43

    Article  MathSciNet  MATH  Google Scholar 

  7. Gonzaga CC (1990) Polynomial affine algorithms for linear programming. Math Program 49:7–21

    Article  MathSciNet  MATH  Google Scholar 

  8. den Hertog D (1992) Interior point approach to linear, quadratic and convex programming, algorithms and complexity. PhD Thesis, Fac. Math. Inform., TU Delft

    Google Scholar 

  9. Karmarkar NK (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373–395

    Article  MathSciNet  MATH  Google Scholar 

  10. Kojima M, Megiddo N, Ye Y (1992) An interior point potential reduction algorithm for the linear complementarity problem. Math Program 54:267–279

    Article  MathSciNet  MATH  Google Scholar 

  11. Mizuno S (1991) O(npL) iteration O(n3L) potential reduction algorithms for linear programming. Linear Alg & Its Appl 152:155–168

    Article  MathSciNet  MATH  Google Scholar 

  12. Monteiro RDC (1992) On the continuous trajectories for a potential reduction algorithm for linear programming. Math Oper Res 17:225–253

    MathSciNet  MATH  Google Scholar 

  13. Nesterov EYu, Nemirovskii AS (1991) Acceleration and parallelization of the path-following interior point method for a linearly constrained convex quadratic problem. SIAM J Optim 1(4):548–564

    Article  MathSciNet  MATH  Google Scholar 

  14. Roos C, Terlaky T, Vial J-Ph (1997) Theory and algorithms for linear optimization: An interior point approach. Wiley, New York

    MATH  Google Scholar 

  15. Sturm JF, Zhang S (1996) New complexity results for the Iri–Imai method. Ann Oper Res 62:539–564

    Article  MathSciNet  MATH  Google Scholar 

  16. Tanabe K (1987) Complementarity-enforced centered Newton method for mathematical programming. In: Tone K (ed) New Methods for Linear Programming. Institute Statist. Math. Japan, Tokyo, pp 118–144

    Google Scholar 

  17. Todd MJ (1996) Potential-reduction methods in mathematical programming. Math Program 76:3–45

    MathSciNet  Google Scholar 

  18. Todd MJ, Burrell BP (1986) An extension of Karmarkar's algorithm for linear programming using dual variables. Algorithmica 1(4):409–424

    Article  MathSciNet  MATH  Google Scholar 

  19. Todd MJ, Ye Y (1990) A centered projective algorithm for linear programming. Math Oper Res 15:508–529

    Article  MathSciNet  MATH  Google Scholar 

  20. Tsuchiya T (1991) Global convergence of the affine scaling methods for degenerate linear programming problems. Math Program 52:377–404

    Article  MathSciNet  MATH  Google Scholar 

  21. Tunçel L (1994) Constant potential primal-dual algorithms: A framework. Math Program 66:145–159

    Article  Google Scholar 

  22. Tutuncu R (1995) An infeasible-interior-point potential-reduction algorithm for linear programming. PhD Thesis, School Oper. Res. and Industr. Engin., Cornell University

    Google Scholar 

  23. Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38(1):49–95

    Article  MathSciNet  MATH  Google Scholar 

  24. Ye Y (1991) An O(n3L) potential reduction algorithm for linear programming. Math Program 50:239–258

    Article  MATH  Google Scholar 

  25. Ye Y (1997) Interior point algorithms: Theory and analysis. Wiley/Interscience, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Management Sci., University Iowa, Iowa City, USA

    Yinyu Ye

Authors
  1. Yinyu Ye
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Ye, Y. (2008). Potential Reduction Methods for Linear Programming . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_515

Download citation

Publish with us

Policies and ethics

Search

Navigation