scientific article; zbMATH DE number 3637739
From MaRDI portal
Publication:4198634
zbMATH Open0409.94030MaRDI QIDQ4198634FDOQ4198634
Authors: S. E. Kuznetsov 
Publication date: 1978
Full work available at URL: https://eudml.org/doc/69169
Title of this publication is not available (Why is that?)
Recommendations
- On the complexity of the gradient of a rational function
- On the Complexity of Value Iteration
- On the complexity of calculation of differentials and gradients
- Complexity of gradient descent for multiobjective optimization
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization
- An elementary approach to tight worst case complexity analysis of gradient based methods
- Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
- Gradient methods with regularization for constrained optimization problems and their complexity estimates
- Computational complexity of norm-maximization
- Iteration complexity of a block coordinate gradient descent method for convex optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198634)
