Skip to main content
SpringerLink
Log in

Orthogonalizing linear operators in convex programming. I

  • 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. N. Z. Shor, “Using space dilation operations in problems of minimization of convex functions,” Kibernetika, No. 1, 6–12 (1970).

  2. W. C. Davidon, “Variable metric methods for minimization,” AEC Res. Develop. Rep. ANL 5990 (Rev.) (1959).

  3. R. Fletcher and M. J. D. Powell, “A rapidly convergent descent method for minimization,” Comput. J.,6, No. 2, 163–168 (1963).

    MATH  MathSciNet  Google Scholar 

  4. B. N. Pshenichnyi and Yu. M. Danilin, Numerical Methods in Extremal Problems [in Russian], Nauka, Moscow (1975).

    Google Scholar 

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

    Google Scholar 

  6. N. Z. Shor, Minimization Methods for Nondifferentiable Functions and Their Applications [in Russian], Naukova Dumka, Kiev (1979).

    Google Scholar 

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

    Google Scholar 

  8. P. I. Stetsyuk, “r-Algorithms and Ellipsoids,” Kibern. Sist. Anal., No. 1, 113–134 (1996).

  9. P. I. Stetsyuk, “Method of centroids of simple bodies,” Kibern. Sist. Anal., No. 5, 117–138 (1996).

  10. S. Agmon, “The relaxation method for linear inequalities,” Can. J. Math.,6, 382–392 (1954).

    MATH  MathSciNet  Google Scholar 

  11. T. Motzkin and I. J. Schoenberg, “The relaxation method for linear inequalities,” Can. J. Math.,6, 393–404 (1954).

    MATH  MathSciNet  Google Scholar 

  12. B. T. Polyak, “Minimization of nonsmooth functionals,” Zh. Vychisl. Matem. Mat. Fiz.,9, No. 3, 507–521 (1965).

    Google Scholar 

  13. M. B. Shchepakin, “Orthogonal descent method,” Kibernetika, No. 1, 58–62 (1987).

  14. V. S. Skokov and M. B. Shchepakin, “Numerical analysis of the orthogonal descent method,” Kibern. Sist. Anal., No. 2, 139–149 (1994).

  15. M. B. Shchepakin and I. A. Shubenkova, "Investigation of the modified orthogonal descent method to find the zero of a convex function," Kibern. Sist. Anal., No. 4, 63–72 (1993).

  16. P. Camerini, L. Fratta, and F. Maffioli, “On improving relaxation methods by modified gradient techniques,” Math. Progr., Study3, 26–34 (1975).

    MathSciNet  Google Scholar 

Download references

Authors
  1. P. I. Stetsyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 97–119, May–June, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stetsyuk, P.I. Orthogonalizing linear operators in convex programming. I. Cybern Syst Anal 33, 386–401 (1997). https://doi.org/10.1007/BF02733072

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation