Skip to main content

One-Dimensional Optimization

  • Chapter
Practical Optimization
  • 7448 Accesses

Abstract

Three general classes of nonlinear optimization problems can be identified, as follows:

  1. 1.

    One-dimensional unconstrained problems

  2. 2.

    Multidimensional unconstrained problems

  3. 3.

    Multidimensional constrained problems

Problems of the first class are the easiest to solve whereas those of the third class are the most difficult. In practice, multidimensional constrained problems are usually reduced to multidimensional unconstrained problems which, in turn, are reduced to one-dimensional unconstrained problems. In effect, most of the available nonlinear programming algorithms are based on the minimization of a function of a single variable without constraints. Therefore, efficient one-dimensional optimization algorithms are required, if efficient multidimensional unconstrained and constrained algorithms are to be constructed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.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. D. M. Himmelblau, Applied Nonlinear Programming, McGraw-Hill, New York, 1972.

    MATH  Google Scholar 

  2. B. S. Gottfried and J. Weisman, Introduction to Optimization Theory, Prentice-Hall, Englewood Cliffs, N.J., 1973.

    Google Scholar 

  3. P. R. Adby and M. A. H. Dempster, Introduction to Optimization Methods, Chapman and Hall, London, 1974.

    MATH  Google Scholar 

  4. C. S. Beightler, D. T. Phillips, and D. J. Wilde, Foundations of Optimization, Prentice-Hall, Englewood Cliffs, N.J., 1979.

    Google Scholar 

  5. M. S. Bazaraa and C. M. Shetty, Nonlinear Programming, Theory and Algorithms, Wiley, New York, 1979.

    MATH  Google Scholar 

  6. P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization, Academic Press, London, 1981.

    MATH  Google Scholar 

  7. G. P. McCormick, Nonlinear Programming, Wiley, New York, 1983.

    MATH  Google Scholar 

  8. M. J. Box, D. Davies, and W. H. Swann, Nonlinear Optimization Techniques, Oliver and Boyd, London, 1969.

    Google Scholar 

  9. R. Fletcher, Practical Methods of Optimization, 2nd ed., Wiley, New York, 1987.

    MATH  Google Scholar 

  10. R. Fletcher, Practical Methods of Optimization, vol. 1, Wiley, New York, 1980.

    MATH  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

(2007). One-Dimensional Optimization. In: Practical Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71107-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-71107-2_4

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-71106-5

  • Online ISBN: 978-0-387-71107-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics