Abstract

AbstractFinding the projection of a point onto a convex set is a problem of computational geometry that plays an essential role in mathematical programming and nondifferentiable optimization. Recently proposed Charged Balls Method allows one to solve this problem for the case when the boundary of the set is given by smooth function. In this chapter, we give an overview of Charged Balls Method and show that the method is applicable also for nonsmooth case. More specifically, we consider the set that is defined by a maximum of a finite number of smooth functions. Obtained results show that even in case of the set with nonsmooth boundary, Charged Balls Method still solves the problem quite competitive effectively in comparison with other algorithms. This is confirmed by the results of numerical experiments.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.