Asset Details
Do you wish to reserve the book?
On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
Do you wish to request the book?
On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Paper
On Some Versions of Subspace Optimization Methods with Inexact Gradient Information
2024
Overview
It is well-known that accelerated gradient first order methods possess optimal complexity estimates for the class of convex smooth minimization problems. In many practical situations, it makes sense to work with inexact gradients. However, this can lead to the accumulation of corresponding inexactness in the theoretical estimates of the rate of convergence. We propose some modification of the methods for convex optimization with inexact gradient based on the subspace optimization such as Nemirovski's Conjugate Gradients and Sequential Subspace Optimization. We research the method convergence for different condition of inexactness both in gradient value and accuracy of subspace optimization problems. Besides this, we investigate generalization of this result to the class of quasar-convex (weakly-quasi-convex) functions.
Publisher
Cornell University Library, arXiv.org
Subject
