Adaptive algorithms in the parametrized method of centers
The authors consider the problem min\(\{\) f(x): \(x\in {\mathcal D}\}\), where \(x\in H\), H is a Hilbert space, \({\mathcal D}=\{x\in H:\) g(x)\(\leq 0\}\), f and g are convex and limited, \(\overset \circ {\mathcal D}=\{x\in H:\) \(g(x)<0\}\neq \emptyset\). A method is given for solving the problem through minimizing the function \(F(\alpha,\gamma,x)=\max \{\alpha g(x),f(x)-\gamma \}\) with \(\gamma =f(x_ 0)\), \(x_ 0\in {\mathcal D}\), and a corresponding value of \(\alpha >0.\) A proof for the corresponding theorem on the convergence is given.
- 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
- scientific article; zbMATH DE number 3850830
- Algorithms with combination, parametrization, and two-sided approximation in the center method.
- Control of the minimization process in the parametrized method of centers
- Constrained best approximation in Hilbert space. II
- Modification of the parametrized method of centers
- A version of the parameterized method of centers
- Algorithms with combination, parametrization, and two-sided approximation in the center method.
- scientific article; zbMATH DE number 4216030 (Why is no real title available?)
- scientific article; zbMATH DE number 4162676 (Why is no real title available?)
- Some properties of methods 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)
