On a second-order step-size algorithm

  • N.I. Djuranovic-Milicic

Abstract

In this paper we present a modification of the second-order step-size algorithm. This modification is based on the so called forcing functions. It is proved that this modified algorithm is well-defined. It is also proved that every point of accumulation of the sequence generated by this algorithm is a second-order point of the nonlinear programming problem. Two different convergence proofs are given having in mind two interpretations of the presented algorithm.
Published
2016-10-11
How to Cite
DJURANOVIC-MILICIC, N.I.. On a second-order step-size algorithm. Yugoslav Journal of Operations Research, [S.l.], v. 12, n. 1, oct. 2016. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/185>. Date accessed: 14 apr. 2025.
Citation Formats
Issue
Vol 12 No 1 (2002): Vol. 12 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.