A superlinearly convergent algorithm for minimization without evaluating derivatives-Reference-Cited by-同舟云学术

A superlinearly convergent algorithm for minimization without evaluating derivatives

Published:1975-12 Issue:1 Volume:9 Page:100-117
ISSN:0025-5610
Container-title:Mathematical Programming
language:en
Short-container-title:Mathematical Programming

Author:

Mifflin Robert

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics,Software

Link

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

Reference24 articles.

1. L. Armijo, “Minimization of functionals having Lipschitz continuous first partial derivatives”,Pacific Journal of Mathematics 16 (1966) 1–3.

2. R.P. Brent,Algorithms for minimization without derivatives (Prentice-Hall, Englewood Cliffs, N.J., 1972).

3. F.L. Chernous'ko, “A local variation method for the numerical solution of variational problems”,Žurnal Vyčslitel'noį Matematiki i Matematičeskoį Fiziki 5 (1965) 749–754 [in Russian; English transl.:U.S.S.R. Computational Mathematics and Mathematical Physics 5 (1965) 234–2421.

4. J. Cullum, “Unconstrained minimization of functions without explicit use of their derivatives”, IBM Watson Research Center, Yorktown Heights, N.Y. (1971).

5. J.W. Daniel,The approximate minimization of functionals (Prentice-Hall, Englewood Cliffs, N.J., 1971).

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

1. Introduction;SpringerBriefs in Optimization;2021

2. A Discussion on Variational Analysis in Derivative-Free Optimization;Set-Valued and Variational Analysis;2020-09-25

3. Model-Based Methods in Derivative-Free Nonsmooth Optimization;Numerical Nonsmooth Optimization;2020

4. Derivative-free optimization methods;Acta Numerica;2019-05-01

5. A second-order globally convergent direct-search method and its worst-case complexity;Optimization;2015-12-29