Planar quasi-Newton algorithms for unconstrained saddlepoint problems-Reference-Cited by-同舟云学术

Planar quasi-Newton algorithms for unconstrained saddlepoint problems

Published:1984-06 Issue:2 Volume:43 Page:167-204
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:J Optim Theory Appl

Author:

Oren S. S.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1007/BF00936162.pdf

Reference13 articles.

1. Huang, H. Y.,Unified Approach to Quadratically Convergent Algorithms for Function Minimization, Journal of Optimization Theory and Application, Vol. 5, pp. 405?423, 1970.

2. Fletcher, R.,Conjugage Gradient Methods for Indefinite Systems, Proceedings of the 1975 Dundee Numerical Analysis Conference, Springer-Verlag, Berlin, Germany, pp. 73?89, 1975.

3. Luenberger, D. G.,Hyperbolic Pairs in the Method of Conjugate Gradients, SIAM Journal on Applied Mathematics, Vol. 17, pp. 1263?1267, 1969.

4. Davidon, W. C.,Variable-Metric Methods for Minimization, AEC, Research and Development Report No. ANL-5990 (Revised), 1959.

5. Fletcher, R., andPowell, M. J. D.,A Rapidly Convergent Descent Method for Minimization, Computer Journal, Vol. 6, pp. 163?168, 1963.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming;Computational Optimization and Applications;2017-10-23

2. Optimization Theory and Methods;Springer Optimization and Its Applications;2006

3. A Globally Convergent Version of REQP for Constrained Minimization;IMA Journal of Numerical Analysis;1988