Skip to main content

Identification of Hidden Convex Minimization Problems

  • Conference paper
  • 915 Accesses

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 77))

Abstract

If a nonconvex minimization problem can be converted into an equivalent convex minimization problem, the primal nonconvex minimization problem is called a hidden convex minimization problem. Sufficient conditions are developed in this paper to identify such hidden convex minimization problems. Hidden convex minimization problems possess the same desirable property as convex minimization problems: Any lo- cal minimum is also a global minimum. Identification of hidden convex minimization problem extends the reach of global optimization.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   89.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • M. Avriel (1976), Nonlinear Programming: Analysis and Methods, Prentice Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • R. Horst (1984), On the convexification of nonlinear programming problems: An applications-oriented survey, European Journal of Operations Research, 15, pp. 382–392.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Li, X. L. Sun, M. P. Biswal and F. Gao (2001), Convexification, concavification and monotonization in global optimization, Annals of Operations Research, 105, pp. 213–226.

    Article  MathSciNet  Google Scholar 

  • D. Li, Z. Wu, H. W. J. Lee, X. Yang and L. Zhang (2003), Hidden convex minimization, to appear in Journal of Global Optimization, 2003.

    Google Scholar 

  • Sun, X. L., McKinnon, K. and Li, D. (2001), A convexification method for a class of global optimization problem with application to reliability optimization, Journal of Global Optimization, 21, pp. 185–199.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer Science + Business Media, Inc.

About this paper

Cite this paper

Li, D., Wu, Z., Lee, H.W.J., Yang, X., Zhang, L. (2005). Identification of Hidden Convex Minimization Problems. In: Eberhard, A., Hadjisavvas, N., Luc, D.T. (eds) Generalized Convexity, Generalized Monotonicity and Applications. Nonconvex Optimization and Its Applications, vol 77. Springer, Boston, MA. https://doi.org/10.1007/0-387-23639-2_17

Download citation

Publish with us

Policies and ethics