Abstract
It is known that many optimization problems can be reformulated as composite optimization problems. In this paper error analyses are provided for two kinds of smoothing approximation methods of a unconstrained composite nondifferentiable optimization problem. Computational results are presented for nondifferentiable optimization problems by using these smoothing approximation methods. Comparisons are made among these methods.
| Original language | English |
|---|---|
| Pages (from-to) | 194-200 |
| Number of pages | 7 |
| Journal | Journal of the Australian Mathematical Society Series B-Applied Mathematics |
| Volume | 38 |
| Issue number | 2 |
| Publication status | Published - 1 Oct 1996 |
| Externally published | Yes |
ASJC Scopus subject areas
- Applied Mathematics