A class of problems for which cyclic relaxation converges linearly

DOI10.1007/S10589-007-9094-0zbMath1180.90320OpenAlexW2056481263MaRDI QIDQ732240

Christian Szegedy, Dieter Rautenbach

Publication date: 9 October 2009

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9094-0

zbMATH Keywords

linear convergencecoordinate relaxationcyclic relaxationmethod of alternating variables

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• On the convergence of the coordinate descent method for convex differentiable minimization
• Minimization of unsmooth functionals
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of problems for which cyclic relaxation converges linearly