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 l...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!