Skip to main content
SpringerLink
Log in

A Minmax Bound on the Position of the Plane Tangent to the Constraints in an Optimization Problem

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

Abstract

The properties of the angle between subspaces are discussed. A minmax bound is obtained for the angle between the tangent plane and the coordinate plane.

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. E. Polak, Numerical Methods in Optimization [Russian translation], Mir, Moscow (1974).

    Google Scholar 

  2. A. G. Sukharev, A. V. Timokhov, and V. V. Fedorov, A Course in Optimization Methods [in Russian], Nauka, Moscow (1986).

    Google Scholar 

  3. J. Golub and C. Van Loun, Matrix Computations [Russian translation], Mir, Moscow (1999).

    Google Scholar 

  4. P. Lancaster, Matrix Theory [in Russian], Nauka, Moscow (1978).

    Google Scholar 

  5. V. A. Il'in and G. D. Kim, Linear Algebra and Analytical Geometry [in Russian], MGU, Moscow (1998).

    Google Scholar 

Download references

Authors
  1. S. V. Panferov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Panferov, S.V. A Minmax Bound on the Position of the Plane Tangent to the Constraints in an Optimization Problem. Computational Mathematics and Modeling 13, 327–332 (2002). https://doi.org/10.1023/A:1016066318126

Download citation

  • Issue Date:

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

Keywords

Search

Navigation