Geodesic
Quasi-Newton methods without projections for linearly constrained minimization
Kybernetika, Tome 18 (1982) no. 4, pp. 307-319 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 49D37, 65K05, 90C30 
@article{KYB_1982_18_4_a5,
     author = {Luk\v{s}an, Ladislav},
     title = {Quasi-Newton methods without projections for linearly constrained minimization},
     journal = {Kybernetika},
     pages = {307--319},
     year = {1982},
     volume = {18},
     number = {4},
     mrnumber = {688369},
     zbl = {0514.65048},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1982_18_4_a5/}
}
TY  - JOUR
AU  - Lukšan, Ladislav
TI  - Quasi-Newton methods without projections for linearly constrained minimization
JO  - Kybernetika
PY  - 1982
SP  - 307
EP  - 319
VL  - 18
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/KYB_1982_18_4_a5/
LA  - en
ID  - KYB_1982_18_4_a5
ER  - 
%0 Journal Article
%A Lukšan, Ladislav
%T Quasi-Newton methods without projections for linearly constrained minimization
%J Kybernetika
%D 1982
%P 307-319
%V 18
%N 4
%U http://geodesic.mathdoc.fr/item/KYB_1982_18_4_a5/
%G en
%F KYB_1982_18_4_a5
Lukšan, Ladislav. Quasi-Newton methods without projections for linearly constrained minimization. Kybernetika, Tome 18 (1982) no. 4, pp. 307-319. http://geodesic.mathdoc.fr/item/KYB_1982_18_4_a5/

[1] J. T. Betts: An accelerated multiplier method for nonlinear programming. J. Optim. Theory Appl. 21 (1977), 2, 137-174. | MR | Zbl

[2] W. C. Davidon: Optimally conditioned optimization algorithms without line searches. Math. Programming 9 (1975), 1,1-30. | MR | Zbl

[3] P. E. Gill W. Murray: A numerically stable form of the simplex algorithm. Linear Algebra Appl. 7 (1973), 2, 99-138. | MR

[4] P. E. Gill W. Murray: Newton-type methods for unconstrained and linearly constrained optimization. Math. Programming 7 (1974), 3, 311 - 350. | MR

[5] D. Goldfarb: Extension of Davidon's variable metric method to maximization under inequality and equality linear constraints. SIAM J. Appl. Math. 17 (1969), 4, 739-764. | MR

[6] L. Lukšan: Quasi-Newton methods without projections for unconstrained minimization. Kybernetika 18 (1892), 4, 290-306. | MR

[7] K. Ritter: A variable metric method for linearly constrained minimization problems. In: Nonlinear Programming 3 (O. L. Mangasarian, R. R. Meyer, S. M. Robinson eds.). Academic Press, London 1978. | MR | Zbl

[8] W. Hock K. Schittkowski: Test Examples for Nonlinear Programming Codes. (Lecture Notesin Economics and Mathematical Systems 187.) Springer - Verlag, Berlin-Heidelberg-New York 1981. | MR