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...
Saved in:
Main Authors: | 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, et al.
出版: (2016) -
A conjugate gradient method with inexact line search for unconstrained optimization
由: Mustafa, Mamat, et al.
出版: (2015) -
Comparison of the AIM conjugate gradient method under exact and inexact line search for solving unconstrained optimization problems
由: Za’aba, Fatin Nadhirah, et al.
出版: (2021) -
A modified conjugate gradient coefficient with inexact line search for unconstrained optimization
由: Mustafa, M., et al.
出版: (2016) -
Scaling strategies for symmetric rank-one method in solving unconstrained optimization problems
由: Mustafa, Mamat, et al.
出版: (2014)