Adaptive algorithms in the parametrized method of centers

DOI10.1007/BF01097199zbMATH Open0704.90100MaRDI QIDQ917455FDOQ917455

Ya. I. Zabotin, E. A. Knyazev

Publication date: 1990

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/198084

zbMATH Keywords

convergenceHilbert spaceparametrized method of centers

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming in abstract spaces (90C48)

Cites Work

• Modification of the parametrized method of centers

Cited In (4)

• Some properties of methods of centers
• Constrained best approximation in Hilbert space. II
• Title not available (Why is that?)
• Algorithms with combination, parametrization, and two-sided approximation in the center method.

   Recommendations

• A version of the parameterized method of centers 👍 👎
• A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space 👍 👎
• Title not available (Why is that?) 👍 👎
• Algorithms with combination, parametrization, and two-sided approximation in the center method. 👍 👎
• Control of the minimization process in the parametrized method of centers 👍 👎

This page was built for publication: Adaptive algorithms in the parametrized method of centers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q917455)