Skip to main content
Log in

Imperfect conjugate gradient algorithms for extended quadratic functions

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

Generalized conjugate gradient algorithms which are invariant to a nonlinear scaling of a strictly convex quadratic function are described. The algorithms when applied to scaled quadratic functionsf∶R n →R 1 of the formf(x)=h(F(x)) withF(x) strictly convex quadratic andh∈C 1(R 1) an arbitrary strictly monotone functionh generate the same direction vectors as for the functionF without perfect steps.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Babtist, P., Stoer, J.: On the relation between quadratic termination and convergence properties of minimization algorithms. Part 2. Numer. Math.28, 367–391 (1977)

    Google Scholar 

  2. Biggs, M.C.: Minimization algorithms making use of non-quadratic properties of the objective functions. J. Inst. Math. Appl.8, 315–327 (1971)

    Google Scholar 

  3. Boland, W.R., Kamgnia, E.R., Kowalik, J.S.: A conjugate gradient optimization method invariant to nonlinear scaling. JOTA27, 221–230 (1979)

    Google Scholar 

  4. Boland, W.R., Kowalik, J.S.: Extended conjugate gradient methods with restarts. JOTA28, 1–9 (1979)

    Google Scholar 

  5. Hestenes, M., Stiefel, E.: The method of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards Sect. B49, 409–436 (1952)

    Google Scholar 

  6. Hottenbalken, B.: A finite algorithm to maximize certain pseudoconcave functions on polytopes. Math. Programming8, 189–206 (1975)

    Google Scholar 

  7. Jacobson, D.H., Oksmann, W.: An algorithm that minimizes homogeneous functions ofN variables inN+2 iterations and rapidly minimizes general functions. J. Math. Anal. Appl.38, 535–545 (1972)

    Google Scholar 

  8. Kowalik, J.S., Ramakrishnan, K.C.: A numerically stable optimization method based on a homogeneous function. Math. Programming11, 50–66 (1976)

    Google Scholar 

  9. Kowalik, J.S., Kamgnia, E.R.: An exponential function as a model for a conjugate gradient optimization method. J. Math. Anal. Appl.67, 476–482 (1979)

    Google Scholar 

  10. Shirey, J.E.: Minimization of extended quadratic functions. Numer. Math.39, 157–161 (1982)

    Google Scholar 

  11. Sloboda, F.: A generalized conjugate gradient algorithm for minimization. Numer. Math.35, 223–230 (1980)

    Google Scholar 

  12. Sloboda, F.: An imperfect conjugate gradient algorithm. Aplikace matematiky27, 426–434 (1982)

    Google Scholar 

  13. Spedicato, E.: A variable-metric method for function minimization derived from invariancy to nonlinear scaling. JOTA20, 315–329 (1976)

    Google Scholar 

  14. Spedicato, E.: A note on the determination of the scaling parameters in a class of Quasi-Newton methods for unconstrained optimization. J. Inst. Math. Appl.21, 285–291 (1978)

    Google Scholar 

  15. Stoer, J.: On the relation between quadratic termination and convergence properties of minimization algorithms. Part 1. Theory. Numer. Math.28, 343–366 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Abaffy, J., Sloboda, F. Imperfect conjugate gradient algorithms for extended quadratic functions. Numer. Math. 42, 97–105 (1983). https://doi.org/10.1007/BF01400920

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01400920

Subject Classifications

Navigation