Skip to main content

Numerical Methods for Unary Optimization

  • Reference work entry
Encyclopedia of Optimization
  • 115 Accesses

Article Outline

Keywords

Introduction

Goldfarb–Wang Algorithm GW

Analysis of the Replacement Criterion

Using the Trust Region Approach

An Inexact Newton Method Using Preconditioned Conjugate Gradient Techniques

See also

References

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 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. Bandler W, Chen SH, Bienacki RM, Gao L, Madsen K, Yu H (1993) Robust circuit optimization using Huber functions. In: IEEE Trans Macrowave Theory and Techniques, pp 2279–2288

    Google Scholar 

  2. Byrd RH (1981/2) Algorithms for robust regression. In: Powell MJD (ed) Nonlinear Optimization. Acad. Press, New York, pp 79–84

    Google Scholar 

  3. Chen LH, Deng NY, Zhang JZ (1998) Modified partial-update Newton-type algorithms for unary optimization. J Optim Th Appl 97:385–406

    MathSciNet  MATH  Google Scholar 

  4. Deng NY, Wang ZZ (1998) Can Newton's method be surpassed? Chinese Sci Bull 43:132–134

    MathSciNet  Google Scholar 

  5. Deng NY, Wang ZZ (1998/9) Newton's method can be beaten. Quaderno DMSIA Univ. Bergamo, Bergamo

    Google Scholar 

  6. Deng NY, Wang ZZ, Zhang JZ (1999) An improved inexact Newton's method for unary optimization. Techn Report, Dept Math City Univ Hong Kong

    Google Scholar 

  7. Goldfarb D, Wang S (1993) Partial-update Newton method and unary factorable and partially separable optimization. SIAM Optim 3:382–397

    MathSciNet  MATH  Google Scholar 

  8. Kelley CT (1995) Iterative methods for linear and nonlinear equations. SIAM, Philadelphia

    MATH  Google Scholar 

  9. McCormick GP, Sofer A (1991) Optimization with unary functions. Math Program 52:167–178

    MathSciNet  MATH  Google Scholar 

  10. Zhang JZ, Deng NY, Chen LH (1999) On the replacement criteria for unary optimization. Dept Math City Univ Hong Kong, Techn Report MA-99-06

    Google Scholar 

  11. Zhang JZ, Xu CX (1999) A class of indefinite dogleg path methods for unconstrained optimization. SIAM J Optim 9(3):646–667

    MathSciNet  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

Spedicato, E., Deng, N., Zhang, J., Xi, S. (2008). Numerical Methods for Unary Optimization . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_463

Download citation

Publish with us

Policies and ethics