Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-12T06:17:51.959Z Has data issue: false hasContentIssue false
  • English
  • Français

A comparative study of smoothing approximations

Published online by Cambridge University Press:  17 February 2009

X. Q. Yang
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 38 , Issue 2 , October 1996, pp. 194 - 200
Copyright
Copyright © Australian Mathematical Society 1996

References

[1]Ben-Tal, A. and Teboulle, M., “A smoothing technique for nondifferentiable optimization problems”, in Optimization - Fifth French-German Conference (ed. Dolecki, S.), Volume 1405 of Lecture Notes in Math., (Springer, New York, 1989) 1–13.Google Scholar
[2]Ben-Tal, A., Teboulle, M. and Yang, W. H., “A least-square method for a class of nonsmooth minimization problems with applications in plasticity”, Applied Math. Optimiz. 24 (1991) 272–288.CrossRefGoogle Scholar
[3]Bertsekas, D. P., “Nondifferentiable optimization via approximation”, Math. Prog. Study 3 (1975) 1–25.CrossRefGoogle Scholar
[4]El-Attar, R. A., Vidyasagar, M. and Dutta, R. K., “An algorithm for l1-norm minimization with application to nonlinear l 1 approximation”, SIAM J. Numer. Anal. 16 (1979) 70–86.CrossRefGoogle Scholar
[5]Fletcher, R., Practical Methods of Optimization (John Wiley, New York, 1987).Google Scholar
[6]Jennings, L. S. and Teo, K. L., “A computational algorithm for functional inequality constrained optimization problem”, Automatica 26 (1990) 371–375.CrossRefGoogle Scholar
[7]Teo, K. L. and Goh, C. J., “On constrained optimization problems with nonsmooth cost functionals”, Applied Math. Optimiz. 18 (1988) 181–190.CrossRefGoogle Scholar
[8]Teo, K. L., Rehbock, V. and Jennings, L. S., “A new computational algorithm for functional inequality constrained optimization problems”, Automatica 29 (1993) 789–792.CrossRefGoogle Scholar
[9]Yang, X. Q., “Smoothing approximations to nonsmooth optimization problems”, J. Austral. Math. Soc, Series B 36 (1994) 1–13.Google Scholar