Nothing Special   »   [go: up one dir, main page]

Skip to main content

Duality Theory: Monoduality in Convex Optimization

  • Reference work entry
Encyclopedia of Optimization
  • 726 Accesses

Article Outline

Keywords

Saddle Lagrange Duality

Fenchel–Rockafellar Duality

Linear Programming and Central Path

See also

References

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

References

  1. Gao DY (1999) Duality principles in nonconvex systems: Theory, methods and applications. Kluwer, Dordrecht

    Google Scholar 

  2. Wright SJ (1996) Primal-dual interior-point methods. SIAM, Philadelphia

    Google Scholar 

  3. Ye Y (1997) Interior point algorithms: Theory and analysis. Discrete Math and Optim. Wiley/Interscience, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Gao, D.Y. (2008). Duality Theory: Monoduality in Convex Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_141

Download citation

Publish with us

Policies and ethics