Non-monotone space decomposition methods for minimization problems

DOI10.1002/1617-7061(200203)1:1%3C472::AID-PAMM472%3E3.0.CO;2-3MaRDI QIDQ3510749zbMATH OpenFDO

Authors S. Keesmann, Wolfgang Mönch

Publication date 3 July 2008

Full work available at URL https://doi.org/10.1002/1617-7061(200203)1:1%3C472::AID-PAMM472%3E3.0.CO;2-3

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical mathematical programming methods (65K05)

Recommendations

• Publication:4945814
• A unified approach to parallel space decomposition methods
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• scientific article; zbMATH DE number 1292132
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems

Cited in

(6)

• On the convergence rate of a space decomposition method
• Space-decomposition minimization method for large-scale minimization problems
• A unified convergence framework for nonmonotone inexact decomposition methods
• A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
• scientific article; zbMATH DE number 1424565 (Why is no real title available?)
• Space-decomposition multiplier method for constrained minimization problems

This page was built for publication: Non-monotone space decomposition methods for minimization problems

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