Non‐Monotone Space Decomposition Methods for Minimization Problems

Parallel space decomposition methods for the numerical treatment of unconstrained minimization problems are presented. For a special case of these methods described in 1] we extend classical line search methods for subspace optimization by non‐monotone strategies of 2]. For the convergence theory the concept of a generalized minimizing sequence is introduced in extension of a concept in 3].