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...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/27578/1/ID%2027578.pdf |