An algorithm for LC1 optimization

Authors

  • Nada I. Đuranović-Miličić University of Belgrade - Faculty of Technology and Metallurgy - Department of Mathematics, Belgrade, Yugoslavia

DOI:

https://doi.org/10.2298/YJOR0502301D

Keywords:

directional derivative, second order Dini upper directional derivative, uniformly convex functions

Abstract

In this paper an algorithm for LC1 unconstrained optimization problems, which uses the second order Dini upper directional derivative is considered. The purpose of the paper is to establish general algorithm hypotheses under which convergence occurs to optimal points. A convergence proof is given, as well as an estimate of the rate of convergence.

References

Goldfarb, D. (1980) Curvilinear path step length algorithms for minimization with directions of negative curvature. Mathematical Programming, 18, 31-40

Karmanov, V.G. (1975) Matematiceskoe Programirovanie. Moskva: Nauka

Polak, E. (1974) Cislennie metodi optimizacii: Edinij podhod. Moskva: Mir, translation from English

Sun, W., de Sampaio, R.J.B., Yuan, J. (2000) Two algorithms for LC1 unconstrained optimization. J Comput Math, 18, 621-632

Vujčić, V., Ašić, M., Đuranović-Miličić, N. (1980) Mathematical programming. Belgrade: Institute of Mathematics

Downloads

Published

2005-09-01

Issue

Vol. 15 No. 2 (2005)

Section

Research Articles

License

Copyright (c) YUJOR

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.