A Generalization of the Karush–Kuhn–Tucker Theorem for Approximate Solutions of Mathematical Programming Problems Based on Quadratic Approximation

  • V. V. Voloshinov


In computations related to mathematical programming problems, one often has to consider approximate, rather than exact, solutions satisfying the constraints of the problem and the optimality criterion with a certain error. For determining stopping rules for iterative procedures, in the stability analysis of solutions with respect to errors in the initial data, etc., a justified characteristic of such solutions that is independent of the numerical method used to obtain them is needed. A necessary δ-optimality condition in the smooth mathematical programming problem that generalizes the Karush–Kuhn–Tucker theorem for the case of approximate solutions is obtained. The Lagrange multipliers corresponding to the approximate solution are determined by solving an approximating quadratic programming problem.


approximate solutions mathematical programming Karush–Kuhn–Tucker theorem quadratic programming 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Karush, “Minima of functions of several variables with inequalities as side conditions” (dissertation, 1939) in Traces and Emergence of Nonlinear Programming (Springer, 2014), pp. 217–245.CrossRefGoogle Scholar
  2. 2.
    E. G. Gol’shtein, Duality Theory in Mathematical Programming and Its Applications (Nauka, Moscow, 1971) [in Russian].Google Scholar
  3. 3.
    J. Warga, Optimal Control of Differential and Functional Equations (Academic, New York, 1972.zbMATHGoogle Scholar
  4. 4.
    B. T. Polyak, Introduction to Optimization (Nauka, Moscow, 1983; Optimization Software, New York, 1987).zbMATHGoogle Scholar
  5. 5.
    Yu. G. Evtushenko, Optimization and Fast Automatic Differentiation (Vychisl. Tsentr, Ross. Akad. Nauk, Moscow, 2013) [in Russian].Google Scholar
  6. 6.
    G. Giorgi and T. H. Kjeldsen, “A historical view of nonlinear programming: Traces and emergence,” in Traces and Emergence of Nonlinear Programming (Springer, 2014), pp. 1–43.CrossRefGoogle Scholar
  7. 7.
    Encyclopedia of Optimization, 2nd ed., Ed. by C. A. Floudas and P. M. Pardalos (Springer, 2009).zbMATHGoogle Scholar
  8. 8.
    Yu. G. Evtushenko, Methods for Solving Extremum Value Problems and Their Application in Optimization Systems (Nauka, Moscow, 1982) [in Russian].zbMATHGoogle Scholar
  9. 9.
    L. I. Minchenko and S. M. Stakhovskii, “On regularity conditions in mathematical programming problems,” Dokl. Nats. Akad. Nauk Belarusi 53 (5), 26–31 (2009).MathSciNetzbMATHGoogle Scholar
  10. 10.
    A. V. Dmitruk, A. A. Milyutin, and N. P. Osmolovskii, “The Lyusternik theorem and the extremum value theory,” Usp. Mat. Nauk 35 (6), 11–46 (1980).Google Scholar
  11. 11.
    A. J. Hoffman, “On approximate solutions of systems of linear inequalities,” in Selected Papers of Alan J. Hoffman: With Commentary, 2003, pp. 174–176.CrossRefGoogle Scholar
  12. 12.
    E. Belousov, “On the calculation of the exact Lipschita and Hoffman constants for a system of linear inequalities,” Vestn. Tambov Univ., Ser. Estestv. Tekhn. Nauki, 5, 416–417 (2000).Google Scholar
  13. 13.
    C. Zălinescu, “Sharp estimates for Hoffman’s constant for systems of linear inequalities and equalities,” SIAM J. Optim. 14, 517–533 (2003).MathSciNetzbMATHGoogle Scholar
  14. 14.
    E. S. Levitin, A. A. Milyutin, and N. P. Osmolovskii, “Theory of high-order conditions in smooth constrained extremum value problems,” in Theoretical and Applied Issues of Optimal Control (Nauka, Novosibirsk, 1985), pp. 4–40 [in Russian].Google Scholar
  15. 15.
    G. Giorgi and T. H. Kjeldsen, Traces and Emergence of Nonlinear Programming (Springer, 2013).zbMATHGoogle Scholar
  16. 16.
    J. Dutta, K. Deb, R. Tulshyan, and R. Arora, “Approximate KKT points and a proximity measure for termination,” J. Global Optim. 56, 1463–1499 (2013).MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    G. Haeser and M. L. Schuverdt, “On approximate KKT condition and its extension to continuous variational inequalities,” J. Optim. Theor. Appl. 149, 528–539 (2011).MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    M. Minoux, Mathematical Programming: Theory and Algorithms (Wiley, Chichester, 1986.zbMATHGoogle Scholar
  19. 19.
    B, N. Pshenichnyi, Linearization Method (Nauka, Moscow, 1983) [in Russian].zbMATHGoogle Scholar
  20. 20.
    J.-P. Aubin and I. Ekeland, Applied Nonlinear Analysis (Wiley, New York, 1984).zbMATHGoogle Scholar
  21. 21.
    I. Ekeland, “Nonconvex minimization problems,” Amer. Math. Soc. 1, 443–474 (1979).MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    F. H. Clarke, “Nonsmooth analysis and optimization,” in Proc. of the Int. Congress of Mathematicians, Helsinki, 1978, pp. 847–853.Google Scholar
  23. 23.
    F. H. Clarke, “A new approach to Lagrange multipliers,” Math. Oper. Res. 1 (2), 165–174 (1976).MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    A. V. Arutyunov and S. E. Zhukovskiy “On estimates for solutions of systems of convex inequalities,” Comput. Math. Math. Phys. 55, 1444–1450 (2015).MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    V. V. Voloshinov and E. S. Levitin, “Characterization of δ-optimal solutions in mathematical programming problems,” in Proc. of the 11th Int. Baikal Seminar, Irkutsk, 1998, Vol. 1, pp. 69–70.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  1. 1.Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations