Two Algorithms for LC1 Unconstrained Optimization
Abstract
In this paper we present two algorithms for $LC^1$ unconstrained optimization problems which use the second order Dini upper directional derivative. These methods are simple and easy to perform. We discuss the related properties of the iteration function, and establish the global and superlinear convergence of our methods.
About this article
Abstract View
- 170
Pdf View
- 39
How to Cite
Two Algorithms for LC1 Unconstrained Optimization. (2021). Journal of Computational Mathematics, 18(6), 621-632. https://global-sci.com/index.php/JCM/article/view/11396