Article contents
A comparative study of smoothing approximations
Published online by Cambridge University Press: 17 February 2009
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1996
References
- 1
- Cited by