Skip to main content
SpringerLink
Log in

Entropy Optimization: Interior Point Methods

Interior Point Algorithms for Entropy Optimization

  • Reference work entry
Encyclopedia of Optimization

  • 314 Accesses

Article Outline

Keywords

See also

References

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 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

Institutional subscriptions

References

  1. Fang S-C, Puthenpura S (1993) Linear optimization and extensions: theory and algorithms. Prentice-Hall, Englewood Cliffs, NJ

    MATH  Google Scholar 

  2. Fang S-C, Rajasekera JR, Tsao H-SJ (1997) Entropy optimization and mathematical programming. Kluwer, Dordrecht

    MATH  Google Scholar 

  3. Han C-G, Pardalos PM, Ye Y (1992) Implementation of interior-point algorithms for some entropy optimization problems. Optim Softw 1:71–80

    Article  Google Scholar 

  4. Kortanek KO, Potra F, Ye Y (1991) On some efficient interior point methods for nonlinear convex programming. Linear Alg & Its Appl 152:169–189

    Article  MATH  MathSciNet  Google Scholar 

  5. Potra F, Ye Y (1993) A quadratically convergent polynomial algorithm for solving entropy optimization problems. SIAM J Optim 3:843–860

    Article  MATH  MathSciNet  Google Scholar 

  6. Rockafellar RT (1970) Convex analysis. Princeton Univ. Press, Princeton

    MATH  Google Scholar 

  7. Sheu RL, Fang S-C (1994) On the generalized path-following methods for linear programming. Optim 30:235–249

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  9. Zhu J, Ye Y (1990) A path-following algorithm for a class of convex programming problems. Working Paper College of Business Administration, Univ Iowa, no. 90-14

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. North Carolina State University, Raleigh, USA

    Shu-Cherng Fang

  2. San Jose State University, San Jose, USA

    Jacob H.-S. Tsao

Authors
  1. Shu-Cherng Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jacob H.-S. Tsao
    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

Fang, SC., Tsao, J.HS. (2008). Entropy Optimization: Interior Point Methods . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_159

Download citation

Publish with us

Policies and ethics

Search

Navigation