Skip to main content
Log in

On estimates for solutions of systems of convex inequalities

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

Abstract

The distance from a given point to the solution set of a system of strict and nonstrict inequalities described by convex functions is estimated. As consequences, estimates for the distance from a given point to the Lebesgue set of a convex function are obtained and sufficient conditions for convex-valued set-valued mappings to be covering are established.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. P. Vasil’ev and A. Yu. Ivanitskii, Linear Programming (Faktorial, Moscow, 1998) [in Russian].

    Google Scholar 

  2. V. M. Alekseev, V. M. Tikhomirov, and S. V. Fomin, Optimal Control (Nauka, Moscow, 1979) [in Russian].

    Google Scholar 

  3. A. F. Izmailov and M. V. Solodov, Numerical Optimization Methods (Fizmatlit, Moscow, 2005) [in Russian].

    Google Scholar 

  4. J.-Sh. Pang, “Error bounds in mathematical programming,” Math. Program. 79, 299–332 (1997).

    MATH  Google Scholar 

  5. F. Facchinei and J.-Sh. Pang, Finite-Dimensional Variational Inequalities and Complementary Problems (Springer, New York, 2003).

    Google Scholar 

  6. A. M. Ter-Krikorov, “Convex programming in a space adjoint to a Banach space and convex optimal control problems with phase constraints,” USSR Comput. Math. Math. Phys. 16 (2), 68–75 (1976).

    Article  MATH  MathSciNet  Google Scholar 

  7. A. V. Arutyunov, “Covering mappings in metric spaces and fixed points,” Dokl. Math. 76 (2), 665–668 (2007).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. V. Arutyunov, “An iterative method for finding coincidence points of two mappings,” Comput. Math. Math. Phys. 52 (1), 1483–1486 (2012).

    Article  MathSciNet  Google Scholar 

  9. A. S. Lewis and J.-S. Pang, “Error bounds for convex inequality systems,” Proceedings of the Fifth International Symposium of Generalized Convexity (Luminy, 1996).

    Google Scholar 

  10. O. L. Mangasarian, “Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification,” Math. Program. Tech. Rep. 96–04 (Computer Sci. Dep., Univ. of Wisconsin, Madison, 1996).

    Google Scholar 

  11. F. P. Vasil’ev, Optimization Methods (Faktorial, Moscow, 2002) [in Russian].

    Google Scholar 

  12. A. D. Ioffe and V. M. Tikhomirov, Theory of Optimization Problems (Nauka, Moscow, 1974) [in Russian].

    Google Scholar 

  13. G. J. Zalmai, “A continuous-time generalization of Gordan’s transposition theorem,” J. Math. Anal. Appl. 110, 130–140 (1985).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. V. Arutyunov.

Additional information

Original Russian Text © A.V. Arutyunov, S.E. Zhukovskiy, 2015, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2015, Vol. 55, No. 9, pp. 1486–1492.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arutyunov, A.V., Zhukovskiy, S.E. On estimates for solutions of systems of convex inequalities. Comput. Math. and Math. Phys. 55, 1444–1450 (2015). https://doi.org/10.1134/S0965542515070039

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation