Optimal methods of smooth convex minimization. (English. Russian original) Zbl 0591.90072
U.S.S.R. Comput. Math. Math. Phys. 25, No. 2, 21-30 (1985); translation from Zh. Vychisl. Mat. Mat. Fiz. 25, No. 3, 356-369 (1985).
Summary: Convergence-rate-optimal methods are constructed for minimizing a smooth convex function with respect to type \(L_ p\) Banach space, and the superposition of a convex scalar and convex vector-function with respect to a convex subset of Hilbert space.
MSC:
| 90C25 | Convex programming |
| 90C48 | Programming in abstract spaces |
| 65K05 | Numerical mathematical programming methods |
