Title of article
An approximate decomposition algorithm for convex minimization
Author/Authors
Lu، نويسنده , , Yuan-Ping Pang، نويسنده , , Li-Ping and Liang، نويسنده , , Xi-Jun and Xia، نويسنده , , Zun-Quan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
9
From page
658
To page
666
Abstract
For nonsmooth convex optimization, Robert Mifflin and Claudia Sagastizábal introduce a V U -space decomposition algorithm in Mifflin and Sagastizábal (2005) [11]. An attractive property of this algorithm is that if a primal–dual track exists, this algorithm uses a bundle subroutine. With the inclusion of a simple line search, it is proved to be globally and superlinearly convergent. However, a drawback is that it needs the exact subgradients of the objective function, which is expensive to compute. In this paper an approximate decomposition algorithm based on proximal bundle-type method is introduced that is capable to deal with approximate subgradients. It is shown that the sequence of iterates generated by the resulting algorithm converges to the optimal solutions of the problem. Numerical tests emphasize the theoretical findings.
Keywords
Proximal bundle method , Smooth path , Nonsmooth convex optimization , Approximate U -Lagrangian , V U -decomposition
Journal title
Journal of Computational and Applied Mathematics
Serial Year
2010
Journal title
Journal of Computational and Applied Mathematics
Record number
1555659
Link To Document