A multi -step curve search algorithm in nonlinear optimization

  • N.I. Duranovic-Milicic

Abstract

In this paper a multi-step algorithm for LC1 unconstrained optimization problems is presented. This method uses previous multi-step iterative information and curve search to generate new iterative points. A convergence proof is given, as well as an estimate of the rate of convergence.
Published
2016-10-11
How to Cite
DURANOVIC-MILICIC, N.I.. A multi -step curve search algorithm in nonlinear optimization. Yugoslav Journal of Operations Research, [S.l.], v. 18, n. 1, oct. 2016. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/300>. Date accessed: 05 dec. 2024.
Citation Formats
Issue
Vol 18 No 1 (2008): Vol. 18 No. 1
Section
Articles
Creative Commons License

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

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.