Premium
Non‐Monotone Space Decomposition Methods for Minimization Problems
Author(s) -
Keesmann S.,
Mönch W.
Publication year - 2002
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/1617-7061(200203)1:1<472::aid-pamm472>3.0.co;2-3
Subject(s) - monotone polygon , subspace topology , sequence (biology) , mathematical optimization , convergence (economics) , minification , mathematics , extension (predicate logic) , space (punctuation) , decomposition method (queueing theory) , decomposition , line search , computer science , algorithm , discrete mathematics , path (computing) , mathematical analysis , ecology , geometry , biology , operating system , genetics , economics , programming language , economic growth
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].