Conjugate direction algorithms for extended conic functions

 Access to full text

 Full (PDF)

1. J. Abaffy, F. Sloboda, Imperfect conjugate gradient algorithms for extended quadratic functions, Numer. Math. 42 (1983), 97-105. (1983) Zbl0524.65045MR0716476
2. P. Bjorstad, J. Nocedal, Analysis of a new algorithm for one-dimensional minimization, Computing 22 (1979), 93-100. (1979) Zbl0401.65041MR0620386
3. C. G. Broyden, Quasi-Newton methods and their application to function minimization, Math. Comp. 21 (1967), 368-381. (1967) MR0224273
4. W. C. Davidon, Variable Metric Method for Minimization, Report ANL-5990 Rev., Argonne National Laboratories, Argonne, IL, 1959. (1959) 
5. W. C. Davidon, Conic approximations and collinear scalings for optimizers, SIAM J. Numer. Anal. 17 (1980), 268-281. (1980) Zbl0424.65026MR0567273
6. E. J. Davison, P. Wong, A robust algorithm that minimizes 1-functions, Automatica 11 (1975), 287-308. (1975) MR0406520
7. L. C. W. Dixon, Conjugate directions without linear searches, Inst. Math. Appl. 11 (1973), 317-328. (1973) Zbl0259.65060MR0336995
8. L. C. W. Dixon, Conjugate gradient algorithm: quadratic termination properties without line searches, Inst. Math. Appl. 15 (1975), 9-18. (1975) MR0368429
9. J. Flachs, On the convergence, invariance, and related aspects of a modification of Huang's algorithm, Optim. Theory Appl. 37 (1982), 315-341. (1982) Zbl0462.65042MR0663527
10. R. Fletcher, M. J. D. Powell., A rapidly convergent descent method for minimization, Comput. J. 6 (1963), 163-168. (1963) Zbl0132.11603MR0152116
11. R. Fletcher, C. M. Reeves, Function minimization by conjugate gradients, Comput. J. 7 (1964), 149-154. (1964) Zbl0132.11701MR0187375
12. D. Goldfarb, Extension of Davidon's variable metric method to maximization under linear inequality and equality constraints, SIAM J. Appl. Math. 17 (1969), 739-763. (1969) Zbl0185.42602MR0290799
13. M. R. Hestenes, E. Stiefel, The method of conjugate gradients for solving linear systems, J. Res. Nat. Bur. Standards 49 (1952), 409-436. (1952) MR0060307
14. H. Y. Huang, Method of Dual Matrices for Function Minimization, Aero-Astronautic Report No. 88, Rice University, Houston, TX, 1972. (1972) Zbl0254.65044
15. M. L. Lenard, Accelerated Conjugate Direction Methods for Unconstrained Optimization, Technical Report No. MRC-1591, University of Wisconsin, Madison, WI, 1976. (1976) 
16. L. Lukšan, Conjugate gradient algorithms for conic functions, Aplikace matemat. (to appear). MR0870480
17. L. Lukšan, Variable metric methods for a class of extended conic functions, Kybernetika 21 (1985), 96-107. (1985) MR0797323
18. L. Nazareth, A conjugate direction algorithm without line searches, J. Optim. Theory Appl. 23 (1977), 373-387. (1977) Zbl0348.65061MR0525743
19. J. E. Shirey, Minimization of extended quadratic functions, Numer. Math. 39 (1982), 157-161. (1982) Zbl0491.65038MR0669312
20. F. Sloboda, An imperfect conjugate gradient algorithm, Aplikace matematiky 27 (1982), 426-434. (1982) Zbl0503.65017MR0678112
21. F. Sloboda, A generalized conjugate gradient algorithm for minimization, Numer. Math. 35 (1980), 223-230. (1980) Zbl0424.65033MR0585248
22. D. C. Sorensen, The Q-superlinear convergence of a collinear scaling algorithm for unconstrained optimization, SIAM J. Numer. Anal. 17 (1980), 84-114. (1980) Zbl0428.65040MR0559465
23. E. Spedicato, A variable-metric method for function minimization derived from invariancy to nonlinear scaling, J. Optim. Theory Appl. 20 (1976), 315-329. (1976) Zbl0316.90066MR0426854
24. G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam 1960. (1960) Zbl0097.35408