Hostname: page-component-cb9f654ff-kl2l2 Total loading time: 0 Render date: 2025-08-29T07:32:21.265Z Has data issue: false hasContentIssue false
  • English
  • Français

Concise representation of generalised gradients

Published online by Cambridge University Press:  17 February 2009

M. R. Osborne ,
S. A. Pruess  and
R. S. Womersley
M. R. Osborne
Affiliation:
Department of Statistics, IAS, Australian National University, Canberra 2601
S. A. Pruess
Affiliation:
Department of Mathematics and Statistics, University of New Maxico
R. S. Womersley
Affiliation:
School of Mathematics, Univ. of New South Wales, Kennington 2033
Rights & Permissions [Opens in a new window]

Extract

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.

Computing the generalised gradient directly using its standard definition can involve forming the convex hull of a very large number of vectors. Here an alternative concise parametrization is developed for the generalised gradient of the signed rank regression family of objective functions, a class of piecewise linear functions which includes both convex and nonconvex members. The approach uses the geometry of the epigraph explicitly and this suggests extensions to more general functions. A nondegeneracy condition is assumed which is natural in optimization problems.

Information

Type
Research Article
Information
The ANZIAM Journal , Volume 28 , Issue 1 , July 1986 , pp. 57 - 74
Copyright
Copyright © Australian Mathematical Society 1986

References

[1]Balinski, M. L. and Wolfe, P., Nondifferentiable optimization, Math. Programming Stud. 3 (North Holland, 1975).Google Scholar
[2]Clark, D. I. and Osborne, M. R., “A descent algorithm for minimizing polyhedral convex functions,” SIAM J. Sci. Statist. Comput. 4 (1983), 757–786.CrossRefGoogle Scholar
[3]Clarke, F. H., Optimisation and nonsmooth analysis (Wiley, New York, 1983).Google Scholar
[4]Fletcher, R., Practical methods of optimisation, 2 (Wiley, Chichester, 1981).Google Scholar
[5]Huber, P. J., Robust statistics (Wiley, New York, 1981).CrossRefGoogle Scholar
[6]Osborne, M. R., Finite algorithms in oprimisation and data analysis (Wiley, Chichester, 1985).Google Scholar
[7]Randles, R. H. and Wolfe, D. A., Introduction to the theory of nonparametric statistics (Wiley, New York, 1979).Google Scholar
[8]Rockafellar, R. T., Convex analysis (Princeton University Press, 1970).CrossRefGoogle Scholar
[9]Rockafellar, R. T., The theory of subgradients and its application to problems of optimization: Convex and non convex functions (Heldermann-Verlag, Berlin, 1981).Google Scholar
[10]Womersley, R. S., “Optimality conditions for piecewise smooth functions”, Math. Programming Stud. 17 (1982), 13–27.CrossRefGoogle Scholar
[11]Womersley, R. S., “Local properties of algorithms for minimizing nonsmooth composite functions”, Math. Programming 32 (1985), 69–89.CrossRefGoogle Scholar
[12]Womersley, R. S., “Censored discrete l1 approximation”, SIAM J. Sci. Statist. Comput., to appear.Google Scholar