A new inexact line search method for convex optimization problems
In general one can say that line search procedure for the steplength and search direction are two important elements of a line search algorithm. The line search procedure requires much attention because of its far implications on the robustness and efficiency of the algorithm. The purpose of this pa...
保存先:
主要な著者: | Moyi, Aliyu Usman, Leong, Wah June |
---|---|
フォーマット: | Conference or Workshop Item |
言語: | English |
出版事項: |
2013
|
オンライン・アクセス: | http://psasir.upm.edu.my/id/eprint/27578/1/ID%2027578.pdf http://psasir.upm.edu.my/id/eprint/27578/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
著者:: Moyi, Aliyu Usman, 等
出版事項: (2016) -
A conjugate gradient method with inexact line search for unconstrained optimization
著者:: Mustafa, Mamat, 等
出版事項: (2015) -
Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
著者:: Za’aba, Fatin Nadhirah, 等
出版事項: (2021) -
A modified conjugate gradient coefficient with inexact line search for unconstrained optimization
著者:: Mustafa, M., 等
出版事項: (2016) -
Scaling strategies for symmetric rank-one method in solving unconstrained optimization problems
著者:: Mustafa, Mamat, 等
出版事項: (2014)