J Austral Math Soc Ser B 38 pp194--200, 1996.

A comparative study of smoothing approximations

X. Q. Yang

(Received 12 January 1995; revised 13 February 1995)

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.

Browse the article

Read the article in your browser. (Print at 75% on A4 paper).

Author

X. Q. Yang: Department of Mathematics, University of Western Australia, Nedlands,

Editor JAMSB(E): editor at anziamj.austms.org.au
WWW Administrator: webmaster at anziamj.austms.org.au
Last Modified: Mon Dec 10 16:42:46 2001
© Copyright 1997-2004 Australian Mathematical Society