On estimates for solutions of systems of convex inequalities

DOI10.1134/S0965542515070039zbMath1331.49018OpenAlexW1959803851MaRDI QIDQ901843

Sergey Zhukovskiy, Aram V. Arutyunov

Publication date: 6 January 2016

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542515070039

zbMATH Keywords

set-valued mappingsconvex functionsconvex inequalitiesLebesgue setdistance estimates

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Related Items (1)

A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation

Cites Work

• Covering mappings in metric spaces and fixed points
• A continuous-time generalization of Gordan's transposition theorem
• Error bounds in mathematical programming
• Pointwise residual method as applied to some problems of linear algebra and linear programming
• An iterative method for finding coincidence points of two mappings
• Convex programming in a space adjoint to a banach space and convex optimal control problems with phase constraints
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: On estimates for solutions of systems of convex inequalities