Abstract
Some optimization problems can be reduced to finding a solution of a system of linear inequalities which belongs to a closed convex subset. In some optimization methods such a solution (or at least a better approximation of such a solution than the current one) should be found in each iteration. In the article, we present various projection methods to solve this problem. Furthermore, we show the relationship between these methods. We show that all presented methods can be reduced to the surrogate constraints method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.