Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
From MaRDI portal
Recommendations
- Inexact subgradient methods for quasi-convex optimization problems
- Efficiency of inexact fixed point quasiconvex subgradient method
- Convergence of inexact quasisubgradient methods with extrapolation
- Evaluation of fixed point quasiconvex subgradient method with computational inexactness
- Convergence and efficiency of subgradient methods for quasiconvex minimization
Cites work
- Accelerated methods for weakly-quasi-convex optimization problems
- First-order methods of smooth convex optimization with inexact oracle
- Gradient descent learns linear dynamical systems
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
- Smooth Optimization with Approximate Gradient
Cited in
(5)- Convergence of inexact quasisubgradient methods with extrapolation
- Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
- Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter
- Accelerated methods for weakly-quasi-convex optimization problems
- Sequential Subspace Optimization for Quasar-Convex Optimization Problems with Inexact Gradient
This page was built for publication: Sequential subspace optimization for quasar-convex optimization problems with inexact gradient
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054156)