Skip to main content
SpringerLink
Log in

A New View of Some Fundamental Results in Optimization

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

Some fundamental optimization results are proved in new ways, which are not traditional and provide a new view of well-known results. Constructions of \(p\)-regularity theory are used to justify the facts under consideration, and the 2-factor method is applied to solve singular problems.

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. A. D. Ioffe and V. M. Tikhomirov, Theory of Extremal Problems (Nauka, Moscow, 1974; Elsevier, Amsterdam, 1978).

  2. D. P. Bertsekas, Nonlinear Programming (Athena Scientific, Belmont, Mass. 1999), pp. 191–276.

    MATH  Google Scholar 

  3. S. A. Ashmanov and A. V. Timokhov, Optimization Theory in Problems and Exercises (Fizmatlit, Moscow, 1991) [in Russian].

    MATH  Google Scholar 

  4. Yu. G. Evtushenko, Methods for Solving Optimization Problems and Their Applications in Optimization Systems (Nauka, Moscow, 1982) [in Russian].

    MATH  Google Scholar 

  5. B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).

  6. Yu. G. Evtushenko and A. A. Tret’yakov, “Pth-order approximation of the solution set of nonlinear equations,” Comput. Math. Math. Phys. 53 (12), 1763–1780 (2013).

    Article  MathSciNet  Google Scholar 

  7. K. N. Belash and A. A. Tret’yakov, “Methods for solving degenerate problems,” USSR Comput. Math. Math. Phys. 28 (4), 90–94 (1988).

    Article  MathSciNet  Google Scholar 

  8. O. A. Brezhneva and A. A. Tret’yakov, “The p-factor-Lagrange methods for degenerate nonlinear programming,” Numer. Funct. Anal. Optim. 28 (9–10), 1051–1086 (2007).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnitsyn Computing Centre, Federal Research Center “Computer Science and Control,” Russian Academy of Sciences, 119333, Moscow, Russia

    Yu. G. Evtushenko & A. A. Tret’yakov

  2. Moscow Institute of Physics and Technology (National Research University), 141700, Dolgoprudnyi, Moscow oblast, Russia

    Yu. G. Evtushenko

  3. Moscow Aviation Institute (National Research University), 125080, Moscow, Russia

    Yu. G. Evtushenko

  4. System Research Institute, Polish Academy of Sciences, 01-447, Warsaw, Poland

    A. A. Tret’yakov

  5. Faculty of Sciences, Siedlce University, 08-110, Siedlce, Poland

    A. A. Tret’yakov

Authors
  1. Yu. G. Evtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Tret’yakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yu. G. Evtushenko or A. A. Tret’yakov.

Additional information

Translated by N. Berestova

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Evtushenko, Y.G., Tret’yakov, A.A. A New View of Some Fundamental Results in Optimization. Comput. Math. and Math. Phys. 60, 1412–1421 (2020). https://doi.org/10.1134/S0965542520090080

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords:

Search

Navigation