- On the complexity of the steepest-descent with exact linesearches Coralia Cartis(Coralia.Cartised.ac.uk) Nick Gould(nick.gouldstfc.ac.uk) Philippe Toint(philippe.tointfundp.ac.be) Abstract: The worst-case complexity of the steepest-descent algorithm with exact linesearches for unconstrained smooth optimization is analyzed, and it is shown that the number of iterations of this algorithm which may be necessary to find an iterate at which the norm of the objective function's gradient is less that a prescribed $\epsilon$ is, essentially, a multiple of $1/\epsilon^2$, as is the case for variants of the same algorithms using inexact linesearches. Keywords: complexity, steepest descent, nonlinear optimization Category 1: Nonlinear Optimization (Unconstrained Optimization ) Category 2: Nonlinear Optimization (Nonlinear Systems and Least-Squares ) Citation: Download: [PDF]Entry Submitted: 09/09/2012Entry Accepted: 09/09/2012Entry Last Modified: 09/09/2012Modify/Update this entry Visitors Authors More about us Links Subscribe, Unsubscribe Digest Archive Search, Browse the Repository Submit Update Policies Coordinator's Board Classification Scheme Credits Give us feedback Optimization Journals, Sites, Societies Optimization Online is supported by the Mathematical Optmization Society.