A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors

Yuan Lu, Li-Ping Pang, Jie Shen and Xi-Jun Liang

Journal of Applied Mathematics, 2012, vol. 2012, issue 1

Abstract: A decomposition algorithm based on proximal bundle‐type method with inexact data is presented for minimizing an unconstrained nonsmooth convex function f. At each iteration, only the approximate evaluation of f and its approximate subgradients are required which make the algorithm easier to implement. It is shown that every cluster of the sequence of iterates generated by the proposed algorithm is an exact solution of the unconstrained minimization problem. Numerical tests emphasize the theoretical findings.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/215160

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnljam:v:2012:y:2012:i:1:n:215160

Access Statistics for this article

More articles in Journal of Applied Mathematics from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().