In this report, we propose a new partitioned variable metric method for minimization of nonsmooth partially separable functions. After a short introduction, the complete algorithm is introduced and some implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Computational experiments given confirm efficiency and robustness of the new method.
Report No. V-916, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, March 2005.
View Variable metric method for minimization of partially separable nonsmooth functions.