scientific article; zbMATH DE number 3637739
From MaRDI portal
Publication:4198634
zbMATH Open0409.94030MaRDI QIDQ4198634
Publication date: 1978
Full work available at URL: https://eudml.org/doc/69169
Title of this publication is not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- Computational complexity of norm-maximization 👍 👎
- Gradient methods with regularization for constrained optimization problems and their complexity estimates 👍 👎
- On the Complexity of Value Iteration 👍 👎
- Evaluation Complexity of Algorithms for Nonconvex Optimization: Theory, Computation and Perspectives 👍 👎
- Complexity of gradient descent for multiobjective optimization 👍 👎
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimization 👍 👎
- Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization 👍 👎
- On the complexity of calculation of differentials and gradients 👍 👎
- An elementary approach to tight worst case complexity analysis of gradient based methods 👍 👎
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)
