Skip to main content
Log in

A method of truncated codifferential with application to some problems of cluster analysis

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

A method of truncated codifferential descent for minimizing continuously codifferentiable functions is suggested. The convergence of the method is studied. Results of numerical experiments are presented. Application of the suggested method for the solution of some problems of cluster analysis are discussed. In numerical experiments Wisconsin Diagnostic Breast Cancer database was used.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Andramonov, M. Yu., Rubinov, A.M. and Glover, B. M. (1999), Cutting angle methods in global optimization, Applied Mathematics Letters 12: 95–100.

    Google Scholar 

  • Armijo, L. (1966), Minimization of functions having continuous partial derivatives, Pacific J. Math. 16: 1–13.

    Google Scholar 

  • Bagirov, A.M. (2000), Numerical methods for minimizing quasidifferentiable functions: a survey and comparison, In: Quasidifferentiability and Related Topics, Demyanov, V.F. and Rubinov, A.M. (eds.), Ser.: Nonconvex Optimization and Its Applications, Vol. 43, 33–71, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  • Bagirov, A.M. and Rubinov, A.M. (2000), Global minimization of increasing positively homogeneous functions over the unit simplex, Annals of Operations Research 98: 171–187.

    Google Scholar 

  • Bagirov, A.M., Rubinov, A. M., Stranieri, A. and Yearwood, J. (1999), The global optimization approach to the clustering analysis, Research Report 45/99, University of Ballarat, Australia.

    Google Scholar 

  • Demyanov, V.F., Gamidov, S. and Sivelina, T.I. (1986), An algorithm for minimizing a certain class of quasidifferentiable functions, Math. Program. Study 29: 74–85.

    Google Scholar 

  • Demyanov, V.F. and Rubinov, A.M. (1990), Foundations of Nonsmooth Analysis and Quasidifferential Calculus, Nauka, Moscow (in Russian)

    Google Scholar 

  • Demyanov, V.F. and Rubinov, A.M. (1995), Constructive Nonsmooth Analysis, Springer, Frankfurt am Main.

    Google Scholar 

  • Demyanov, V.F., Stavroulakis, G.E., Polyakova, L.N. and Panagiotopoulos, P.D. (1996), Quasidifferentiability and Nonsmooth Modelling in Mechanics, Engineering and Economics, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  • Hiriart-Urruty, J.-B. (1989), From convex optimization to nonconvex optimization. Necessary and sufficient conditions for global optimality, In: Clarke F.H., Demyanov V.F. and Gianessi F. (eds.), Nonsmooth Optimization and Related Topics,Plenum Publ., New York, 219-239.

    Google Scholar 

  • Hiriart-Urruty, J.B. and Lemarechal, C. (1993a), Convex Analysis and Minimization Algorithms, Springer, Heidelberg, Vol. 1.

    Google Scholar 

  • Hiriart-Urruty, J.B. and Lemarechal, C. (1993b), Convex Analysis and Minimization Algorithms, Springer, New York, Vol. 2.

    Google Scholar 

  • Kiwiel, K.C. (1986), A linearization method for minimizing certain quasidifferentiable functions, Math. Program. Study29: 86–94.

    Google Scholar 

  • Mangasarian, O.L. (1997), Mathematical programming in data mining, Data Mining and Knowledge Discovery 1: 183–201.

    Google Scholar 

  • Mangasarian, O.L., Street, W.N. and Wolberg, W.H. (1995), Breast cancer diagnosis and prognosis via linear programming, Operations Research 43(4): 570–577.

    Google Scholar 

  • Polak, E., Mayne, D.Q. and Wardi, Y. (1983), On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems, SIAM J. Control and Optimization 21(2): 179–203.

    Google Scholar 

  • Polak, E. and Mayne, D.Q. (1985), Algorithm models for nondifferentiable optimization, SIAM J. Control and Optimization 23(3): 477–491.

    Google Scholar 

  • Tuy, H., (1998), Convex Analysis and Global Optimization, Kluwer Academic Publishers, Dordrecht.

    Google Scholar 

  • Wolberg, W.H., Street, W.N. and Mangasarian, O.L. (1994), Machine learning techniques to diagnose breast cancer from fine-needle aspirates, Cancer Letters 77: 163–171.

    Google Scholar 

  • Wolberg, W.H., Street, W.N. and Mangasarian, O.L. (1995a), Image analysis and machine learning applied to breast cancer diagnosis and prognosis, Analytical and Quantitative Cytology and Histology 17(2): 77–87.

    Google Scholar 

  • Wolberg, W.H., Street, W.N., Heisey, D.M. and Mangasarian, O.L. (1995b), Computerized breast cancer diagnosis and prognosis from fine needle aspirates, Archives of Surgery 130: 511–516.

    Google Scholar 

  • Wolberg, W.H., Street, W.N., Heisey, D.M. and Mangasarian, O.L. (1995c), Computer-derived nuclear features distinguish malignant from benign breast cytology, Human Pathology 26: 792–796.

    Google Scholar 

  • Wolfe, P.H. (1976), Finding the nearest point in a polytope. Math. Programm. 11(2): 128–149.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Demyanov, V., Bagirov, A. & Rubinov, A. A method of truncated codifferential with application to some problems of cluster analysis. Journal of Global Optimization 23, 63–80 (2002). https://doi.org/10.1023/A:1014075113874

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014075113874

Navigation