Skip to main content
SpringerLink
Log in

A multipoint method of minimization of a convex function

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The problem of minimization of a convex nonsmooth function in a finite-dimensional space is considered. The method employs the Moreau-Yosida regularization. To accelerate the computation process, the proximate function is constructed using quasi-Newton matrices.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms, Vol. 1, Springer-Verlag, Berlin (1994).

    Google Scholar 

  2. B. T. Polyak, Introduction to Optimization [in Russian], Nauka, Moscow (1983).

    MATH  Google Scholar 

  3. B. N. Pshenichnyi, E. I. Nenakhov, and V. N. Kuz’menko, “Modified cutting plane method for minimization of a convex function,” Kibern. Sist. Anal., No. 6, 142–149 (1997).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    É. I. Nenakhov

Authors
  1. É. I. Nenakhov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 151–153, November–December, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nenakhov, É.I. A multipoint method of minimization of a convex function. Cybern Syst Anal 35, 973–975 (1999). https://doi.org/10.1007/BF02742290

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02742290

Keywords

Search

Navigation