![](/images/graphics-bg.png)
A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors
Joint Authors
Lu, Yuan
Shen, Jie
Liang, Xi-Jun
Pang, Li-Ping
Source
Journal of Applied Mathematics
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-15, 15 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-12-22
Country of Publication
Egypt
No. of Pages
15
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Lu, Yuan& Pang, Li-Ping& Shen, Jie& Liang, Xi-Jun. 2011. A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors. Journal of Applied Mathematics،Vol. 2012, no. 2012, pp.1-15.
https://search.emarefa.net/detail/BIM-1028765
Modern Language Association (MLA)
Lu, Yuan…[et al.]. A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors. Journal of Applied Mathematics No. 2012 (2012), pp.1-15.
https://search.emarefa.net/detail/BIM-1028765
American Medical Association (AMA)
Lu, Yuan& Pang, Li-Ping& Shen, Jie& Liang, Xi-Jun. A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors. Journal of Applied Mathematics. 2011. Vol. 2012, no. 2012, pp.1-15.
https://search.emarefa.net/detail/BIM-1028765
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1028765