Skip to main content
SpringerLink
Log in

Linearization method for inverse convex programming

  • Systems Analysis
  • Published:
Cybernetics and Systems Analysis Aims and scope

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

References

  1. J. Conway and N. Sloan, Ball Packing, Lattices, and Groups [Russian translation], Mir, Moscow (1990).

    Google Scholar 

  2. B. N. Pshenichnyi, Linearization Method [in Russian], Nauka, Moscow (1983).

    Google Scholar 

  3. B. N. Pshenichnyi, Convex Analysis and Extremal Problems [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  4. N. Z. Shor and S. I. Stetsenko, Quadratic Extremal Problems and Nondifferentiable Optimization [in Russian], Naukova Dumka, Kiev (1989).

    Google Scholar 

  5. L. F. Tot, Locations on a Plane, on a Sphere and in Space [in Russian], Fizmatgiz, Moscow (1958).

    Google Scholar 

  6. B. N. Pshenichnyi, Necessary Conditions of Extremum [in Russian], Nauka, Moscow (1969).

    Google Scholar 

Download references

Authors
  1. B. N. Pshenichnyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. A. Sobolenko
    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. 86–97, November–December, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pshenichnyi, B.N., Sobolenko, L.A. Linearization method for inverse convex programming. Cybern Syst Anal 31, 852–862 (1995). https://doi.org/10.1007/BF02366622

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation