Skip to main content
SpringerLink
Log in

Direct-dual Fejér methods for problems of quadratic programming

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

The paper deals with the S-technology, which reduces convex problems of quadratic programming to the solution of systems of several linear, and one convex, inequalities. A certain variant of the Fejér method is applied to these systems. In particular, the problem of the constructive separability of convex polyhedral sets by a layer of maximal thickness is solved. This algorithm plays an important role in problems of discriminant analysis.

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. I. I. Eremin and N. N. Astaf’ev, Introduction to the Theory of Linear and Conver Programming (Nauka, Moscow, 1976) [in Russian].

    Google Scholar 

  2. I. I. Eremin and V. D. Mazurov, Nonstationary Processes of Mathematical Programming (Nauka, Moscow, 1979) [in Russian].

    Google Scholar 

  3. E. A. Berdnikova, I. I. Eremin, and L. D. Popov, Avtomatika Telemekhanika, No. 2, 16 (2004).

  4. I. I. Eremin, Theory of Linear Optimization (Izd. Ekaterinburg, Ekaterinburg, 1999) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, ul. S. Kovalevskoi 16, Ekaterinburg, 620219, Russia

    I. I. Eremin

Authors
  1. I. I. Eremin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © I.I. Eremin, 2006, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2006, Vol. 12, No. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Eremin, I.I. Direct-dual Fejér methods for problems of quadratic programming. Proc. Steklov Inst. Math. 253 (Suppl 1), S83–S95 (2006). https://doi.org/10.1134/S0081543806050075

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543806050075

Keywords

Search

Navigation