A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q370138 |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:12, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decomposition algorithm for convex nondifferentiable minimization with errors |
scientific article |
Statements
A decomposition algorithm for convex nondifferentiable minimization with errors (English)
0 references
4 April 2012
0 references
Summary: 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.
0 references
