Abstract
METHODS of finding the minima of convex functions with constraints of the recursive type on the range of variation of the argument, are proposed. A generalization of the algorithms for minimizing non-smooth functions is given. The methods are used to solve discontinuous games and to find saddle points. Some results of numerical calculations are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: USSR Computational Mathematics and Mathematical Physics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.