A class of problems for which cyclic relaxation converges linearly
From MaRDI portal
(Redirected from Publication:732240)
Recommendations
- scientific article; zbMATH DE number 5669891
- Publication:4867024
- A linearized relaxing algorithm for the specific nonlinear optimization problem
- Relaxation methods for solving linear inequality systems: converging results
- A convergent relaxation of the Douglas-Rachford algorithm
- Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- scientific article; zbMATH DE number 1300235
- On one class of iterational methods for solving problems of convex programming
- scientific article; zbMATH DE number 3892945
Cites work
- scientific article; zbMATH DE number 417962 (Why is no real title available?)
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 3892490 (Why is no real title available?)
- scientific article; zbMATH DE number 5051694 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Minimization of unsmooth functionals
- On the convergence of the coordinate descent method for convex differentiable minimization
This page was built for publication: A class of problems for which cyclic relaxation converges linearly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732240)